arXiv (All)
open access
On the Computational Power of Geometrically Local QAC circuits
The computational power of $\mathsf{QAC}$, which are constant-depth quantum circuit families consisting of arbitrary single-qubit unitaries and n-qubit generalized Toffoli gates, has gained tremendous focus recently. In this work, we initiate the study of the computational complexity of geometricall
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The power of constant-depth quantum circuits of unbounded size#1154555
- Quantum Fourier transform toolbox#792566
- Quantum Fourier transform toolbox#788566
- A log-depth in-place quantum Fourier transform that rarely needs ancillas#1110088
- 2-Fold Forrelation is in QAC$^0$#975125
Record · ID 1143727
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive