Equivalence Classes of Quantum Error-Correcting Codes
- URL: http://arxiv.org/abs/2406.12083v1
- Date: Mon, 17 Jun 2024 20:48:43 GMT
- Title: Equivalence Classes of Quantum Error-Correcting Codes
- Authors: Andrey Boris Khesin, Alexander Li,
- Abstract summary: 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.
- Score: 49.436750507696225
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. Using ZX calculus, we represent QECC's in a form called a ZX diagram, consisting of a tensor network. In this paper, we present canonical forms for CSS codes and CSS states (which are CSS codes with 0 inputs), and we show the resulting canonical forms for the toric code and certain surface codes. Next, we introduce the notion of prime code diagrams, ZX diagrams of codes that have a single connected component with the property that no sequence of rewrite rules can split such a diagram into two connected components. We also show the Fundamental Theorem of Clifford Codes, proving the existence and uniqueness of the prime decomposition of Clifford codes. Next, we tabulate equivalence classes of ZX diagrams under a different definition of equivalence that allows output permutations and any local operations on the outputs. Possible representatives of these equivalence classes are analyzed. This work expands on previous works in exploring the canonical forms of QECC's in their ZX diagram representations.
Related papers
- Scalable spider nests (...or how to graphically grok transversal non-Clifford gates) [0.0]
This is the second in a series of "graphical grokking" papers.
We show that certain complex rules involving ZX diagrams, called spider nest identities, can be captured using the ZX calculus.
arXiv Detail & Related papers (2024-04-11T15:12:41Z) - Graphical CSS Code Transformation Using ZX Calculus [0.6734802552703861]
We present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams.
We show how ZX and graphical encoder maps relate several equivalent perspectives on these code-transforming operations.
arXiv Detail & Related papers (2023-07-05T17:04:49Z) - Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions.
This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
arXiv Detail & Related papers (2023-04-05T20:28:04Z) - 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) - Graphical quantum Clifford-encoder compilers from the ZX calculus [1.6385815610837167]
We present a quantum compilation algorithm that maps Clifford encoders to a unique graphical representation in the ZX calculus.
Specifically, we develop a canonical form in the ZX calculus and prove canonicity as well as efficient reducibility of any Clifford encoder into the canonical form.
arXiv Detail & Related papers (2023-01-06T01:41:06Z) - Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages.
The computation can then be implemented using a series of non-Pauli measurements on this graph state.
arXiv Detail & Related papers (2022-09-15T14:52:31Z) - Phase-free ZX diagrams are CSS codes (...or how to graphically grok the
surface code) [0.0]
We show a direct correspondence between phase-free ZX diagrams and Calderbank-Shor-Steane codes.
CSS codes are a family of quantum error correcting codes constructed from classical codes.
We show that we can extend this translation to stabilisers and logical operators of any (possibly non-maximal) CSS code by "bending wires"
arXiv Detail & Related papers (2022-04-29T12:17:51Z) - Quantum Lego: Building Quantum Error Correction Codes from Tensor
Networks [0.0]
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.
arXiv Detail & Related papers (2021-09-16T18:00:00Z) - PBS-Calculus: A Graphical Language for Coherent Control of Quantum
Computations [77.34726150561087]
We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations.
We equip the language with an equational theory, which is proved to be sound and complete.
We consider applications like the implementation of controlled permutations and the unrolling of loops.
arXiv Detail & Related papers (2020-02-21T16:15:58Z)
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.