Computing Efficiently in QLDPC Codes

• URL: http://arxiv.org/abs/2502.07150v1
• Date: Tue, 11 Feb 2025 00:27:55 GMT
• Title: Computing Efficiently in QLDPC Codes
• Authors: Alexander J. Malcolm, Andrew N. Glaudell, Patricio Fuentes, Daryus Chandra, Alexis Schotte, Colby DeLisle, Rafael Haenel, Amir Ebrahimi, Joschka Roffe, Armanda O. Quintavalle, Stefanie J. Beale, Nicholas R. Lee-Hone, Stephanie Simmons,
• Abstract summary: We introduce a new family of QLDPC codes that enable efficient compilation of the Clifford group via operations. We run circuit-level simulations of depth-126 logical circuits to show that logical operations in our QLDPC codes attains near-memory performance.
• Score: 30.651249760099272
• License:
• Abstract: It is the prevailing belief that quantum error correcting techniques will be required to build a utility-scale quantum computer able to perform computations that are out of reach of classical computers. The QECCs that have been most extensively studied and therefore highly optimized, surface codes, are extremely resource intensive in terms of the number of physical qubits needed. A promising alternative, QLDPC codes, has been proposed more recently. These codes are much less resource intensive, requiring up to 10x fewer physical qubits per logical qubit than practical surface code implementations. A successful application of QLDPC codes would therefore drastically reduce the timeline to reaching quantum computers that can run algorithms with proven exponential speedups like Shor's algorithm and QPE. However to date QLDPC codes have been predominantly studied in the context of quantum memories; there has been no known method for implementing arbitrary logical Clifford operators in a QLDPC code proven efficient in terms of circuit depth. In combination with known methods for implementing T gates, an efficient implementation of the Clifford group unlocks resource-efficient universal quantum computation. In this paper, we introduce a new family of QLDPC codes that enable efficient compilation of the full Clifford group via transversal operations. Our construction executes any m-qubit Clifford operation in at most O(m) syndrome extraction rounds, significantly surpassing state-of-the-art lattice surgery methods. We run circuit-level simulations of depth-126 logical circuits to show that logical operations in our QLDPC codes attains near-memory performance. These results demonstrate that QLDPC codes are a viable means to reduce, by up to 10x, the resources required to implement all logical quantum algorithms, thereby unlocking a much reduced timeline to commercially valuable quantum computing.

Related papers

• Time-efficient logical operations on quantum LDPC codes [5.881311286656519]
  We propose schemes capable of measuring an arbitrary set of commutative logical Pauli operators in time independent of the number of operators. The only condition is commutativity, a fundamental requirement for simultaneous measurements in quantum mechanics.
  arXiv  Detail & Related papers  (2024-08-02T15:35:05Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• 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)
• 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)
• 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)
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding [5.5165579223151795]
  We use QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of $3$-qubit GHZ states to construct a scalable GHZ purification protocol.
  arXiv  Detail & Related papers  (2022-10-25T16:42:32Z)
• Software Tools for Decoding Quantum Low-Density Parity Check Codes [3.610459670994051]
  We propose a set of software tools that allows to numerically experiment with so-called Quantum Low-Density Parity Check codes (QLDPC codes) On top of that, we propose an efficient decoder that tackles the bottlenecks of the general QLDPC decoder. These tools eventually allow to confirm theoretical results around QLDPC codes in a more practical setting.
  arXiv  Detail & Related papers  (2022-09-02T17:22:01Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.