Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks

• URL: http://arxiv.org/abs/2109.08158v2
• Date: Wed, 11 May 2022 20:05:58 GMT
• Title: Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• Authors: ChunJun Cao and Brad Lackey
• Abstract summary: We represent complex code constructions as tensor networks built from the tensors of simple codes or states. The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes. We lay out some examples where we glue together simple stabilizer codes to construct non-trivial codes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or states in a modular fashion. Using a set of local moves known as operator pushing, one can derive properties of the more complex codes, such as transversal non-Clifford gates, by tracing the flow of operators in the network. The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes as well as non-stabilizer codes over qubits and qudits. For a contractible tensor network, the sequence of contractions also constructs a decoding/encoding circuit. To highlight the framework's range of capabilities and to provide a tutorial, we lay out some examples where we glue together simple stabilizer codes to construct non-trivial codes. These examples include the toric code and its variants, a holographic code with transversal non-Clifford operators, a 3d stabilizer code, and other stabilizer codes with interesting properties. Surprisingly, we find that the surface code is equivalent to the 2d Bacon-Shor code after "dualizing" its tensor network encoding map.

Related papers

• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• Local tensor-network codes [0.0]
  We show how to write some topological codes, including the surface code and colour code, as simple tensor-network codes. We prove that this method is efficient in the case of holographic codes.
  arXiv  Detail & Related papers  (2021-09-24T14:38:06Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)
• Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit Topological Codes [3.9962751777898955]
  We show that trellis decoders have strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed. The modified decoder works for any stabilizer code $S$ and separates into two parts: a one-time, offline which builds a compact, graphical representation of the normalizer of the code, $Sperp$, and a quick, parallel, online computation using the Viterbi algorithm.
  arXiv  Detail & Related papers  (2021-06-15T16:01:42Z)
• Approximate Bacon-Shor Code and Holography [0.0]
  We explicitly construct a class of holographic quantum error correction codes with non-algebra centers. We use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing) We then construct approximate versions of the holographic hybrid codes by "skewing" the code subspace.
  arXiv  Detail & Related papers  (2020-10-12T18:39:09Z)
• Tensor-network codes [0.0]
  We introduce tensor-network stabilizer codes which come with a natural tensor-network decoder. We generalize holographic codes beyond those constructed from perfect or block-perfect isometries. For holographic codes exact the tensor-network decoder is efficient with a complexity that is in the number of physical qubits.
  arXiv  Detail & Related papers  (2020-09-22T05:44:50Z)
• Graphical Structures for Design and Verification of Quantum Error Correction [3.9146761527401424]
  We introduce a high-level graphical framework for designing and analysing quantum error correcting codes. The framework is based on the diagrammatic tools of the zx-calculus of quantum observables. We show how CSS codes form a subset of CPC codes and, more generally, how to compute stabilizers for a CPC code.
  arXiv  Detail & Related papers  (2016-11-23T21:35:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.