Metraipolis › archive › dc_cb608a241f26
One Gate at a Time: Complexity Growth in Random Quantum Circuits — arXiv:2609.17457
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.17457
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T22:06:44.560Z
- SHA-256 of the archived text
cee3d0cf21368842815b8992cbe2f5992860450f34ab3bc4053bc462e9546fbb- Stable URL of this page
https://metraipolis.com/documento/dc_cb608a241f26
How to cite
One Gate at a Time: Complexity Growth in Random Quantum Circuits — arXiv:2609.17457 — arXiv (en), https://arxiv.org/abs/2609.17457 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb608a241f26 (Metraipolis archive dc_cb608a241f26, sha256 cee3d0cf21368842815b8992cbe2f5992860450f34ab3bc4053bc462e9546fbb)
BibTeX
@misc{dccb608a241f26,
title = {One Gate at a Time: Complexity Growth in Random Quantum Circuits — arXiv:2609.17457},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.17457},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb608a241f26; sha256 cee3d0cf21368842815b8992cbe2f5992860450f34ab3bc4053bc462e9546fbb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17457. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A random unitary quantum circuit is expected to be incompressible for exponentially long times. We show that the constant-error circuit complexity of a random unitary circuit grows almost linearly with time as $\Omega(T/\log T)$. The bound holds for all $2\leq T\leq 4^n$ where $n$ is the system size, and involves no other $n$-dependence. This improves previous lower bounds derived from spectral gaps and unitary designs by a factor of $\mathrm{poly}(n)$. Drawing on insights from stochastic calculus, geometric functional analysis, and randomized linear algebra, our approach exploits the circuit's response to variations of individual gates and requires no control over convergence to high-order unitary designs.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-16 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.17457 — 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-15T21:52:12.841Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).