Toward a 2D Local Implementation of Quantum LDPC Codes

• URL: http://arxiv.org/abs/2404.17676v1
• Date: Fri, 26 Apr 2024 19:48:07 GMT
• Title: Toward a 2D Local Implementation of Quantum LDPC Codes
• Authors: Noah Berthusen, Dhruv Devulapalli, Eddie Schoute, Andrew M. Childs, Michael J. Gullans, Alexey V. Gorshkov, Daniel Gottesman,
• Abstract summary: Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes. We present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates.
• Score: 1.1936126505067601
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes which affects code performance and ease of physical realization. For device architectures restricted to 2D local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investigate the family of bivariate bicycle qLDPC codes and show that they are well suited for a parallel syndrome measurement scheme using fast routing with local operations and classical communication (LOCC). Through circuit-level simulations, we find that in some parameter regimes bivariate bicycle codes implemented with this protocol have logical error rates comparable to the surface code while using fewer physical qubits.

Related papers

• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Efficient fault-tolerant code switching via one-way transversal CNOT gates [0.0]
  We present a code scheme that respects the constraints of FT circuit design by only making use of switching gates. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors. We discuss how the scheme can be implemented with a large degree of parallelization, provided that logical auxiliary qubits can be prepared reliably enough.
  arXiv  Detail & Related papers  (2024-09-20T12:54:47Z)
• Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
  We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes. We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance. Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43:25Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [44.99833362998488]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers. The square-lattice surface code has become the workhorse to address this challenge. In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• Constant Depth Code Deformations in the Parity Architecture [0.0]
  We present a protocol to encode and decode arbitrary quantum states in the parity architecture with constant circuit depth. We show that our method can reduce the depth of implementing the quantum Fourier transform by a factor of two when allowing measurements.
  arXiv  Detail & Related papers  (2023-03-15T13:15:26Z)
• 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)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Low-overhead fault-tolerant quantum computing using long-range connectivity [2.867517731896504]
  Scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check codes. We estimate order-of-magnitude improvements in the overheads for processing around one hundred logical qubits.
  arXiv  Detail & Related papers  (2021-10-20T21:49:48Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)

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.