Comparison of 2D topological codes and their decoding performances
- URL: http://arxiv.org/abs/2202.06612v1
- Date: Mon, 14 Feb 2022 11:01:02 GMT
- Title: Comparison of 2D topological codes and their decoding performances
- Authors: Kao-Yueh Kuo and Ching-Yi Lai
- Abstract summary: Topological quantum codes are favored because they allow qubit layouts that are suitable for practical implementation.
We show that various two-dimensional topological codes, CSS or non-CSS, can be decoded by MBP, including color codes and twisted XZZX codes.
- Score: 4.340338299803562
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Topological quantum codes are favored because they allow qubit layouts that
are suitable for practical implementation. An $N$-qubit topological code can be
decoded by minimum-weight perfect matching (MWPM) with complexity
$O(\text{poly}(N))$ if it is of CSS-type. Recently it is shown that various
quantum codes, including non-CSS codes, can be decoded by an adapted belief
propagation with memory effects (denoted MBP) with complexity almost linear in
$N$. In this paper, we show that various two-dimensional topological codes, CSS
or non-CSS, regardless of the layout, can be decoded by MBP, including color
codes and twisted XZZX codes. We will comprehensively compare these codes in
terms of code efficiency and decoding performance, assuming perfect error
syndromes.
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) - Quantum LDPC codes from intersecting subsets [0.0]
This paper introduces a quantum construction of CSS codes from a component CSS codes and two collections of subsets.
The resulting codes have parallelizable encoding and syndrome measurement circuits and built-in redundancy in the syndrome measurements.
arXiv Detail & Related papers (2023-06-09T17:30:11Z) - Discovery of Optimal Quantum Error Correcting Codes via Reinforcement
Learning [0.0]
The recently introduced Quantum Lego framework provides a powerful method for generating complex quantum error correcting codes.
We gamify this process and unlock a new avenue for code design and discovery using reinforcement learning (RL)
We train on two such properties, maximizing the code distance, and minimizing the probability of logical error under biased Pauli noise.
arXiv Detail & Related papers (2023-05-10T18:00:03Z) - 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) - CSS code surgery as a universal construction [51.63482609748332]
We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes.
We describe code surgery between such codes using a specific colimit in the category of chain complexes.
arXiv Detail & Related papers (2023-01-31T16:17:25Z) - Tackling Long Code Search with Splitting, Encoding, and Aggregating [67.02322603435628]
We propose a new baseline SEA (Split, Encode and Aggregate) for long code search.
It splits long code into code blocks, encodes these blocks into embeddings, and aggregates them to obtain a comprehensive long code representation.
With GraphCodeBERT as the encoder, SEA achieves an overall mean reciprocal ranking score of 0.785, which is 10.1% higher than GraphCodeBERT on the CodeSearchNet benchmark.
arXiv Detail & Related papers (2022-08-24T02:27:30Z) - 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) - KO codes: Inventing Nonlinear Encoding and Decoding for Reliable
Wireless Communication via Deep-learning [76.5589486928387]
Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes.
In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs.
KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
arXiv Detail & Related papers (2021-08-29T21:08:30Z) - Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit
Topological Codes [3.9962751777898955]
We show that trellis decoders have strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed.
The modified decoder works for any stabilizer code $S$ and separates into two parts: a one-time, offline which builds a compact, graphical representation of the normalizer of the code, $Sperp$, and a quick, parallel, online computation using the Viterbi algorithm.
arXiv Detail & Related papers (2021-06-15T16:01:42Z) - Classical Coding Problem from Transversal $T$ Gates [10.478611957969145]
We show that triorthogonal codes are, essentially, the only family of CSS codes that realize logical $T$ via physical $T$.
We also use Ax's theorem to characterize the logical operation realized on a family of quantum Reed-Muller codes.
arXiv Detail & Related papers (2020-01-14T16:45:48Z)
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.