arXiv (All)
open access
Achieving the limits of automorphism gates
Universal fault-tolerant quantum computing combines versatile but expensive operations with specialized but cheap ones. Its efficiency depends on how much computation can be pushed onto the cheap operations and on the size of the code needed to do so. Automorphism gates provide such cheap operations
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
- Evaluating Verified Autonomy in Quantum Engineering#1123802
- Evaluating Verified Autonomy in Quantum Engineering#919430
- Fault-Tolerant Quantum Computation with Adversarial Errors#625405
- Fault-Tolerant Quantum Computation with Adversarial Errors#623132
- Fault-tolerant quantum computation by anyons#6178
Record · ID 1013848
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