On a Problem Concerning the Quantum Hamming Bound for Impure Quantum Codes
From MaRDI portal
Cited in
(4)- A construction of optimal nonbinary pure quantum stabilizer codes
- Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems
- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
- Quantum data-syndrome codes: subsystem and impure code constructions
This page was built for publication: On a Problem Concerning the Quantum Hamming Bound for Impure Quantum Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281323)