LDPC-cat codes for low-overhead quantum computing in 2D
- URL: http://arxiv.org/abs/2401.09541v2
- Date: Tue, 6 Feb 2024 10:59:51 GMT
- Title: LDPC-cat codes for low-overhead quantum computing in 2D
- Authors: Diego Ruiz, J\'er\'emie Guillaud, Anthony Leverrier, Mazyar Mirrahimi,
Christophe Vuillot
- Abstract summary: Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing.
An alternative approach to reduce the hardware overhead of fault-tolerance is to use bosonic cat qubits.
We propose an architecture based on cat qubits suppressed in classical LDPC codes for phase-flips.
- Score: 3.9373541926236766
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum low-density parity-check (qLDPC) codes are a promising construction
for drastically reducing the overhead of fault-tolerant quantum computing
(FTQC) architectures. However, all of the known hardware implementations of
these codes require advanced technologies, such as long-range qubit
connectivity, high-weight stabilizers, or multi-layered chip layouts. An
alternative approach to reduce the hardware overhead of fault-tolerance is to
use bosonic cat qubits where bit-flip errors are exponentially suppressed by
design. In this work, we combine both approaches and propose an architecture
based on cat qubits concatenated in classical LDPC codes correcting for
phase-flips. We find that employing such phase-flip LDPC codes provides two
major advantages. First, the hardware implementation of the code can be
realised using short-range qubit interactions in 2D and low-weight stabilizers,
which makes it readily compatible with current superconducting circuit
technologies. Second, we demonstrate how to implement a fault-tolerant
universal set of logical gates with a second layer of cat qubits while
maintaining the local connectivity. We conduct a numerical brute force
optimisation of these classical codes to find the ones with the best encoding
rate for algorithmically relevant code distances. We discover that some of the
best codes benefit from a cellular automaton structure. This allows us to
define families of codes with high encoding rates and distances. Finally, we
numerically assess the performance of our codes under circuit-level noise.
Assuming a physical phase-flip error probability $\epsilon \approx 0.1\%$, our
$[165+8\ell, 34+2\ell, 22]$ code family allows to encode $100$ logical qubits
with a total logical error probability (including both logical phase-flip and
bit-flip) per cycle and per logical qubit $\epsilon_L \leq 10^{-8}$ on a $758$
cat qubit chip.
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) - High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory [0.6144680854063939]
We present a new family of quantum low-density parity-check codes, which we call radial codes.
In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance.
Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
arXiv Detail & Related papers (2024-06-20T16:08:06Z) - Fault-tolerant quantum computing with the parity code and noise-biased qubits [0.0]
We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture.
The parity architecture can be understood as a LDPC code tailored specifically to obtain any desired logical connectivity from nearest neighbor physical interactions.
arXiv Detail & Related papers (2024-04-17T12:49:31Z) - Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable
Atom Arrays [5.542275446319411]
We propose a hardware-efficient scheme to perform fault-tolerant quantum computation with high-rate qLDPC codes on reconfigurable atom arrays.
Our work paves the way for explorations of low-overhead quantum computing with qLDPC codes at a practical scale.
arXiv Detail & Related papers (2023-08-16T19:47:17Z) - 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) - 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) - Scalable Quantum Error Correction for Surface Codes using FPGA [67.74017895815125]
A fault-tolerant quantum computer must decode and correct errors faster than they appear.
We report a distributed version of the Union-Find decoder that exploits parallel computing resources for further speedup.
The implementation employs a scalable architecture called Helios that organizes parallel computing resources into a hybrid tree-grid structure.
arXiv Detail & Related papers (2023-01-20T04:23:00Z) - 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 computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds.
We engineer an error bias at the lowest level of encoding using the surface code.
We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
arXiv Detail & Related papers (2022-12-03T06:16:07Z) - 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)
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.