Quantum Codes of Maximal Distance and Highly Entangled Subspaces

Abstract

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d\ge 3$ is bounded by $n\le D^2+d-2$. We obtain their weight distribution and present additional bounds that arise from Rains' shadow inequalities. Our main result can be seen as a generalization of bounds that are known for the two special cases of stabilizer QMDS codes and absolutely maximally entangled states, and confirms the quantum MDS conjecture in the special case of distance-three codes. As the existence of QMDS codes is linked to that of highly entangled subspaces (in which every vector has uniform $r$-body marginals) of maximal dimension, our methods directly carry over to address questions in multipartite entanglement.

arXiv comment15 pages, 1 figure, 4 tables. Accepted 2020-06-09 in Quantum

References in corpus (28)

• Mixed State Entanglement and Quantum Error Correction
• Three qubits can be entangled in two inequivalent ways
• Topological quantum memory
• How to share a quantum secret
• Quantum Error Correction for Quantum Memories
• A Theory of Quantum Error-Correcting Codes
• Topological Quantum Distillation
• Quantum data processing and error correction
• Roads towards fault-tolerant universal quantum computation
• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• On optimal quantum codes
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• Absolute Maximal Entanglement and Quantum Secret Sharing
• Absolutely maximally entangled states of seven qubits do not exist
• On the dimension of subspaces with bounded Schmidt rank
• Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
• Quantum MDS Codes over Small Fields
• Generic local distinguishability and completely entangled subspaces
• On $[[n,n-4,3]{]}_q$ Quantum MDS Codes for odd prime power $q$
• Relative Entropy Convergence for Depolarizing Channels
• From unextendible product bases to genuinely entangled subspaces
• Non-Positive Partial Transpose Subspaces Can be as Large as Any Entangled Subspace
• Information-theoretic interpretation of quantum error-correcting codes
• Entanglement of Subspaces and Error Correcting Codes
• Exponentially many entanglement and correlation constraints for multipartite quantum states
• Entanglement of genuinely entangled subspaces and states: exact, approximate, and numerical results
• An approach to constructing genuinely entangled subspaces of maximal dimension
• Entanglement properties of positive operators with ranges in completely entangled subspaces

Cited by in corpus (28)

• Entropic proofs of Singleton bounds for quantum error-correcting codes
• Thirty-six entangled officers of Euler: Quantum solution to a classically impossible problem
• $k$-Uniform states and quantum information masking
• Absolutely maximally entangled states, quantum maximum distance separable codes, and quantum repeaters
• Universal construction of genuinely entangled subspaces of any size
• Positive maps and trace polynomials from the symmetric group
• Algebraic Quantum Codes: Linking Quantum Mechanics and Discrete Mathematics
• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems
• Simple sufficient condition for subspace to be completely or genuinely entangled
• Construction of genuinely multipartite entangled subspaces and the associated bounds on entanglement measures for mixed states
• On the probabilistic quantum error correction
• Fully non-positive-partial-transpose genuinely entangled subspaces
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Multipartite entanglement and quantum error identification in $D$-dimensional cluster states
• Construction of genuinely entangled multipartite subspaces from bipartite ones by reducing the total number of separated parties
• A Complete Hierarchy of Linear Systems for Certifying Quantum Entanglement of Subspaces
• Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
• Quantifying subspace entanglement with geometric measures
• Multiparticle singlet states cannot be maximally entangled for the bipartitions
• Four-qubit critical states
• Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes
• Performance Analysis of Quantum CSS Error-Correcting Codes via MacWilliams Identities
• Bell inequalities with overlapping measurements
• Entangled Subspaces through Algebraic Geometry
• On two maximally entangled couples
• Codeword Stabilized Codes from m-Uniform Graph States
• Multiqubit monogamy relations beyond shadow inequalities
• Absolutely maximally entangled pure states of multipartite quantum systems