Quantum spherical codes
- URL: http://arxiv.org/abs/2302.11593v2
- Date: Thu, 7 Dec 2023 23:33:39 GMT
- Title: Quantum spherical codes
- Authors: Shubham P. Jain and Joseph T. Iosue and Alexander Barg and Victor V.
Albert
- Abstract summary: 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.
- Score: 55.33545082776197
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 while requiring a similar
type of overhead. Our polytope-based cat codes consist of sets of points with
large separation that at the same time form averaging sets known as spherical
designs. We also recast concatenations of CSS codes with cat codes as quantum
spherical codes, revealing a new way to autonomously protect against dephasing
noise.
Related papers
- Letting the tiger out of its cage: bosonic coding without concatenation [3.2055955766884465]
Cat codes are encodings into a single photonic or phononic mode that offer a promising avenue for hardware-efficient fault-tolerant quantum computation.
We construct multimode codes with similar linear constraints using any two integer matrices satisfying the homological condition of a quantum rotor code.
Just like the pair-cat code, syndrome extraction can be performed in tandem with stabilizing dissipation using current superconducting-circuit designs.
arXiv Detail & Related papers (2024-11-14T18:38:33Z) - List Decodable Quantum LDPC Codes [49.2205789216734]
We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff.
We get efficiently list decodable QLDPC codes with unique decoders.
arXiv Detail & Related papers (2024-11-06T23:08:55Z) - Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes [16.55015892533456]
The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes.
A refined lower bound on the minimum distance of the resulting quantum codes is established.
We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.
arXiv Detail & Related papers (2024-05-23T21:10:23Z) - Dihedral Quantum Codes [0.0]
We present the code construction and give a formula for the code dimension, depending on the two classical codes that the CSS code is based on.
We also give a lower bound on the code distance and construct an example of short dihedral quantum codes.
arXiv Detail & Related papers (2023-10-23T16:55:34Z) - 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) - 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) - Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians [7.092674229752723]
We introduce a framework that takes it any classical code and explicitly constructs the corresponding QEC code.
A concrete advantage is that the desirable properties of a classical code are automatically incorporated in the design of the resulting quantum code.
arXiv Detail & Related papers (2020-12-02T19:00:19Z) - Universal classical-quantum superposition coding and universal
classical-quantum multiple access channel coding [67.6686661244228]
We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code.
We establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets.
arXiv Detail & Related papers (2020-11-01T03:26:08Z) - 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.