Peaked quantum circuits claimed to show quantum advantage can be classically simulated in one hour on a GPU via mirrored MPO contraction and unswapping.
Title resolution pending
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 4
citation-polarity summary
fields
quant-ph 8roles
background 3polarities
background 3representative citing papers
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.
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.
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 extrapolation on utility-scale circuits.
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.
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.
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.
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.
citing papers explorer
-
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.
-
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.
-
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 extrapolation on utility-scale circuits.
-
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 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.