REVIEW 5 cited by
Fast and converged classical simulations 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
A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits that exceed the capabilities of exact classical simulation. We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment, and can also be systematically converged beyond the experimental accuracy. Our most accurate technique combines a mixed Schr\"{o}dinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propagation to compute expectation values with an effective wavefunction-operator sandwich bond dimension >16,000,000, achieving an absolute accuracy, without extrapolation, in the observables of <0.01, which is converged for many practical purposes. We thereby identify inaccuracies in the experimental extrapolations and suggest how future experiments can be implemented to increase the classical hardness.
Forward citations
Cited by 5 Pith papers
-
Efficient classical simulation of large-scale unitary cluster Jastrow circuits
A one-layer UCJ quantum chemistry circuit can have its energy computed classically in O(N^7) time, so single-layer UCJ circuits cannot provide quantum advantage for energy estimation.
-
A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling
A hardware-efficient binary-tree ansatz has a closed-form diagonal Fubini–Study metric, enabling metric-aware VQE and time evolution without auxiliary circuits, with linear-in-k pruning for sparse sectors.
-
Simulating dynamics of the two-dimensional transverse-field Ising model: a comparative study of large-scale classical numerics
Classical simulations of the 2D transverse-field Ising model are reliable for quasi-adiabatic annealing across methods, but near-critical post-quench dynamics defeats MPS, TTN, 2DTN-BP, and NQS beyond tJ≈2.
-
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.
Discussion (0). Sign in to comment.