arXiv (All)
open access
Purely-logarithmic-time- and constant-space-overhead fault-tolerant quantum computation
We prove that constant-space-overhead fault-tolerant quantum computation can be achieved with provably strictly logarithmic time overhead, improving over the best known results with additional subpolylogarithmic factors. Our main construction uses polynomial-subrank transversal logical $\CCZ$ gates
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
- Syndrome measurements enable deterministic fault-tolerant $T$ gates#1077961
- Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates#1142011
- Measurement-free, scalable, and fault-tolerant universal quantum computing.#165838
- Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation#1155103
- The Physical Impossibility of Scalable Universal Quantum Computing: A Philosophical and Thermodynamic Critique#209865
Record · ID 1076948
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