Low-overhead fault-tolerant quantum computing using long-range
connectivity
- URL: http://arxiv.org/abs/2110.10794v2
- Date: Sun, 22 May 2022 19:19:18 GMT
- Title: Low-overhead fault-tolerant quantum computing using long-range
connectivity
- Authors: Lawrence Z. Cohen, Isaac H. Kim, Stephen D. Bartlett, Benjamin J.
Brown
- Abstract summary: 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.
- Score: 2.867517731896504
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Vast numbers of qubits will be needed for large-scale quantum computing due
to the overheads associated with error correction. We present a scheme for
low-overhead fault-tolerant quantum computation based on quantum low-density
parity-check (LDPC) codes, where long-range interactions enable many logical
qubits to be encoded with a modest number of physical qubits. In our approach,
logic gates operate via logical Pauli measurements that preserve both the
protection of the LDPC codes as well as the low overheads in terms of the
required number of additional qubits. Compared with surface codes with the same
code distance, we estimate order-of-magnitude improvements in the overheads for
processing around one hundred logical qubits using this approach. Given the
high thresholds demonstrated by LDPC codes, our estimates suggest that
fault-tolerant quantum computation at this scale may be achievable with a few
thousand physical qubits at comparable error rates to what is needed for
current approaches.
Related papers
- Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes [2.048226951354646]
A major challenge in fault-tolerant quantum computation is to reduce both space overhead and time overhead.
We show that a protocol using non-vanishing-rate quantum low-density parity-check codes achieves constant space overhead and polylogarithmic time overhead.
arXiv Detail & Related papers (2024-11-06T06:06:36Z) - 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) - 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) - Low-density parity-check representation of fault-tolerant quantum circuits [5.064729356056529]
In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction.
This paper presents a toolkit for designing and analysing fault-tolerant quantum circuits.
arXiv Detail & Related papers (2024-03-15T12:56:38Z) - 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) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00: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) - 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) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11: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.