arXiv (All)
open access
Breaking the cubic barrier for the inverse-free Solovay-Kitaev algorithm
The Solovay-Kitaev algorithm states that it is possible to efficiently compile unitaries to accuracy $ε$ in $\text{polylog}(1/ε)$ time using any universal gate set. While Solovay and Kitaev's initial work addressed inverse-closed gate sets, recently Bouland and Giurgicǎ-Tiron showed it is possible t
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
- Depth-Optimal Quantum Compilation#1128918
- No-go theorems for sublinear-depth group designs#986780
- Vertex reconstruction for a search for neutron-antineutron conversions with HIBEAM#792327
- High-Level Big Integer Arithmetic in Futhark for GPUs#422228
- Black Hole Radiation Decoding in the Haar Random Oracle Model#1216499
Record · ID 1188366
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