Metraipolis › archive › dc_30bc9befe319

Towards verifiable quantum advantage with random circuits: Observables that survive concentration — arXiv:2609.37890

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37890
License (as archived)
CC0-1.0
Archived
2026-10-07T19:29:20.476Z
SHA-256 of the archived text
9bb04a4616a77289903d93faa3aab3118d1c744b4d291248cf0b94efcb34bb78
Stable URL of this page
https://metraipolis.com/documento/dc_30bc9befe319

How to cite

Towards verifiable quantum advantage with random circuits: Observables that survive concentration — arXiv:2609.37890 — arXiv (en), https://arxiv.org/abs/2609.37890 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_30bc9befe319 (Metraipolis archive dc_30bc9befe319, sha256 9bb04a4616a77289903d93faa3aab3118d1c744b4d291248cf0b94efcb34bb78)
BibTeX
@misc{dc30bc9befe319,
  title = {Towards verifiable quantum advantage with random circuits: Observables that survive concentration — arXiv:2609.37890},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37890},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_30bc9befe319; sha256 9bb04a4616a77289903d93faa3aab3118d1c744b4d291248cf0b94efcb34bb78},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37890. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Demonstrating quantum advantage on current quantum hardware is a central goal of quantum computing, and random quantum circuits underpin many leading proposals. Yet sampling-based demonstrations are often difficult to verify, while observable-based approaches face a different challenge: concentration can suppress differences between circuit instances. Recent experiments have put forward the estimation of out-of-time-order correlators (OTOCs) in random circuits as a promising task for verifiable quantum advantage, yet whether their circuit-to-circuit fluctuations survive concentration as system size grows has remained open. Here we show that they do. For broad classes of local random circuits in any fixed spatial dimension, we prove inverse-polynomial fluctuations of fixed-order OTOCs at system-scale depths. In one-dimensional Haar-random brickwork circuits, we further show that macroscopically many gates contribute to these fluctuations, yet in each layer they remain confined to a sublinear-width region. As a byproduct, we develop a classical algorithm exhibiting the first rigorous improvement over brute-force classical simulation of OTOCs in 1D. Although classical hardness remains open, our results rule out strong concentration as an obstruction to OTOC-based proposals for verifiable quantum advantage.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-30 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.37890 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T18:55:50.619Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).