Magic Resource Can Enhance the Quantum Capacity of Channels

Abstract

We investigate the role of magic resource in the quantum capacity of channels. We consider the quantum channel of the recently proposed discrete beam splitter with the fixed environmental state. We find that if the fixed environmental state is a stabilizer state, then the quantum capacity is zero. Moreover, we find that the quantum capacity is nonzero for some magic states, and the quantum capacity increases linearly with respect to the number of single-qudit magic states in the environment. We also bound the maximal quantum capacity of the discrete beam splitter in terms of the amount of magic resource in the environmental states. These results suggest that magic resource can increase the quantum capacity of channels; it sheds new insight into the role of stabilizer and magic states in quantum communication.

V3. 7+9 pages, new results are added, close to the published version V2. typos are fixed V1. 5+6 pages

References in corpus (59)

• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Encoding a qubit in an oscillator
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• General Benchmarks for Quantum Repeaters
• Fundamental Limits of Repeaterless Quantum Communications
• Characterizing Quantum Supremacy in Near-Term Devices
• Strong quantum computational advantage using a superconducting quantum processor
• Universal Quantum Computation with Continuous-Variable Cluster States
• The capacity of the noisy quantum channel
• On the impossibility of distilling Gaussian states with Gaussian operations
• The characterization of Gaussian operations and Distillation of Gaussian States
• The Resource Theory of Stabilizer Computation
• Gaussian transformations and distillation of entangled Gaussian states
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Negative Quasi-Probability as a Resource for Quantum Computation
• Quantum Communication With Zero-Capacity Channels
• Hudson's Theorem for finite-dimensional quantum systems
• A No-Go Theorem for Gaussian Quantum Error Correction
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Quantum Channel Capacity of Very Noisy Channels
• Trading classical and quantum computational resources
• Stabilizer Rényi entropy
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Quantum Capacities of Bosonic Channels
• Convex resource theory of non-Gaussianity
• Improved quantum capacity bounds of Gaussian loss channels and achievable rates with Gottesman-Kitaev-Preskill codes
• One-mode Bosonic Gaussian channels: a full weak-degradability classification
• Quantifying the magic of quantum channels
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Unbounded number of channel uses are required to see quantum capacity
• Gaussian quantum resource theories
• The private capacity of quantum channels is not additive
• Limitations of quantum computing with Gaussian cluster states
• Gaussian bosonic synergy: quantum communication via realistic channels of zero quantum capacity
• Narrow Bounds for the Quantum Capacity of Thermal Attenuators
• On the statistical complexity of quantum circuits
• Resource theory of quantum scrambling
• Energy-constrained private and quantum capacities of quantum channels
• Quantum trade-off coding for bosonic communication
• Non-Gaussian operations on bosonic modes of light: Photon-added Gaussian channels
• Efficient classical simulation of Clifford circuits with nonstabilizer input states
• Quantum advantage of unitary Clifford circuits with magic state inputs
• Lower bound for the T count via unitary stabilizer nullity
• Quantum Entropy and Central Limit Theorem
• Classical shadows with Pauli-invariant unitary ensembles
• Optimal Gaussian Entanglement Swapping
• Could Gaussian regenerative stations act as quantum repeaters?
• Enhanced energy-constrained quantum communication over bosonic Gaussian channels
• Further extensions of Clifford circuits and their classical simulation complexities
• Complexity of quantum circuits via sensitivity, magic, and coherence
• Capacity Estimates via comparison with TRO channels
• Bosonic quantum communication across arbitrarily high loss channels
• Effects of quantum resources on the statistical complexity of quantum circuits
• Classical simulation of quantum circuits by half Gauss sums
• Assisted concentration of Gaussian resources
• Magic of Random Matrix Product States

Cited by in corpus (7)

• Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
• Quantum Ruzsa Divergence to Quantify Magic
• Characterization of non-adaptive Clifford channels
• Scalable protocol to coherence estimation from scarce data: Theory and experiment
• Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic Resources
• Decoded Quantum Interferometry Under Noise
• Quantum-Processing-Assisted Classical Communications