arXiv (All)
open access
Exact Unitary Synthesis: Simultaneously Optimal in Size and Depth-Ancilla Tradeoff
Unitary synthesis underlies universal quantum computation by translating unitary transformations into circuits of elementary gates. We show that for any budget $m\geq 0$ of ancilla, every $n$-qubit unitary can be exactly implemented using a quantum circuit consisting of $O(4^n)$ CNOT and single-qubi
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
- Circuit Optimization for Universality Transformation#1187333
- A log-depth in-place quantum Fourier transform that rarely needs ancillas#1110088
- Depth-Optimal Quantum Compilation#1128918
- On the Computational Power of Geometrically Local QAC circuits#1143727
- Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization#926038
Record · ID 1216092
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