Fault-tolerant quantum computing with the parity code and noise-biased qubits
- URL: http://arxiv.org/abs/2404.11332v1
- Date: Wed, 17 Apr 2024 12:49:31 GMT
- Title: Fault-tolerant quantum computing with the parity code and noise-biased qubits
- Authors: Anette Messinger, Valentin Torggler, Berend Klaver, Michael Fellner, Wolfgang Lechner,
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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. The code layout can be dynamically adjusted to algorithmic requirements on-the-fly. This allows reaching arbitrary code distances and thereby exponential suppression of errors with a universal set of fault-tolerant gates. In addition to the previously explored tool-sets for concatenated cat codes, our approach features parallelizable interactions between arbitrary sets of qubits by directly addressing the parity qubits in the code. The proposed scheme enables codes with less physical qubit overhead compared to the repetition code with the same code distances, while requiring only weight-3 and weight-4 stabilizers and nearest neighbor 2D square-lattice connectivity.
Related papers
- Fault-tolerant Fusion-based Quantum Computing with the Four-legged Cat Code [0.0]
The four-legged cat code is a quantum error-correcting code designed to address the predominant error in bosonic modes: single-photon loss.<n>We propose a planar fault-tolerant architecture for this code by concatenating it with the XZZX code via fusion-based error-correction.
arXiv Detail & Related papers (2025-08-05T18:00:00Z) - Directional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware [0.0]
Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise.<n>Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and feasible scalability.<n>We construct a new family of qLDPC codes, which outperforms the rotated planar code (RPC)<n>We numerically evaluate the performance of directional codes, encoding four, six and twelve logical qubits.
arXiv Detail & Related papers (2025-07-25T16:57:21Z) - Fast correlated decoding of transversal logical algorithms [67.01652927671279]
Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
arXiv Detail & Related papers (2025-05-19T18:00:00Z) - Demonstrating dynamic surface codes [138.1740645504286]
We experimentally demonstrate three time-dynamic implementations of the surface code.
First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.
Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.
Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
arXiv Detail & Related papers (2024-12-18T21:56:50Z) - Architectures for Heterogeneous Quantum Error Correction Codes [13.488578754808676]
Heterogeneous architectures provide a clear path to universal logical computation.
We propose integrating the surface code and gross code using an ancilla bus for inter-code data movement.
We demonstrate physical qubit reductions of up to 6.42x when executing an algorithm to a specific logical error rate.
arXiv Detail & Related papers (2024-11-05T15:49:02Z) - High-rate quantum LDPC codes for long-range-connected neutral atom registers [0.0]
High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are desirable for fault-tolerant quantum computing.
We show how these codes can be integrated in two-dimensional static neutral atom qubit architectures with open boundaries.
arXiv Detail & Related papers (2024-04-19T17:14:03Z) - Experimental fault-tolerant code switching [1.9088985324817254]
We present the first experimental implementation of fault-tolerant code switching between two codes.
We construct logical circuits and prepare 12 different logical states which are not accessible in a fault-tolerant way within a single code.
Our results experimentally open up a new route towards deterministic control over logical qubits with low auxiliary qubit overhead.
arXiv Detail & Related papers (2024-03-20T16:40:57Z) - Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing.
In this paper, we show that such constrained architectures can also support fault tolerance.
We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
arXiv Detail & Related papers (2024-02-19T23:31:55Z) - LDPC-cat codes for low-overhead quantum computing in 2D [3.9373541926236766]
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.
arXiv Detail & Related papers (2024-01-17T19:00:05Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - 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) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - 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) - Interleaving: Modular architectures for fault-tolerant photonic quantum
computing [50.591267188664666]
Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays.
We present a modular architecture for FBQC in which these components are combined to form "interleaving modules"
Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
arXiv Detail & Related papers (2021-03-15T18:00:06Z) - The cost of universality: A comparative study of the overhead of state
distillation and code switching with color codes [63.62764375279861]
We compare two leading FT implementations of the T gate in 2D color codes under circuit noise.
We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
arXiv Detail & Related papers (2021-01-06T19: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.