Approximate Unitary n^2/3-Designs Give Rise to Quantum Channels with Super Additive Classical Holevo Capacity

DOI10.4230/LIPIcs.TQC.2019.9OpenAlexW2938169842MaRDI QIDQ5089156

No author found.

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1902.10808

zbMATH Keywords

Haar measureapproximate unitary t-designpolyomial approximationclassical Holevo capacitysuper additivity

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Local random quantum circuits are approximate polynomial-designs
• Hastings's additivity counterexample via Dvoretzky's theorem
• Some inequalities for Gaussian processes and applications
• Additivity of the capacity of depolarizing channels
• Geometric aspects of functional analysis. Israel seminar (GAFA) 1987--88
• Counterexamples to the maximal \(p\)-norm multiplicativity conjecture for all \(p>1\)
• SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
• Numerical Cubature from Archimedes' Hat-box Theorem
• Large deviation bounds for k -designs
• High-Dimensional Probability
• The capacity of the quantum depolarizing channel
• Additivity of the classical capacity of entanglement-breaking quantum channels
• Additivity for unital qubit channels
• Nonadditivity of Rényi entropy and Dvoretzky’s theorem
• Mixed-state entanglement and quantum error correction
• Unnamed Item
• Unnamed Item
• Unnamed Item