Galois hulls of MDS codes and their quantum error correction
- URL: http://arxiv.org/abs/2002.12892v2
- Date: Sun, 5 Apr 2020 02:39:36 GMT
- Title: Galois hulls of MDS codes and their quantum error correction
- Authors: Meng Cao
- Abstract summary: We give new families of MDS codes with Galois hulls of arbitrary dimensions.
We construct nine new families of MDS entanglement-assisted quantum error-correcting codes.
- Score: 18.763290930749235
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The hull of linear codes plays an important role in quantum information and
coding theory. In the present paper, by investigating the Galois hulls of
generalized Reed-Solomon (GRS) codes and extended GRS codes over the finite
field Fq, we give several new families of MDS codes with Galois hulls of
arbitrary dimensions that are not obtained before. Some of them generalize the
ones in the literature [13]. As a consequence, using these MDS codes with
Galois hulls of arbitrary dimensions, we construct nine new families of MDS
entanglement-assisted quantum error-correcting codes (EAQECCs) with flexible
parameters.
Related papers
- 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) - Quotient Space Quantum Codes [0.0]
This letter establishes the quotient space codes to construct quantum codes.
This new code unifies additive codes and codeword stabilized codes and can transmit classical codewords.
The quotient space approach offers a concise and clear mathematical form for the study of quantum error-correcting codes.
arXiv Detail & Related papers (2023-11-13T12:03:59Z) - Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit.
These codes can be customized to the specific physical errors on the qudit, effectively suppressing them.
We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
arXiv Detail & Related papers (2023-07-20T10:51:23Z) - 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) - Grand Unification of continuous-variable codes [0.0]
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.
arXiv Detail & Related papers (2022-06-03T18:00:01Z) - Gottesman-Kitaev-Preskill codes: A lattice perspective [0.7734726150561088]
We show how different decoding strategies are precisely related, propose new ways to obtain GKP codes by means of glued lattices and the product of lattices.
We present general results that we illustrate through examples taken from different classes of codes, including scaled self-dual GKP codes and the tensord surface-GKP code.
arXiv Detail & Related papers (2021-09-29T18:08:37Z) - 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) - Cellular automaton decoders for topological quantum codes with noisy
measurements and beyond [68.8204255655161]
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes.
For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold.
We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
arXiv Detail & Related papers (2020-04-15T18:00:01Z)
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.