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

• 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)
• 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)
• 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.