Quantum Error Correction near the Coding Theoretical Bound

• URL: http://arxiv.org/abs/2412.21171v2
• Date: Thu, 23 Jan 2025 17:49:13 GMT
• Title: Quantum Error Correction near the Coding Theoretical Bound
• Authors: Daiki Komoto, Kenta Kasai,
• Abstract summary: We present quantum error-correcting codes constructed from classical LDPC codes. These codes approach the hashing bound while maintaining linear computational complexity in the number of physical qubits. This result establishes a pathway toward realizing large-scale, fault-tolerant quantum computers.
• Score: 0.0
• License:
• Abstract: Recent advancements in quantum computing have led to the realization of systems comprising tens of reliable logical qubits, constructed from thousands of noisy physical qubits. However, many of the critical applications that quantum computers aim to solve require quantum computations involving millions or more logical qubits. This necessitates highly efficient quantum error correction capable of handling large numbers of logical qubits. Classical error correction theory is well-developed, with low-density parity-check (LDPC) codes achieving performance limits by encoding large classical bits. Despite more than two decades of effort, no efficiently decodable quantum error-correcting code that approaches the hashing bound, which is a fundamental lower bound on quantum capacity, had been discovered. Here, we present quantum error-correcting codes constructed from classical LDPC codes that approach the hashing bound while maintaining linear computational complexity in the number of physical qubits. This result establishes a pathway toward realizing large-scale, fault-tolerant quantum computers. By integrating our quantum error correction scheme with devices capable of managing vast numbers of qubits, the prospect of solving critical real-world problems through quantum computation is brought significantly closer.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Transversal CNOT gate with multi-cycle error correction [1.7359033750147501]
  A scalable and programmable quantum computer holds the potential to solve computationally intensive tasks that computers cannot accomplish within a reasonable time frame, achieving quantum advantage. The vulnerability of the current generation of quantum processors to errors poses a significant challenge towards executing complex and deep quantum circuits required for practical problems. Our work establishes the feasibility of employing logical CNOT gates alongside error detection on a superconductor-based processor using current generation quantum hardware.
  arXiv  Detail & Related papers  (2024-06-18T04:50:15Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• QuBEC: Boosting Equivalence Checking for Quantum Circuits with QEC Embedding [4.15692939468851]
  We propose a Decision Diagram-based quantum equivalence checking approach, QuBEC, that requires less latency compared to existing techniques. Our proposed methodology reduces verification time on certain benchmark circuits by up to $271.49 times$.
  arXiv  Detail & Related papers  (2023-09-19T16:12:37Z)
• 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)
• Error Correction for Reliable Quantum Computing [0.0]
  We study a phenomenon exclusive to the quantum paradigm, known as degeneracy, and its effects on the performance of sparse quantum codes. We present methods to improve the performance of a specific family of sparse quantum codes in various different scenarios.
  arXiv  Detail & Related papers  (2022-02-17T11:26:52Z)
• Quantum Error Correction with Quantum Autoencoders [0.0]
  We show how quantum neural networks can be trained to learn optimal strategies for active detection and correction of errors. We highlight that the denoising capabilities of quantum autoencoders are not limited to the protection of specific states but extend to the entire logical codespace.
  arXiv  Detail & Related papers  (2022-02-01T16:55:14Z)
• Mitigating Quantum Errors via Truncated Neumann Series [10.04862322536857]
  We propose a unified framework that can mitigate quantum gate and measurement errors in computing quantum expectation values. The essential idea is to cancel the effect of quantum error by approximating its inverse via linearly combining quantum errors of different orders. We test this framework for different quantum errors and find that the computation accuracy is substantially improved.
  arXiv  Detail & Related papers  (2021-11-01T04:16:49Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

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.