Asymmetric Quantum Concatenated and Tensor Product Codes with Large
Z-Distances
- URL: http://arxiv.org/abs/2012.00226v2
- Date: Fri, 12 Mar 2021 04:58:58 GMT
- Title: Asymmetric Quantum Concatenated and Tensor Product Codes with Large
Z-Distances
- Authors: Jihao Fan, Jun Li, Jianxin Wang, Zhihui Wei and Min-Hsiu Hsieh
- Abstract summary: We present a new construction of asymmetric quantum codes (AQCs) by combining classical tensord codes (CCs) with tensor product codes (TPCs)
Most AQCTPCs are highly degenerate, which means they can correct many more errors than their classical counterparts.
We generalize our concatenation scheme by using the generalized CCs and TPCs.
- Score: 27.90363292358871
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper, we present a new construction of asymmetric quantum codes
(AQCs) by combining classical concatenated codes (CCs) with tensor product
codes (TPCs), called asymmetric quantum concatenated and tensor product codes
(AQCTPCs) which have the following three advantages. First, only the outer
codes in AQCTPCs need to satisfy the orthogonal constraint in quantum codes,
and any classical linear code can be used for the inner, which makes AQCTPCs
very easy to construct. Second, most AQCTPCs are highly degenerate, which means
they can correct many more errors than their classical TPC counterparts.
Consequently, we construct several families of AQCs with better parameters than
known results in the literature. Third, AQCTPCs can be efficiently decoded
although they are degenerate, provided that the inner and outer codes are
efficiently decodable. In particular, we significantly reduce the inner
decoding complexity of TPCs from $\Omega(n_2a^{n_1})(a>1)$ to $O(n_2)$ by
considering error degeneracy, where $n_1$ and $n_2$ are the block length of the
inner code and the outer code, respectively. Furthermore, we generalize our
concatenation scheme by using the generalized CCs and TPCs correspondingly.
Related papers
- SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes.
Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes.
We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
arXiv Detail & Related papers (2024-07-12T16:50:01Z) - Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes [5.224344210588583]
We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to quantum locally testable codes.
For t=4 our construction gives a new family of "almost-good" quantum LTCs -- with constant relative rate, inverse-polylogarithmic relative distance and soundness, and constant-size parity checks.
arXiv Detail & Related papers (2024-02-12T08:32:13Z) - Spatially-Coupled QDLPC Codes [3.6622737533847936]
We describe toric codes as quantum counterparts of classical spatially-coupled (2D-SC) codes.
We introduce spatially-coupled quantum LDPC (SC-QLDPC) codes as a class of convolutional LDPC codes.
This paper focuses on QLDPC codes with rate less than 1/10, but we construct 2D-SC HGP codes with small memories, higher rates (about 1/3), and superior thresholds.
arXiv Detail & Related papers (2023-04-29T00:57:57Z) - 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) - Hierarchical memories: Simulating quantum LDPC codes with local gates [0.05156484100374058]
Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories.
We construct a new family of hierarchical codes, that encode a number of logical qubits K = Omega(N/log(N)2.
Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.
arXiv Detail & Related papers (2023-03-08T18:48:12Z) - 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) - Quantum Error Correction via Noise Guessing Decoding [0.0]
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation.
This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
arXiv Detail & Related papers (2022-08-04T16:18:20Z) - Entanglement-assisted concatenated quantum codes [77.34669920414821]
Entanglement-assistedd quantum codes (EACQCs) constructed by concatenating two quantum codes are proposed.
EACQCs show several advantages over the standard quantum codes (CQCs)
EACQCs are not only competitive in quantum communication but also applicable in fault-tolerant quantum computation.
arXiv Detail & Related papers (2022-02-16T14:14:02Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Trapping Sets of Quantum LDPC Codes [9.482750811734565]
We identify and classify quantum trapping sets (QTSs) according to their topological structure and decoder used.
We show that the knowledge of QTSs can be used to design better QLDPC codes and decoders.
arXiv Detail & Related papers (2020-12-30T19:35:17Z)
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.