Noise Limits on Fault-Tolerant Fermionic Quantum Computing

• URL: http://arxiv.org/abs/2609.09467v1
• Date: Tue, 08 Sep 2026 21:33:46 GMT
• Title: Noise Limits on Fault-Tolerant Fermionic Quantum Computing
• Abstract summary: Previous work has constrained this upper limit for local depolarizing noise to $approx 45%$ for circuits constructed using the universal Clifford with T gate set.<n>In this work, we use a similar method with the matchgate with non-Gaussian resource universal gate set to find a limit of $p=(8 - 2 sqrt6)/5$ or $approx 62%$ for fermionic quantum computing.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Determining the highest amount of noise that quantum circuits can handle is an interesting and crucial task in the development of fault-tolerant quantum computation. Previous work has constrained this upper limit for local depolarizing noise to $\approx 45~\%$ for circuits constructed using the universal Clifford with T gate set by finding the noise threshold where the gate set loses universality. In this work, we use a similar method with the matchgate with non-Gaussian resource universal gate set to find a limit of $p=(8 - 2 \sqrt{6})/5$ or $\approx 62~\%$ for fermionic quantum computing that is independent of circuit depth. To do this, we use Uhlmann-Wootters concurrences for a 4-mode fermionic Choi state representing a resourceful gate combined with local depolarizing noise to determine when the combined channel is convex Gaussian. These bounds are not directly comparable due to differences in noise model making the bound of $\approx 62~\%$ the best known for fermions.

Related papers

• Limitations of Noisy Geometrically Local Quantum Circuits [0.2039123720459736]
  We show that noisy quantum circuits with interspersed noise converge to the uniform distribution at $omega(log n)$ depth, where $n$ is the number of qubits.<n>We conjecture that our bound is still loose and that a $Theta(1)$-depth threshold suffices for simulability due to a percolation effect.
  arXiv  Detail & Related papers  (2025-10-07T18:08:23Z)
• Fault-tolerant fermionic quantum computing [39.58317527488534]
  We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether.<n>We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Theory of quantum error mitigation for non-Clifford gates [0.0]
  Quantum error mitigation techniques mimic noiseless quantum circuits by running several related noisy circuits.<n>How well such techniques work is thought to depend strongly on how noisy the underlying gates are.<n>This paper generalizes these techniques to non-Clifford gates.
  arXiv  Detail & Related papers  (2024-03-27T17:36:35Z)
• 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)
• Folding-Free ZNE: A Comprehensive Quantum Zero-Noise Extrapolation Approach for Mitigating Depolarizing and Decoherence Noise [13.362818196498257]
  A range of quantum error mitigation techniques has been proposed to address noise in quantum computers. ZNE involves increasing the noise levels in a circuit and then using extrapolation to infer the zero noise case from the noisy results. This paper presents a novel ZNE approach that does not require circuit folding or noise scaling to mitigate depolarizing and/or decoherence noise.
  arXiv  Detail & Related papers  (2023-05-01T01:54:26Z)
• Navigating the noise-depth tradeoff in adiabatic quantum circuits [0.0]
  On an ideal quantum computer, the solution quality improves monotonically with increasing circuit depth. By contrast, increasing the depth in current noisy computers introduces more noise and deteriorates any computational advantage. We implement this algorithm on a noisy superconducting quantum processor and find that the dependence of the density of defects on the circuit depth follows the predicted non-monotonous behavior.
  arXiv  Detail & Related papers  (2022-09-22T18:00:03Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Error mitigation with Clifford quantum-circuit data [0.8258451067861933]
  We propose a novel, scalable error-mitigation method that applies to gate-based quantum computers. The method generates training data $X_itextnoisy,X_itextexact$ via quantum circuits composed largely of Clifford gates. We analyze the performance of our method versus the number of qubits, circuit depth, and number of non-Clifford gates.
  arXiv  Detail & Related papers  (2020-05-20T16:53:43Z)

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.