Entanglement-Assisted Quantum Communication Beating the Quantum Singleton Bound
arXiv:2007.01249 · doi:10.1103/PhysRevA.103.L020601
Abstract
Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that pre-shared entanglement between sender and receiver enables quantum communication protocols that have better parameters than schemes without the assistance of entanglement. Subsequently, the same authors derived a version of the so-called quantum Singleton bound that relates the parameters of the entanglement-assisted quantum-error correcting codes proposed by them. We present a new entanglement-assisted quantum communication scheme with parameters violating this bound in certain ranges.
References in corpus (2)
Cited by in corpus (8)
- Entropic proofs of Singleton bounds for quantum error-correcting codes
- How Much Entanglement Does a Quantum Code Need?
- Entanglement-assisted concatenated quantum codes
- Singleton Bounds for Entanglement-Assisted Classical and Quantum Error Correcting Codes
- Impure codes exceeding the pure bounds for quantum local recovery
- Bounds on concatenated entanglement-assisted quantum error-correcting codes
- New entanglement-assisted quantum MDS codes with length
- Cyclic codes and some new entanglement-assisted quantum MDS codes