REVIEW 17 cited by
A Framework for Quantum Advantage
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
A Framework for Quantum Advantage
read the original abstract
As quantum computing approaches the threshold where certain tasks demonstrably outpace their classical machines, the need for a precise, clear, consensus-driven definition of quantum advantage becomes essential. Rapid progress in the field has blurred this term across companies, architectures, and application domains. Here, we aim to articulate an operational definition for quantum advantage that is both platform-agnostic and empirically verifiable. Building on this framework, we highlight the algorithmic families most likely to achieve early advantage. Finally, we outline our vision for the near future, in which quantum computers enhance existing high-performance computing platforms, enabling new frontiers in chemistry, materials discovery, optimization, and beyond.
Forward citations
Cited by 17 Pith papers
-
Sampling hard circuits with verifiably high fidelity
A 97-qubit experiment certifies a 0.284 fidelity lower bound for a 468-T-gate sampling circuit by combining spacetime-code error detection with the measured fidelity of an undoped Clifford reference.
-
Efficient Classical Simulation of Heuristic Peaked Quantum Circuits
Peaked quantum circuits claimed to show quantum advantage can be classically simulated in one hour on a GPU via mirrored MPO contraction and unswapping.
-
Logarithmic growth of operator entanglement in a clean non-integrable circuit
In a clean non-integrable semi-ergodic dual-unitary circuit, operator entanglement of a local Pauli grows at most logarithmically in time, with bimodal operator-size distributions and late-time autocorrelations matchi...
-
Toward Covert Quantum Computing
The paper defines covert quantum computing via quantum strategies, proves O(sqrt(n)) border qubits suffice for detection in planar n-qubit circuits with nearest-neighbor crosstalk, and experimentally detects additiona...
-
Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor
A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.
-
Syndrome aware mitigation of logical errors
Conditioning logical error mitigation on the measured error-correcting syndromes cuts sampling overhead exponentially and can make error correction useful above its standard pseudo-threshold.
-
Universal initial state preparation for first quantized quantum simulations
By mapping Fock occupations to Schur labels via the Jordan-Schwinger homomorphism and applying an inverse quantum Schur transform, the paper constructs a first-quantized state-preparation protocol with poly(L,N,log d,...
-
Quantum-inspired dynamical models on quantum and classical annealers
A parallel-in-time encoding turns quantum dynamical propagators into QUBO instances for direct benchmarking of quantum annealers against classical solvers on models from single-qubit rotations to PT-symmetric systems.
-
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...
-
Systematic Experiment Tracking in Quantum Software: A Case Study of Reservoir Computing with Error Mitigation
MLflow-style experiment tracking, extended with quantum provenance, supports reproducible multi-stage quantum software pipelines, shown on error-mitigated quantum reservoir computing for chaotic time-series prediction.
-
Observation of Robust and Coherent Non-Abelian Hadron Dynamics on Noisy Quantum Processors
A 60-site SU(2) lattice gauge theory was run on 120 qubits, but the implemented dynamics approximate to non-interacting fermion hopping, and the abstract's claimed breathing-mode frequency is not extracted anywhere.
-
Dissipative ground-state preparation of a quantum spin chain on a trapped-ion quantum computer
A trapped-ion experiment prepared low-energy states of a 19-spin Ising chain by engineered dissipation, backed by an exact finite-step Kraus form of the cooling channel.
-
Recent quantum runtime (dis)advantages
End-to-end runtime definitions and strong classical baselines show that three recent quantum advantage claims in annealing, Simon's problem, and hybrid algorithms do not hold on NISQ hardware.
-
Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor
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.
-
Experimental Workflows for Combinatorial Optimization: Towards Quantum Advantage
A sandbox platform enables end-to-end hybrid workflows that reduce graph problems, run QAOA on IBM hardware up to 128 qubits, and refine outputs classically for problems including vertex cover and clique.
-
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.