Modifying method of constructing quantum codes from highly entangled states

Abstract

There is a connection between classical codes, highly entangled pure states (called k-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct stabilizer QECCs by starting from a k-uniform state or the corresponding classical code and tracing out one party at each step. We provide explicit constructions for codewords, encoding procedure and stabilizer formalism of the QECCs by describing the changes that partial traces cause on the corresponding generator matrix of the classical codes. We then modify the method to produce another set of stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states. This construction produces quantum codes starting from an AME state without tracing out any party. Therefore, quantum stabilizer codes with larger codespace can be constructed.

9 pages + Appendix, Comments are very welcome!

References in corpus (2)

• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation

Cited by in corpus (9)

• Holographic Codes from Hyperinvariant Tensor Networks
• Deterministic generation of qudit photonic graph states from quantum emitters
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Multipartite entanglement and quantum error identification in $D$-dimensional cluster states
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
• Codeword Stabilized Codes from m-Uniform Graph States
• Absolutely maximally entangled pure states of multipartite quantum systems
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays
• Scalable and fault-tolerant preparation of encoded k-uniform states