Does absence of barren plateaus imply classical simulability?
69No. 137 in all physics · No. 12 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.
Variational quantum algorithms tune circuit settings to lower a cost, but most become untrainable because the cost changes exponentially little as the settings vary (a barren plateau). It is conjectured that every circuit family provably free of this flatness can also be imitated by a classical computer, which would remove the point of using it.
No solutions, ideas or subproblems yet.
Details, signature and history
- Kind
- Well-posed question
- Answer
- Yes no
- Posed
- 2023
- Topic review
- R. Orus, Tensor networks for complex quantum systems, Nature Reviews Physics, 2019. 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
- e7cbf7c913e7…
- Public log
- Entry 1,971, 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.