arXiv (All)
open access
Fault-tolerant and fully addressable unitary logical gates via round-robin sparsification
For quantum low-density parity check (qLDPC) codes, the ability to manipulate individual logical units of information, i.e. the use of addressable gates, enables maximal utility of their efficient encoding. We introduce explicit low-depth unitary circuits that realize fully addressable and fault-tol
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
- Hierarchical Quantum Logical Processor with Amortized Long-Range Connectivity#1156398
- 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
- Breakeven demonstration of quantum low-density parity-check codes#1109069
Record · ID 1188305
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