arXiv (All)
open access
Efficiently estimating failure rates of fault-tolerant logical non-Clifford blocks
Useful quantum computation requires the fault-tolerant implementations of a universal gate set which are generically not efficiently simulable. We devise an algebraic framework that allows for efficient sampling from the measurement distribution of fault-tolerant circuits that implement diagonal log
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
- Theory of spacetime quantum fault tolerance#1144925
- Measurement incompatibility and quantum steering via linear programming#377976
- Fault-Tolerant Quantum Computation with Adversarial Errors#625405
- Fault-Tolerant Quantum Computation with Adversarial Errors#623132
- Noise Limits on Fault-Tolerant Fermionic Quantum Computing#987211
Record · ID 1014079
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