How Much Entanglement Does a Quantum Code Need?
arXiv:2207.05647 · doi:10.1007/s11128-023-04211-x
Abstract
In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better information rates or improved error handling properties. Entanglement incurs costs and must be judiciously calibrated in designing quantum codes with good performance, relative to their deployment parameters. Revisiting known constructions, we devise tools from classical coding theory to better understand how the amount of entanglement can be varied. We present three new propagation rules and discuss how each of them affects the error handling. Tables listing the parameters of the best performing qubit and qutrit EAQECCs that we can explicitly construct are supplied for reference and comparison.
References in corpus (2)
Cited by in corpus (5)
- Quantum error-correcting codes from projective Reed-Muller codes and their hull variation problem
- MDS, Hermitian Almost MDS, and Gilbert-Varshamov Quantum Codes from Generalized Monomial-Cartesian Codes
- Quasi-cyclic codes of index 2
- On the hull-variation problem of equivalent vector rank metric codes
- Bounds on concatenated entanglement-assisted quantum error-correcting codes