Fault-tolerant quantum computation with constant overhead for general noise

• URL: http://arxiv.org/abs/2512.02760v1
• Date: Tue, 02 Dec 2025 13:41:25 GMT
• Title: Fault-tolerant quantum computation with constant overhead for general noise
• Authors: Matthias Christandl, Omar Fawzi, Ashutosh Goswami,
• Abstract summary: We show that fault-tolerant quantum computation can be achieved with constant qubit overhead under general noise models.<n>We develop a fault-tolerant error correction scheme and a method for implementing logic gates under general circuit noise.
• Score: 8.49301882142233
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computation. While prior work by Gottesman showed that constant qubit overhead is achievable under stochastic noise using quantum low-density parity-check (QLDPC) codes, it has remained an open question whether similar guarantees hold under more general, non-stochastic noise models. In this work, we address this question by considering a general circuit-level noise model defined via the diamond norm, which captures both stochastic and non-stochastic noise, including coherent and amplitude damping noise. We prove that constant qubit overhead fault-tolerant quantum computation is achievable in this general setting, using QLDPC codes with constant rate and linear minimum distance. To establish our result, we develop a fault-tolerant error correction scheme and a method for implementing logic gates under general circuit noise. These results extend the theoretical foundations of fault-tolerant quantum computation and offer new directions for fault-tolerant architectures under realistic noise models.

Related papers

• Orders of magnitude runtime reduction in quantum error mitigation [0.0]
  We introduce a mitigation framework that combines virtual noise scaling with a layered mitigation architecture.<n>The proposed approach is compatible with dynamic circuits and can be seamlessly integrated with error detection and quantum error correction schemes.
  arXiv  Detail & Related papers  (2026-01-30T10:07:31Z)
• A Posteriori Certification Framework for Generalized Quantum Arimoto-Blahut Algorithms [41.15017547767954]
  We introduce an a posteriori certification viewpoint for the generalized quantum Arimoto-Blahut (QAB) algorithm.<n>We prove a global convergence theorem showing that, under convexity and a substantially weaker numerically verifiable condition, the QAB iteration converges to the global minimizer.<n>As an application, we develop a certified iterative scheme for computing the quantum relative entropy of channels.
  arXiv  Detail & Related papers  (2026-01-14T09:10:41Z)
• Fault tolerance against amplitude-damping noise using Bacon-Shor codes [1.7522836112265399]
  We design a fault tolerance scheme based on the Bacon-Shor codes which can protect against amplitude-damping noise in the device.<n>Our work thus establishes the possibility of achieving fault tolerance against amplitude-damping noise using noise-adapted quantum codes.
  arXiv  Detail & Related papers  (2025-03-28T02:59:30Z)
• Tensor-network decoders for process tensor descriptions of non-Markovian noise [0.0]
  Quantum error correction (QEC) is essential for fault-tolerant computation.<n>Here, we examine the performance of two paradigmatic QEC codes.
  arXiv  Detail & Related papers  (2024-12-18T11:17:09Z)
• Quantum Benchmarking of High-Fidelity Noise-Biased Operations on a Detuned-Kerr-Cat Qubit [1.4812736095876513]
  We develop a quantum control toolbox for a scalable noise-biased qubit, detuned Kerr-cat qubit.<n>We systematically characterize the noise structure of these operations using gate set tomography and dihedral randomized benchmarking.<n>Our results reveal a critical overestimation of operational noise bias inferred from bit-flip and phase-flip times alone.
  arXiv  Detail & Related papers  (2024-11-07T05:34:18Z)
• Compressed-sensing Lindbladian quantum tomography with trapped ions [44.99833362998488]
  Characterizing the dynamics of quantum systems is a central task for the development of quantum information processors. We propose two different improvements of Lindbladian quantum tomography (LQT) that alleviate previous shortcomings.
  arXiv  Detail & Related papers  (2024-03-12T09:58:37Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Accurate and Honest Approximation of Correlated Qubit Noise [39.58317527488534]
  We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree.<n>We find that, for realistic noise strength typical for fixed-frequency superconducting qubits, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy.
  arXiv  Detail & Related papers  (2023-11-15T19:00:34Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• Achieving fault tolerance against amplitude-damping noise [1.7289359743609742]
  We develop a protocol for fault-tolerant encoded quantum computing components in the presence of amplitude-damping noise. We describe a universal set of fault-tolerant encoded gadgets and compute the pseudothreshold for the noise. Our work demonstrates the possibility of applying the ideas of quantum fault tolerance to targeted noise models.
  arXiv  Detail & Related papers  (2021-07-12T14:59:54Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis [0.0]
  We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models. We apply our methods to ansatz circuits that appear in the Variational Quantum Eigensolver.
  arXiv  Detail & Related papers  (2020-08-27T16:46:12Z)

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.