arXiv (All)
open access
CircLS: Compiling Lattice Surgery to Physical Circuits with Dynamic Allocation
In fault-tolerant quantum computing, lattice surgery (LS) is one of the leading ways to realize logical operations, and the Pauli product measurement (PPM) is the basic instruction of LS-based computing. Compilers that work on the PPM sequence, however, stay at the logical level rather than the phys
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
- Mechanizing Choreographic Programs and Hoare Logic with State Transformers#620746
- Mechanizing Choreographic Programs and Hoare Logic with State Transformers#619067
- A decision-theoretic approach to dealing with uncertainty in quantum mechanics#183220
- Generalizing Pauli Checks for Qudit-based Quantum Error Detection and Mitigation#1076125
- NIST FIPS 203: Module-Lattice-Based Key-Encapsulation Mechanism Standard#2816
Record · ID 1049958
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