Finite-size boundary of classical hardness for noisy random circuit sampling
50No. 676 in all physics · No. 33 in Quantum Information and Foundations
At a fixed error rate per gate, very large random circuits become easy for classical computers, yet the experiments done so far are believed to be hard. Where the crossover lies, in qubit number, depth and noise rate, is not known.
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 (Nature 2024) reported a noise-driven phase transition in random circuit sampling and placed its experiment in the hard phase; classical simulation efforts continue.
No solutions, ideas or subproblems yet.
See also
- Related Classical sampling of random circuits with non-unital noise
- Related Which simulator observables have size-independent error bounds?
- Related Photon-loss threshold for classical simulability of Gaussian boson sampling
Details, signature and history
- Kind
- Well-posed question
- Answer
- Value
- Topic review
- R. Orus, Tensor networks for complex quantum systems, Nature Reviews Physics, 2019. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- 8ba4e7cd08aa…
- Public log
- Entry 1,974, 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.