Is the 2025 OTOC(2) quantum echo experiment beyond classical simulation?
50No. 657 in all physics · No. 30 in Quantum Information and Foundations
This text mentions work from 2024 on. Those parts were partly written without a live literature search and have not been checked by an editor yet.
For the second-order out-of-time-order correlator (OTOC(2)) circuits run by Google Quantum AI in 2025 (arXiv:2506.10191), compute the reported observables with error at or below the experimental error bars using classical methods (tensor networks, Pauli-path or Monte Carlo) in time comparable to the experiment, or give complexity-theoretic evidence that no such algorithm exists at that size.
What would settle it
A classical computation reproducing the published OTOC(2) values within error at modest cost, or a hardness argument tied to the experimental parameters.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
Google Quantum AI claimed a large classical-cost gap in 2025 and published a simplified OTOC(2) problem statement for classical challengers (arXiv:2510.19751).
No solutions, ideas or subproblems yet.
See also
- Related Classically verifiable quantum advantage on pre-fault-tolerant hardware
- Related Has an analog quench simulation exceeded classical computation?
- Related Measured Lyapunov exponent versus temperature in a quantum simulator
Details, signature and history
- Kind
- Well-posed question
- Answer
- Yes no
- Posed
- 2025
- Topic review
- A. M. Dalzell et al., Quantum algorithms: A survey of applications and end-to-end complexities, arXiv, 2023. Link
- Record
- Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
- Batch approval
- Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
- Earlier revisions
- revision 1 bundle
Proof
- Fingerprint
- d9766d2def81…
- Public log
- Entry 2,062, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.