Metraipolis › archive › dc_ee73944cd988
All Unitaries Have Constant Depth Quantum Circuits — arXiv:2609.40351
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.40351
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:22:43.519Z
- SHA-256 of the archived text
731107eb6bdb54fe9561716d9a0e3425733c749ac5bd4e985c0b93b4502808e8- Stable URL of this page
https://metraipolis.com/documento/dc_ee73944cd988
How to cite
All Unitaries Have Constant Depth Quantum Circuits — arXiv:2609.40351 — arXiv (en), https://arxiv.org/abs/2609.40351 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ee73944cd988 (Metraipolis archive dc_ee73944cd988, sha256 731107eb6bdb54fe9561716d9a0e3425733c749ac5bd4e985c0b93b4502808e8)
BibTeX
@misc{dcee73944cd988,
title = {All Unitaries Have Constant Depth Quantum Circuits — arXiv:2609.40351},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.40351},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ee73944cd988; sha256 731107eb6bdb54fe9561716d9a0e3425733c749ac5bd4e985c0b93b4502808e8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40351. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
It is well-known that every $n$-qubit unitary can be implemented by a $2^{O(n)}$-depth quantum circuit using single- and two-qubit gates. It has been open whether exponential depth is *necessary* for general unitaries, even when allowing an unlimited number of ancilla qubits. Here we show, perhaps surprisingly, that all unitaries can be implemented exactly by a circuit of one- and two-qubit gates of depth $\mathsf{poly}(n)$ with $2^{O(n)}$ ancilla qubits. In other words, every $n$-qubit unitary can be parallelized to polynomial depth. In fact, our depth bound is *linear* in $n$, which is the best possible, and an exponential improvement on the previous best bound of $2^{n/2}$ due to Rosenthal [TQC 2022, Quantum 2026]. Moreover, if we allow unbounded fan-out gates, these circuits can be further reduced to *constant* depth. Our construction takes advantage of a novel relationship connecting the unitary synthesis problem of Aaronson and Kuperberg to locally-decodable codes and private information retrieval from complexity theory and cryptography, and has a natural interpretation in bosonic quantum computation.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.40351 — 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-07T14:53:56.904Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).