Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
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 obs...
Saved in:
| Published in: | Science advances 2024-01, Vol.10 (3), p.eadk4321-eadk4321 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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ödinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propagation to compute expectation values with an effective wave function-operator sandwich bond dimension >16,000,000, achieving an absolute accuracy, without extrapolation, in the observables of |
|---|---|
| ISSN: | 2375-2548 2375-2548 |
| DOI: | 10.1126/sciadv.adk4321 |