REVIEW 12 cited by
Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
read the original abstract
In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transition toward fully fault-tolerant quantum computing. We examine theoretical no-go results and their implications, addressing misconceptions about the practicality of quantum error mitigation techniques and variational quantum algorithms. By emphasizing the nuances of error scaling, circuit depth, and algorithmic feasibility, we highlight viable near-term applications and synergies between error mitigation and early fault-tolerant architectures. Our discussion explores strategies for addressing current challenges, such as barren plateaus in variational circuits and the integration of quantum error mitigation and quantum error correction techniques. We aim to underscore the importance of continued innovation in hardware and algorithmic design to bridge the gap between theoretical potential and practical utility, paving the way for meaningful quantum advantage in the era of late noisy intermediate scale and early fault-tolerant quantum devices.
Forward citations
Cited by 12 Pith papers
-
Local tensor-train surrogates for quantum learning models
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.
-
Replay-buffer engineering for noise-robust quantum circuit optimization
Treating the replay buffer as a central lever in RL for quantum circuit optimization yields 4-32x sample efficiency gains, up to 67.5% faster episodes, and 85-90% fewer steps to accuracy on noisy molecular and compila...
-
Orthogonal Quantum Krylov Diagonalisation
OQKD realizes classical Lanczos orthogonality and tridiagonal structure on a quantum computer via Hamiltonian polynomials and GQSP, removing overlap regularization while matching Chebyshev-QKD query complexity.
-
Feynman's clock and hierarchy-informed sampling for quantum error mitigation
Feynman's clock maps arbitrary circuits onto Hamiltonian dynamics whose BBGKY hierarchy enables polynomial-overhead, controllable error mitigation via informed sampling.
-
Error Mitigation in Bosonic Systems via Virtual Distillation
Passive linear interferometers implement virtual distillation for bosonic observables, recovering noise-suppressed number, phase-shift and quadrature expectations under loss and dephasing.
-
Hybrid physical/logical zero-noise extrapolation with limited logical executions
Mixed physical-logical datasets for zero-noise extrapolation reduce estimator variance and physical runtime by orders of magnitude compared to pure logical or pure physical strategies when error correction suppresses ...
-
Reliable high-accuracy error mitigation for utility-scale quantum circuits
QESEM is a characterization-based error mitigation technique that achieves unbiased estimates with substantially reduced runtime cost compared to probabilistic error cancellation while outperforming zero-noise extrapo...
-
Hybrid physical/logical zero-noise extrapolation with limited logical executions
Hybrid physical/logical zero-noise extrapolation can cut runtime when logical error is much smaller than physical error under a calibrated linear noise model.
-
Space and Time Cost of Continuous Rotations in Surface Codes
Catalyst towers reduce runtime and spacetime volume for continuous rotations in surface codes at small and medium distances in phase oracle and variational state preparation circuits for option pricing.
-
Swap Network Augmented Ans\"atze on Arbitrary Connectivity
By augmenting quantum circuit ansatze with optimized swap networks, the work achieves better performance in ground-state energy calculations using fewer resources on devices with arbitrary qubit connectivity.
-
Mind the gaps: The fraught road to quantum advantage
The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.
-
Mind the gaps: The fraught road to quantum advantage
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.