pith. sign in

arxiv: 2510.19928 · v3 · pith:CBPHLAHTnew · submitted 2025-10-22 · 🪐 quant-ph · cond-mat.other

Mind the gaps: The fraught road to quantum advantage

Jens Eisert , John Preskill This is my paper

Pith reviewed 2026-05-22 13:05 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.other
keywords quantum computingNISQfault toleranceerror correctionquantum advantagequantum simulationfault-tolerant quantum computing
0
0 comments X

The pith

Substantial gaps separate today's noisy quantum devices from tomorrow's reliable machines, and four specific transitions must be crossed to reach practical quantum computing.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper argues that quantum hardware is improving but remains limited by noise and scale, preventing it from solving problems beyond classical computers. It identifies four hurdles: shifting from error mitigation to active detection and correction, scaling rudimentary correction into full fault tolerance, replacing early heuristics with verifiable algorithms, and turning exploratory simulations into ones with clear advantage. A sympathetic reader would care because these steps determine whether quantum computers can deliver on their promise of useful applications in chemistry, materials, or optimization rather than remaining experimental tools.

Core claim

Quantum computing is advancing rapidly, yet substantial gaps separate today's noisy intermediate-scale quantum (NISQ) devices from tomorrow's fault-tolerant application-scale quantum (FASQ) machines. We identify four related hurdles along the road ahead: (i) from error mitigation to active error detection and correction, (ii) from rudimentary error correction to scalable fault tolerance, (iii) from early heuristics to mature, verifiable algorithms, and (iv) from exploratory simulators to credible advantage in quantum simulation. Targeting these transitions will accelerate progress toward broadly useful quantum computing.

What carries the argument

The four related hurdles that must be crossed from NISQ to FASQ devices: error mitigation to active detection/correction, rudimentary correction to scalable fault tolerance, heuristics to verifiable algorithms, and exploratory simulation to credible quantum advantage.

If this is right

  • Active error detection and correction will support reliable operation of larger quantum circuits than mitigation alone allows.
  • Scalable fault tolerance will permit quantum systems to grow without errors overwhelming the computation.
  • Verifiable algorithms will give trustworthy results from quantum processors instead of relying on unproven heuristics.
  • Credible quantum simulation will produce results for physical systems that classical computers cannot match efficiently.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Hardware improvements such as better qubit connectivity or reduced cryogenic overhead could interact with these hurdles in ways the paper does not detail.
  • Success on the simulation front might first appear in specific domains like quantum chemistry rather than general computing.
  • The ordering of the four transitions may matter, with progress on error handling likely needed before verifiable algorithms can be tested at scale.

Load-bearing premise

The four listed transitions are the primary barriers, and resolving them will be enough to produce broadly useful quantum computing rather than other unlisted technical or engineering obstacles.

What would settle it

A demonstration of credible quantum advantage on an existing NISQ device that relies only on error mitigation without active correction or scalable fault tolerance would show that the gaps can be bypassed.

read the original abstract

Quantum computing is advancing rapidly, yet substantial gaps separate today's noisy intermediate-scale quantum (NISQ) devices from tomorrow's fault-tolerant application-scale quantum (FASQ) machines. We identify four related hurdles along the road ahead: (i) from error mitigation to active error detection and correction, (ii) from rudimentary error correction to scalable fault tolerance, (iii) from early heuristics to mature, verifiable algorithms, and (iv) from exploratory simulators to credible advantage in quantum simulation. Targeting these transitions will accelerate progress toward broadly useful quantum computing.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript is a perspective article arguing that substantial gaps separate today's noisy intermediate-scale quantum (NISQ) devices from tomorrow's fault-tolerant application-scale quantum (FASQ) machines. It identifies four related hurdles: (i) from error mitigation to active error detection and correction, (ii) from rudimentary error correction to scalable fault tolerance, (iii) from early heuristics to mature verifiable algorithms, and (iv) from exploratory simulators to credible advantage in quantum simulation. The authors claim that targeting these transitions will accelerate progress toward broadly useful quantum computing.

