REVIEW 10 cited by
Exponentially tighter bounds on limitations of quantum error mitigation
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
Exponentially tighter bounds on limitations of quantum error mitigation
read the original abstract
Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing without the heavy resource overheads required by fault tolerant schemes. Recently, error mitigation has been successfully applied to reduce noise in near-term applications. In this work, however, we identify strong limitations to the degree to which quantum noise can be effectively `undone' for larger system sizes. Our framework rigorously captures large classes of error mitigation schemes in use today. By relating error mitigation to a statistical inference problem, we show that even at shallow circuit depths comparable to the current experiments, a superpolynomial number of samples is needed in the worst case to estimate the expectation values of noiseless observables, the principal task of error mitigation. Notably, our construction implies that scrambling due to noise can kick in at exponentially smaller depths than previously thought. They also impact other near-term applications, constraining kernel estimation in quantum machine learning, causing an earlier emergence of noise-induced barren plateaus in variational quantum algorithms and ruling out exponential quantum speed-ups in estimating expectation values in the presence of noise or preparing the ground state of a Hamiltonian.
Forward citations
Cited by 10 Pith papers
-
Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
A new potential-based algorithm achieves instance-optimal O(sqrt(T·S(X||I/d))) regret for matrix LEA with the same complexity as MMWU, using a one-sided Jensen trace inequality.
-
Theory and Architecture of Syndrome-Resolved Logical Gates
A new theorem gives weak (probabilistic) transversal implementations of arbitrary multi-qubit Pauli rotations for CSS codes, enabling an in-place rotation architecture with large projected resource savings.
-
Exploiting biased noise in variational quantum models
Twirling amplitude-damping noise into uniform Pauli/depolarising channels reduces expressivity and gradient magnitudes, while preserving the noise bias yields better VQA optimisation in the studied models.
-
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...
-
Robust design under uncertainty in quantum error mitigation
Presents unbiased uncertainty quantification for post-processing error mitigation and applies it to optimize hyperparameters in Zero Noise Extrapolation and Clifford Data Regression under finite-shot noise.
-
Feasibility of performing quantum chemistry calculations on quantum computers
New criteria reveal VQE needs fault-tolerant quantum computers due to decoherence and QPE has exponentially suppressed success probability from orthogonality catastrophe in classical input states.
-
Assessing requirements to scale to practical quantum advantage
A layered resource estimation framework applied to three quantum applications shows practical advantage requires 10^5-10^6 physical qubits, driven by size, speed, and controllability.
-
Stability of digital and analog quantum simulations under noise
Rigorous worst- and average-case error bounds show comparable worst-case scaling for digital and analog quantum simulators under perturbative noise, with distinct average-case error cancellation and concentration boun...
-
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.