REVIEW 7 cited by
Fast classical simulation of evidence for the utility of quantum computing before fault tolerance
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
read the original abstract
We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor [Nature 618, 500 (2023)]. Our classical simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, as well as faster than the estimated quantum hardware runtime without classical processing, and are in good agreement with the zero-noise extrapolated experimental results.
Forward citations
Cited by 7 Pith papers
-
Constructive interference at the edge of quantum ergodic dynamics
Second-order out-of-time-order correlators measured on 65-qubit random circuits remain sensitive to dynamics and are estimated to be beyond the reach of current classical tensor-network simulation.
-
Efficient computation of real-time correlators using Pauli Propagation
Short-time truncated Pauli propagation combined with low-rank positive semi-definite time extension recovers dynamical structure factors for 1D/2D Heisenberg models beyond the direct Pauli window.
-
Scalable Simulation of Quantum Many-Body Dynamics with Or-Represented Quantum Algebra
ORQA, a Pauli-string based simulation framework, is parallelized to run on Fugaku with up to 2^17 processes, tracking over a trillion Pauli strings and reproducing kicked Ising results.
-
Variational Quantum Simulations of a Two-Dimensional Frustrated Transverse-Field Ising Model on a Trapped-Ion Quantum Computer
A 16-qubit trapped-ion processor, running classically pretrained VQE circuits without error mitigation, reproduces the ferromagnetic and stripe phases of a 2D frustrated transverse-field Ising model.
-
Benchmarking Zero-Setup Quantum Circuit Simulators
GPU-accelerated zero-setup simulators show sub-quadratic MPS bond-dimension scaling and up to 1,400× PPS speedups, uniquely reaching fine truncation accuracy on the 127-qubit kicked Ising circuit.
-
Limits of Clifford Disentangling in Tensor Network States
Clifford disentangling of tensor-network states works only up to a linear number of T gates; beyond that, magic accumulation defeats it, and a no-go theorem blocks universal single-qubit disentangling.
-
BloQBench: A Blockchain Benchmarking Framework for Quantum Supremacy
An Ethereum contract generates hard-to-factor integer locks whose on-chain factorization is meant to certify cryptographic quantum supremacy and trigger quantum-secure signatures.
Discussion (0). Continue with ORCID to comment.