Significance. This forward-looking perspective synthesizes current challenges in quantum computing and offers a structured framework of four transitions to guide research priorities. By highlighting the shift from mitigation and heuristics toward verifiable, scalable, and credible approaches, it provides timely expert judgment that could help focus community efforts. The absence of new derivations or data is appropriate for a perspective piece; its value lies in the clear delineation of these hurdles based on the state of the field.

minor comments (2)
  1. The abstract introduces 'FASQ' without a brief parenthetical expansion or reference; adding this would improve immediate accessibility for readers.
  2. A short concluding paragraph or table summarizing the four hurdles, their current status, and suggested next steps would enhance the actionability of the recommendations.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of our perspective article and for recommending minor revision. We appreciate the recognition that the four transitions provide a timely framework for focusing community efforts toward useful quantum advantage, and that the absence of new data or derivations is appropriate for this format.

Circularity Check

0 steps flagged

No significant circularity: perspective piece without derivations

full rationale

The manuscript is a forward-looking perspective article identifying four transitions between NISQ and FASQ regimes. It contains no mathematical derivations, equations, fitted parameters, predictions, or self-referential definitions that could reduce to their own inputs by construction. The central claims rest on expert assessment of technical hurdles rather than any load-bearing self-citation chain, uniqueness theorem, or ansatz smuggled via prior work. No step in the argument exhibits the enumerated circularity patterns, making the derivation chain self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a perspective article that organizes existing knowledge about quantum computing challenges. It introduces no free parameters, mathematical axioms, or new postulated entities. The discussion rests on standard concepts from quantum error correction and quantum simulation already established in the field.

