New Binary Quantum Codes Constructed from Quasi-Cyclic Codes
- URL: http://arxiv.org/abs/2112.07137v3
- Date: Fri, 6 Jan 2023 01:05:31 GMT
- Title: New Binary Quantum Codes Constructed from Quasi-Cyclic Codes
- Authors: Chaofeng Guan, Ruihu Li, Liangdong Lu, Yu Yao
- Abstract summary: It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes.
This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be symplectic dual-containing.
As an application, we construct 8 binary quantum codes that exceed the best-known results.
- Score: 6.718184400443239
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: It is well known that quantum codes can be constructed by means of classical
symplectic dual-containing codes. This paper considers a family of
two-generator quasi-cyclic codes and derives sufficient conditions for these
codes to be symplectic dual-containing. Then, a new method for constructing
binary quantum codes using symplectic dual-containing codes is proposed. As an
application, we construct 8 binary quantum codes that exceed the best-known
results. Further, another 36 new binary quantum codes are obtained by
propagation rules, all of which improve the lower bound on the minimum
distances.
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) - 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) - 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) - Quotient Space Quantum Codes [0.0]
In this paper, I establish the quotient space codes to construct quantum codes.
These new codes unify additive codes and codeword stabilized codes and can transmit classical codewords.
I also present new bounds for quantum codes and provide a simple proof of the quantum Singleton bound.
arXiv Detail & Related papers (2023-11-13T12:03:59Z) - 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) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - 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) - A new family of quantum synchronizable codes from negacyclic codes [4.3702562340580755]
We propose a new method for construct quantum synchronizable codes from negacyclic codes.
This paper contributes to construct two classes quantum synchronizable codes, whose synchronization capabilities can reach the upper limit under certain conditions.
arXiv Detail & Related papers (2021-07-06T14:39:31Z) - Constructing quantum codes from any classical code and their embedding
in ground space of local Hamiltonians [6.85316573653194]
We give an algorithm that explicitly constructs quantum codes with linear distance and constant rate.
Motivated by quantum LDPC codes and the use of physics to protect quantum information, we introduce a new 2-local frustration free quantum spin chain Hamiltonian.
arXiv Detail & Related papers (2020-12-02T19:00:19Z)
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.