Grand Unification of continuous-variable codes
- URL: http://arxiv.org/abs/2206.01751v1
- Date: Fri, 3 Jun 2022 18:00:01 GMT
- Title: Grand Unification of continuous-variable codes
- Authors: Allan D. C. Tosta, Thiago O. Maciel, Leandro Aolita
- Abstract summary: Quantum error correction codes in continuous variables (also called CV codes, or single-mode bosonic codes) have been identified to be a technologically viable option for building fault-tolerant quantum computers.
Best-known examples are the GKP code and the cat-code, both of which were shown to have some advantageous properties over any discrete-variable, or qubit codes.
It was recently shown that the cat-code, as well as other kinds of CV codes, belong to a set of codes with common properties called rotation-symmetric codes.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum error correction codes in continuous variables (also called CV codes,
or single-mode bosonic codes) have recently been identified to be a
technologically viable option for building fault-tolerant quantum computers.
The best-known examples are the GKP code and the cat-code, both of which were
shown to have some advantageous properties over any discrete-variable, or qubit
codes. It was recently shown that the cat-code, as well as other kinds of CV
codes, belong to a set of codes with common properties called
rotation-symmetric codes. We expand this result by giving a general description
of sets of codes with common properties, and rules by which they can be mapped
into one another, effectively creating a unified description of
continuous-variable codes. We prove that the properties of all of these sets of
codes can be obtained from the properties of the GKP code. We also show
explicitly how this construction works in the case of rotation-symmetric codes,
re-deriving known properties and finding new ones.
Related papers
- Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts.
A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
arXiv Detail & Related papers (2024-10-10T04:07:24Z) - Class of codes correcting absorptions and emissions [59.90381090395222]
We construct a family of quantum codes that protect against all emission, absorption, dephasing, and raising/lowering errors up to an arbitrary fixed order.
We derive simplified error correction conditions for a general AE code and show that any permutation-invariant code that corrects $le t$ errors can be mapped to an AE code.
arXiv Detail & Related papers (2024-10-04T16:14:03Z) - Maximally Extendable Sheaf Codes [5.439020425819001]
We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes.
We introduce a new property of a sheaf code, called maximalibility, which ensures that within class of codes on the same coded space, we encounter as few obstructions as possible.
arXiv Detail & Related papers (2024-03-06T12:20:49Z) - Small Quantum Codes from Algebraic Extensions of Generalized Bicycle
Codes [4.299840769087443]
Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance.
We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
arXiv Detail & Related papers (2024-01-15T10:38:13Z) - 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) - Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space.
We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit.
We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
arXiv Detail & Related papers (2023-01-24T14:17:07Z) - 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) - 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) - Modifying method of constructing quantum codes from highly entangled
states [0.0]
We provide explicit constructions for codewords, encoding procedure and stabilizer formalism of the QECCs.
We modify the method to produce another set of stabilizer QECCs that encode a logical qudit into a subspace spanned by AME states.
arXiv Detail & Related papers (2020-05-04T12:28: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.