pith-pipeline@v0.9.0 · 5606 in / 1086 out tokens · 32643 ms · 2026-05-22T13:05:31.844981+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith.Foundation.RealityFromDistinction reality_from_one_distinction unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    We identify four related hurdles along the road ahead: (i) from error mitigation to active error detection and correction, (ii) from rudimentary error correction to scalable fault tolerance, (iii) from early heuristics to mature, verifiable algorithms, and (iv) from exploratory simulators to credible advantage in quantum simulation.

  • IndisputableMonolith.Cost.FunctionalEquation washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    Quantum error mitigation boosts substantially the circuit volume that can be executed accurately. However, due to a sampling overhead cost that scales exponentially with circuit volume, this method fails for very large circuits.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 19 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Local tensor-train surrogates for quantum learning models

    quant-ph 2026-04 unverdicted novelty 7.0

    Local tensor-train surrogates approximate quantum machine learning models via Taylor polynomials and tensor networks, delivering polynomial parameter scaling and explicit generalization bounds controlled by patch radius.

  2. Approximate Sparse State Preparation with the Grover-Rudolph Algorithm

    quant-ph 2026-04 unverdicted novelty 7.0

    Two enhancements to the Grover-Rudolph algorithm reduce CNOT gates and control qubits for sparse quantum state preparation, including an approximate variant with a classically computable overlap estimate.

  3. Efficient simulation of noisy IQP circuits with amplitude-damping noise

    quant-ph 2026-04 unverdicted novelty 7.0

    A classical polynomial-time sampler exists for the output distribution of amplitude-damped IQP circuits with logarithmic depth and arbitrary l-local diagonal gates.

  4. $\sigma$-VQE: Excited-state preparation of quantum many-body scars with shallow circuits

    quant-ph 2026-02 unverdicted novelty 7.0

    σ-VQE uses low-depth circuits and an energy-selective cost function to preferentially prepare quantum many-body scar states on NISQ devices.

  5. Quantum Vault: Secure Token Authentication Without Classical State Information Benchmarked on IBMQ

    quant-ph 2026-05 unverdicted novelty 6.0

    Quantum vault stores token copies at the bank to enable secure authentication without classical side information, achieving false-negative errors below 10^{-4} and attack success below 10^{-18} for 200-token bills on ...

  6. Sample-Based Quantum Diagonalization with Amplitude Amplification

    quant-ph 2026-05 conditional novelty 6.0

    SQD-AA reduces total query complexity by more than 100x on model distributions and achieves the lowest T-gate counts with 3-4 orders shallower circuits than iQPE for molecular examples.

  7. Rethinking How to Act: Action-Space Engineering for Reinforcement Learning-Based Circuit Routing in Distributed Quantum Systems

    quant-ph 2026-05 unverdicted novelty 6.0

    An RL agent with engineered action spaces for distributed quantum circuit routing achieves up to 35% reduction in modeled execution time compared to previous methods.

  8. From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data

    quant-ph 2026-05 unverdicted novelty 6.0

    A generative QMLC framework tokenizes GST data, embeds it via curriculum-trained set-vision transformers into a context-aware latent space, and uses diffusion models to synthesize circuits conditioned on desired measu...

  9. A graph-aware bounded distance decoder for all stabilizer codes

    quant-ph 2026-04 unverdicted novelty 6.0

    A graph-based bounded distance decoder corrects all errors up to a chosen weight in arbitrary stabilizer codes by representing stabilizers and syndromes as graphs and pruning the search space with a feed-forward structure.

  10. An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics

    quant-ph 2026-04 unverdicted novelty 6.0

    An oracle-free Trotter-based quantum algorithm for nonadiabatic molecular dynamics achieves circuit depth advantages over QROM architectures and retains T-gate scalability compared to quantum signal processing.

  11. Bridge the Gap between Classical and Quantum Neural Networks with Residual Connections

    quant-ph 2026-04 unverdicted novelty 6.0

    HQRN creates an exact functional match to classical residual networks on basis inputs while using quantum correlations for better performance on mixed states in digit recognition and entanglement classification.

  12. AlphaCNOT: Learning CNOT Minimization with Model-Based Planning

    cs.AI 2026-04 unverdicted novelty 6.0

    AlphaCNOT combines reinforcement learning with Monte Carlo Tree Search planning to reduce CNOT gate counts by up to 32% versus heuristics in quantum circuit synthesis.

  13. Detecting entanglement from few partial transpose moments and their decay via weight enumerators

    quant-ph 2026-04 unverdicted novelty 6.0

    Entanglement is certified if any three PT moments satisfy p_l > p_k^x p_m^{1-x} with x=(m-l)/(m-k), and quantum weight enumerators describe moment decay under local noise.

  14. Loss-aware state space geometry for quantum variational algorithms

    quant-ph 2026-04 unverdicted novelty 6.0

    Loss-aware natural gradient variants are introduced by embedding the loss hypersurface in a statistical manifold or using quantum state overlaps, yielding conformal updates that adjust effective step size.

  15. A unified quantum computing quantum Monte Carlo framework through structured state preparation

    quant-ph 2026-03 unverdicted novelty 6.0

    Structured state preparation in QCQMC improves energy accuracy over pure variational methods across molecular, condensed-matter, nuclear, and graph problems.

  16. Correlated Atom Loss as a Resource for Quantum Error Correction

    quant-ph 2026-03 unverdicted novelty 6.0

    A new decoder exploiting correlated atom loss in surface codes raises the loss threshold from 3.2% to 4% and cuts logical errors by up to 10x for neutral-atom processors.

  17. Software Between Quantum and Machine Learning -- And Down to Pulses

    quant-ph 2026-05 unverdicted novelty 5.0

    A JAX-based framework extending quantum machine learning to pulse-level control with composable ansatzes, end-to-end optimization, and Fourier diagnostics.

  18. Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management

    quant-ph 2026-04 unverdicted novelty 5.0

    The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.

  19. Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor

    quant-ph 2026-05 unverdicted novelty 4.0

    Logical quantum kernels outperform physical ones when solving differential equations on a neutral-atom processor, with gains traced to noise error detection in the logical encoding.

Reference graph

Works this paper leans on

