Journal of Physics A Mathematical and Theoretical · 2017 · 49 citations · 46 references
Natural SciencesComputer SciencePhysicsInformation TheoryQuantum ComputingQuantum MechanicsCoding TheoryError-correcting CodesQuantum CommunicationQuantum EntanglementQuantum TeleportationAds-cft CorrespondenceAds/cft CorrespondenceBell StatesEntangled StatesMixed StatesQuantum Error CorrectionQuantum Error-correcting CodesQuantum Secret Sharing
Abstract Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME states are of interest for multipartite teleportation and quantum secret sharing and have recently found new applications in the context of high-energy physics in toy models realizing the AdS/CFT-correspondence. We work out in detail the connection between AME states of minimal support and classical maximum distance separable (MDS) error correcting codes and, in particular, provide explicit closed form expressions for AME states of n parties with local dimension <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mstyle displaystyle="false"> <mml:mi>q</mml:mi> </mml:mstyle> </mml:math> a power of a prime for all <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mstyle displaystyle="false"> <mml:mi>q</mml:mi> <mml:mo>⩾</mml:mo> <mml:mi>n</mml:mi> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mstyle> </mml:math> . Building on this, we construct a generalization of the Bell-basis consisting of AME states and develop a stabilizer formalism for AME states. For every <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mstyle displaystyle="false"> <mml:mi>q</mml:mi> <mml:mo>⩾</mml:mo> <mml:mi>n</mml:mi> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mstyle> </mml:math> prime, we show how to construct stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states. Under a conjecture for which we provide numerical evidence, this construction produces a family of quantum error correcting codes <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mstyle displaystyle="false"> <mml:mo stretchy="false">[</mml:mo> <mml:mspace width="-3px"/> <mml:mo stretchy="false">[</mml:mo> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mn>2</mml:mn> <mml:mo stretchy="false">]</mml:mo> <mml:mspace width="-3px"/> <mml:msub> <mml:mo stretchy="false">]</mml:mo> <mml:mi>q</mml:mi> </mml:msub> </mml:mstyle> </mml:math> for n even with the highest distance allowed by the quantum Singleton bound.
46
Theory of quantum error-correcting codes
Emanuel Knill, Raymond Laflamme · Physical Review A · 1997 · 1.6K citations
Computing, Computer Science, Physics +15
Richard Cleve, Daniel Gottesman, Hoi‐Kwong Lo · Physical Review Letters · 1999 · 1.4K citations · Full text
Stabilizer Codes and Quantum Error Correction
Daniel Gottesman · 1997 · 1.2K citations · Full text