217 extracted references · 217 canonical work pages · cited by 19 Pith papers · 12 internal anchors

  1. [1]

    strongly correlated

    proposed that a machine that computes quantum properties of many strongly interacting particles should be a quantum machine rather than a conventional computer. Dirac’s claim that many-electron problems are too hard to solve (classically) is in some respects misleading. Heuristic classical algorithms for this problem, such as density functional theory [17...

    work page 2011

  2. [2]

    R. P. Feynman, Simulating physics with computers, Int. J. Th. Phys.21, 467 (1982)

    work page 1982

  3. [3]

    R. P. Feynman, Quantum mechanical computers, Found. Phys. 16, 507 (1986)

    work page 1986

  4. [4]

    Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc

    D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. A400, 97 (1985)

    work page 1985

  5. [5]

    P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proc. 50th Ann. Symp. Found. Comp. Sc. , 124 (1994)

    work page 1994

  6. [6]

    Preskill, Quantum computing in the NISQ era and beyond, Quantum2, 79 (2018)

    J. Preskill, Quantum computing in the NISQ era and beyond, Quantum2, 79 (2018)

    work page 2018

  7. [7]

    Morvan, B

    A. Morvan, B. Villalonga, X. Mi, S. Mandrà, A. Bengtsson, P. Klimov, Z. Chen, S. Hong, C. Erickson, I. Drozdov,et al., Phase transitions in random circuit sampling, Nature634, 328 (2024)

    work page 2024

  8. [8]

    P. W. Shor, Scheme for reducing decoherence in quantum com- puter memory, Phys. Rev. A52, R2493 (1995)

    work page 1995

  9. [9]

    P. W. Shor, Fault-tolerant quantum computation, inProceedings of 37th conference on foundations of computer science(IEEE,

    work page

  10. [10]

    J. Lee, D. W. Berry, C. Gidney, W. J. Huggins, J. R. McClean, N. Wiebe, and R. Babbush, Even more efficient quantum com- putations of chemistry through tensor hypercontraction, PRX Quantum2, 030305 (2021)

    work page 2021

  11. [11]

    How to factor 2048 bit RSA integers with less than a million noisy qubits

    C. Gidney, How to factor 2048 bit RSA integers with less than a million noisy qubits, (2025), arXiv:2505.15917

    work page internal anchor Pith review Pith/arXiv arXiv 2048

  12. [12]

    Bacon, Software of QIP, by QIP, and for QIP (2022), keynote presentation at QIP 2022

    D. Bacon, Software of QIP, by QIP, and for QIP (2022), keynote presentation at QIP 2022

    work page 2022

  13. [13]

    Preskill, Beyond NISQ: The megaquop machine, ACM Trans

    J. Preskill, Beyond NISQ: The megaquop machine, ACM Trans. Quant. Comp.6, 1 (2025)

    work page 2025

  14. [15]

    King, Quantum algorithms: A call to action (2025)

    R. King, Quantum algorithms: A call to action (2025)

    work page 2025

  15. [16]

    Aaronson, A

    S. Aaronson, A. M. Childs, E. Farhi, A. W. Harrow, and B. C. Sanders, Future of quantum computing, (2025), arXiv:2506.19232

    work page arXiv 2025

  16. [17]

    Lanes, M

    O. Lanes, M. Beji, A. D. Corcoles, C. Dalyac, J. M. Gam- betta, L. Henriet, A. Javadi-Abhari, A. Kandala, A. Mezzacapo, C. Porter,et al., A framework for quantum advantage, (2025), arXiv:2506.20658

    work page arXiv 2025

  17. [18]

    Huang, S

    H.-Y . Huang, S. Choi, J. R. McClean, and J. Preskill, The vast world of quantum advantage, (2025), arXiv:2508.05720

    work page arXiv 2025

  18. [19]

    Kapit, P

    E. Kapit, P. Love, J. Larson, A. Sornborger, E. Crane, A. Schuckert, T. Tomesh, F. Chong, and S. Kais, Roadblocks and opportunities in quantum algorithms – insights from the National Quantum Initiative Joint Algorithms Workshop, May 20-22, 2024, (2025), arXiv:2508.13973

    work page arXiv 2024

  19. [20]

    A. M. Dalzell, S. McArdle, M. Berta, P. Bienias, C.-F. Chen, A. Gilyén, C. T. Hann, M. J. Kastoryano, E. T. Khabiboulline, A. Kubica,et al., Quantum algorithms: A survey of applications and end-to-end complexities, (2023), arXiv:2310.03011

    work page arXiv 2023

  20. [21]

    Haeffner, C

    H. Haeffner, C. F. Roos, and R. Blatt, Quantum computing with trapped ions, Phys. Rep.469, 155 (2008)

    work page 2008

  21. [22]

    J.-S. Chen, E. Nielsen, M. Ebert, V . Inlek, K. Wright, V . Chap- lin, A. Maksymov, E. Páez, A. Poudel, P. Maunz, and J. Gamble, Benchmarking a trapped-ion quantum computer with 30 qubits, Quantum8, 1516 (2024)

    work page 2024

  22. [23]

    DeCrosset al., Computational power of random quan- tum circuits in arbitrary geometries, Phys

    M. DeCrosset al., Computational power of random quan- tum circuits in arbitrary geometries, Phys. Rev. X15, 021052 (2025)

    work page 2025

  23. [24]

    Acharya, L

    R. Acharyaet al., Quantum error correction below the surface code threshold, (2024), arxiv:2408.13687

    work page arXiv 2024

  24. [25]

    Castelvecchi, IBM releases first-ever 1,000-qubit quantum chip, Nature624, 238 (2023)

    D. Castelvecchi, IBM releases first-ever 1,000-qubit quantum chip, Nature624, 238 (2023)

    work page 2023

  25. [26]

    Bravyi, O

    S. Bravyi, O. Dial, J. M. Gambetta, D. Gil, and Z. Nazario, The future of quantum computing with superconducting qubits, J. Applied Phys.132, 160902 (2022)

    work page 2022

  26. [27]

    Bernien, S

    H. Bernien, S. Schwartz, A. Keesling, H. Levine, A. Omran, H. Pichler, S. Choi, A. S. Zibrov, M. Endres, M. Greiner, V . Vuletic, and M. Lukin, Probing many-body dynamics on a 51-atom quantum simulator, Nature551, 579 (2017)

    work page 2017

  27. [28]

    Bluvstein, S

    D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. S. Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V . Vuletic, and M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature626, 58 (2024)

    work page 2024

  28. [29]

    Saffman, T

    M. Saffman, T. G. Walker, and K. Mølmer, Quantum informa- tion with Rydberg atoms, Rev. Mod. Phys.82, 2313 (2010)

    work page 2010

  29. [30]

    S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V . Vuleti´c, and M. D. Lukin, High-fidelity parallel entangling gates on a neutral-atom quantum computer, Nature622, 268 (2023)

    work page 2023

  30. [31]

    High-fidelity collisional quantum gates with fermionic atoms

    P. Bojovi´c, T. Hilker, S. Wang, J. Obermeyer, M. Barendregt, D. Tell, T. Chalopin, P. M. Preiss, I. Bloch, and T. Franz, High- fidelity collisional quantum gates with fermionic atoms, (2025), arXiv:2506.14711

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  31. [32]

    M. Liu, R. Shaydulin, P. Niroula, M. DeCross, S.-H. Hung, W. Y . Kon, E. Cervero-Martín, K. Chakraborty, O. Amer, S. Aaronson,et al., Certified randomness using a trapped-ion quantum processor, Nature618, 500 (2025)

    work page 2025

  32. [33]

    Y . Kim, A. Eddins, S. Anand, K. X. Wei, E. Van Den Berg, S. Rosenblatt, H. Nayfeh, Y . Wu, M. Zaletel, K. Temme,et al., Evidence for the utility of quantum computing before fault tolerance, Nature618, 500 (2023)

    work page 2023

  33. [34]

    D. A. Abanin, R. Acharya, L. Aghababaie-Beni, G. Aigeldinger, A. Ajoy, R. Alcaraz, I. Aleiner, T. I. Andersen, M. Ansmann, F. Arute,et al., Constructive interference at the edge of quantum ergodic dynamics, (2025), arXiv:2506.10191

    work page arXiv 2025

  34. [35]

    Knill, Leibfried, R

    E. Knill, Leibfried, R. Reichle, J. Britton, R. B. Blakestad, J., Jost, C. Langer, R. Ozeri, S. Seidelin, and J. Wineland, Randomized benchmarking of quantum gates, Phys. Rev. A77, 012307 (2008)

    work page 2008

  35. [36]

    Eisert, D

    J. Eisert, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, and E. Kashefi, Quantum certifica- tion and benchmarking, Nature Rev. Phys.2, 382 (2020)

    work page 2020

  36. [37]

    Hashim, L

    A. Hashim, L. B. Nguyen, N. Goss, B. Marinelli, R. K. Naik, T. Chistolini, J. Hines, J. Marceaux, Y . Kim, P. Gokhale, T. Tomesh, S. Chen, L. Jiang, S. Ferracin, K. Rudinger, T. Proc- tor, K. C. Young, I. Siddiqi, and R. Blume-Kohout, Practical introduction to benchmarking and characterization of quantum computers, PRX Quantum6, 030202 (2025)

    work page 2025

  37. [38]

    IQM, IQM quantum computers achieves new technology mile- stones with 99.9% 2-qubit gate fidelity and 1 millisecond co- herence time (2024)

    work page 2024

  38. [39]

    Google Quantum AI, Willow spec sheet (2024)

    work page 2024

  39. [40]

    T. M. Graham, Y . Song, J. Scott, C. Poole, L. Phuttitarn, K. Jooya, P. Eichler, X. Jiang, A. Marra, B. Grinkemeyer, M. Kwon, M. Ebert, J. Cherek, M. T. Lichtman, M. Gillette, J. Gilbert, D. Bowman, T. Ballance, C. Campbell, E. D. Dahl, O. Crawford, N. S. Blunt, B. Rogers, T. Noel, and M. Saffman, Multi-qubit entanglement and algorithms on a neutral-atom ...

    work page 2022

  40. [41]

    D. A. Rower, L. Ding, H. Zhang, M. Hays, J. An, P. M. Harring- ton, I. T. Rosen, J. M. Gertler, T. M. Hazard, B. M. Niedzielski, M. E. Schwartz, S. Gustavsson, K. Serniak, J. A. Grover, and W. D. Oliver, Suppressing counter-rotating errors for fast single- qubit gates with fluxonium, PRX Quantum5, 040342 (2024)

    work page 2024

  41. [42]

    Z. Li, P. Liu, P. Zhao, Z. Mi, H. Xu, X. Liang, T. Su, W. Sun, G. Xue, J.-N. Zhang, W. Liu, Y . Jin, and H. Yu, npj Quant. Inf. 9, 111 (2023)

    work page 2023

  42. [43]

    Bengtsson, A

    A. Bengtsson, A. Opremcak, M. Khezri, D. Sank, A. Bourassa, K. J. Satzinger, S. Hong, C. Erickson, B. J. Lester, K. C. Miao, A. N. Korotkov, J. Kelly, Z. Chen, and P. V . Klimov, Model- based optimization of superconducting qubit readout, Phys. Rev. Lett.132, 100603 (2024)

    work page 2024

  43. [44]

    Neven, Meet willow, our state-of-the-art quantum chip (2024)

    H. Neven, Meet willow, our state-of-the-art quantum chip (2024)

    work page 2024

  44. [45]

    D. Gao, D. Fan, C. Zha, J. Bei, G. Cai, J. Cai, S. Cao, F. Chen, J. Chen, K. Chen,et al., Establishing a new benchmark in quantum computational advantage with 105-qubit Zuchongzhi 3.0 processor, Phys. Rev. Lett.134, 090601 (2025)

    work page 2025

  45. [46]

    IBM Newsroom, IBM launches its most advanced quantum computers, fueling new scientific value and progress towards quantum advantage (2024)

    work page 2024

  46. [47]

    Y . Quek, D. S. França, S. Khatri, J. J. Meyer, and J. Eisert, Exponentially tighter bounds on limitations of quantum error, mitigation, Nature Phys.20, 1648 (2024)

    work page 2024

  47. [48]

    A polynomial-time classical algorithm for noisy quantum circuits.arXiv preprint arXiv:2407.12768, 2024

    T. Schuster, C. Yin, X. Gao, and N. Y . Yao, A polynomial- time classical algorithm for noisy quantum circuits, (2024), arXiv:2407.12768

    work page arXiv 2024

  48. [49]

    A. A. Mele, A. Angrisani, S. Ghosh, S. Khatri, J. Eisert, D. S. França, and Y . Quek, Noise-induced shallow circuits and ab- sence of barren plateaus, (2024), arXiv:2403.13927

    work page arXiv 2024

  49. [50]

    Deshpande, P

    A. Deshpande, P. Niroula, O. Shtanko, A. V . Gorshkov, B. Fef- ferman, and M. J. Gullans, Tight bounds on the convergence of noisy random circuits to the uniform distribution, PRX Quan- tum3, 040329 (2022). 13

    work page 2022

  50. [51]

    Stilck Franca and R

    D. Stilck Franca and R. García-Patrón, Limitations of optimiza- tion algorithms on noisy quantum devices, Nature Phys.17, 1221 (2020)

    work page 2020

  51. [52]

    Quantum Refrigerator

    M. Ben-Or, D. Gottesman, and A. Hassidim, Quantum refriger- ator, arXiv (2013), arXiv:1301.1995

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  52. [53]

    Simulating quantum circuits with arbitrary local noise using Pauli Propagation

    A. Angrisani, A. A. Mele, M. S. Rudolph, M. Cerezo, and Z. Holmes, Simulating quantum circuits with arbitrary local noise using Pauli propagation, (2025), arxiv:2501.13101

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  53. [54]

    Z. Cai, R. Babbush, S. C. Benjamin, S. Endo, W. J. Huggins, Y . Li, J. R. McClean, and T. E. O’Brien, Quantum error mitiga- tion, Rev. Mod. Phys.95, 045005 (2023)

    work page 2023

  54. [55]

    Giurgica-Tiron, Y

    T. Giurgica-Tiron, Y . Hindy, R. LaRose, A. Mari, and W. J. Zeng, Digital zero noise extrapolation for quantum error miti- gation, 2020 IEEE Int. Conf. Quant. Comp. Eng. (QCE) , 306 (2020)

    work page 2020

  55. [56]

    A. Mari, N. Shammah, and W. J. Zeng, Extending quantum probabilistic error cancellation by noise scaling, Phys. Rev. A 104, 052607 (2021)

    work page 2021

  56. [57]

    LaRose, A

    R. LaRose, A. Mari, S. Kaiser, P. J. Karalekas, A. A. Alves, P. Czarnik, M. E. Mandouh, M. H. Gordon, Y . Hindy, A. Robert- son, P. Thakre, M. Wahl, D. Samuel, R. Mistri, M. Tremblay, N. Gardner, N. T. Stemen, N. Shammah, and W. J. Zeng, Mi- tiq: A software package for error mitigation on noisy quantum computers, Quantum6, 774 (2022)

    work page 2022

  57. [58]

    J. R. McClean, Z. Jiang, N. C. Rubin, R. Babbush, and H. Neven, Decoding quantum errors with subspace expansions, Nature Comm.11, 636 (2020)

    work page 2020

  58. [59]

    F. B. Maciejewski, Z. Zimborás, and M. Oszmaniec, Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography, Quantum4, 257 (2020)

    work page 2020

  59. [60]

    Takagi, H

    R. Takagi, H. Tajima, and M. Gu, Universal sampling lower bounds for quantum error mitigation, Phys. Rev. Lett.131, 210602 (2023)

    work page 2023

  60. [61]

    Exponentially tighter bounds on limitations of quantum error mitiga- tion,

    R. Takagi, S. Endo, S. Minagawa, and M. Gu, Fundamental lim- its of quantum error mitigation, npj Quant. Inf.8, 114 (2022), arXiv:2210.11505

    work page arXiv 2022

  61. [62]

    Aharonov, O

    D. Aharonov, O. Alberton, I. Arad, Y . Atia, E. Bairey, Z. Brak- erski, I. Cohen, O. Golan, I. Gurwich, O. Kenneth,et al., On the importance of error mitigation for quantum computation, (2025), arXiv:2503.17243

    work page arXiv 2025

  62. [63]

    Reliable high-accuracy error mitigation for utility-scale quantum circuits

    D. Aharonov, O. Alberton, I. Arad, Y . Atia, E. Bairey, M. B. Dov, A. Berkovitch, Z. Brakerski, I. Cohen, E. Fuchs,et al., Re- liable high-accuracy error mitigation for utility-scale quantum circuits, (2025), arXiv:2508.10997

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  63. [64]

    Cotler, S

    J. Cotler, S. Choi, A. Lukin, H. Gharibyan, T. Grover, M. E. Tai, M. Rispoli, R. Schittko, P. M. Preiss, A. M. Kaufman,et al., Quantum virtual cooling, Phys. Rev. X9, 031013 (2019)

    work page 2019

  64. [65]

    Seif, Z.-P

    A. Seif, Z.-P. Cian, S. Zhou, S. Chen, and L. Jiang, Shadow distillation: Quantum error mitigation with classical shadows for near-term quantum processors, PRX Quantum4, 010303 (2023)

    work page 2023

  65. [66]

    W. J. Huggins, S. McArdle, T. E. O’Brien, J. Lee, N. C. Rubin, S. Boixo, K. B. Whaley, R. Babbush, and J. R. McClean, Vir- tual distillation for quantum error mitigation, Phys. Rev. X11, 041036 (2021)

    work page 2021

  66. [67]

    Koczor, Exponential error suppression for near-term quan- tum devices, Phys

    B. Koczor, Exponential error suppression for near-term quan- tum devices, Phys. Rev. X11, 031057 (2021)

    work page 2021

  67. [68]

    Onorati, J

    E. Onorati, J. Kitzinger, J. Helsen, M. Ioannou, A. H. Werner, I. Roth, and J. Eisert, Noise-mitigated randomized mea- surements and self-calibrating shadow estimation, (2024), arXiv:2403.04751

    work page arXiv 2024

  68. [69]

    Z. Liu, X. Zhang, Y .-Y . Fei, and Z. Cai, Virtual channel purifi- cation, (2024), arXiv:2402.07866

    work page arXiv 2024

  69. [70]

    M. A. Wahl, A. Mari, N. Shammah, W. J. Zeng, and G. S. Ravi, Zero noise extrapolation on logical qubits by scaling the error correction code distance, 2023 IEEE Int. Conf. Quant. Comp. Eng. (QCE)1, 888 (2023)

    work page 2023

  70. [71]

    Suzuki, S

    Y . Suzuki, S. Endo, K. Fujii, and Y . Tokunaga, Quantum error mitigation as a universal error reduction technique: Applica- tions from the NISQ to the fault-tolerant quantum computing eras, PRX Quantum3, 010345 (2022)

    work page 2022

  71. [72]

    Camilo, T

    G. Camilo, T. O. Maciel, A. Tosta, A. Alhajri, T. de Lima Silva, D. S. França, and L. Aolita, Compilation-informed probabilistic quantum error cancellation, (2025), arXiv:2508.20174

    work page arXiv 2025

  72. [73]

    B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys.87, 307 (2015)

    work page 2015

  73. [74]

    E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature549, 172 (2017)

    work page 2017

  74. [75]

    Roffe, Quantum error correction: An introductory guide, Contemp

    J. Roffe, Quantum error correction: An introductory guide, Contemp. Phys.60, 226 (2019)

    work page 2019

  75. [76]

    A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett.77, 793 (1996)

    work page 1996

  76. [77]

    Aharonov and M

    D. Aharonov and M. Ben-Or, Fault-tolerant quantum compu- tation with constant error, STOC ’97: Proc. 29th Ann. ACM Symp. Th. Comp. , 176

    work page

  77. [78]

    Knill, R

    E. Knill, R. Laflamme, and W. H. Zurek, Resilient quantum computation: error models and thresholds, Proc. Roy. Soc. Lond. A454, 365 (1998)

    work page 1998

  78. [79]

    Preskill, Reliable quantum computers, Proc

    J. Preskill, Reliable quantum computers, Proc. Roy. Soc. Lond. A454, 385 (1998)

    work page 1998

  79. [80]

    Eastin and E

    B. Eastin and E. Knill, Restrictions on transversal encoded quantum gate sets, Phys. Rev. Lett.102, 110502 (2009)

    work page 2009

  80. [81]

    A. Y . Kitaev, Anyons in an exactly solved model and beyond, Ann. Phys.321, 2 (2006)

    work page 2006

Showing first 80 references.