arXiv (All)
open access
Computing with qLDPC Codes by Climbing the Chain Map Hierarchy
We develop a framework for logical computation with qLDPC codes that places logical Pauli, Clifford, and non-Clifford operations on the same footing. This brings the simple homological description of Pauli logicals to the patchwork landscape of logical Clifford and non-Clifford operations, providing
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
- Computing with qLDPC Codes by Climbing the Chain Map Hierarchy#921136
- Pauli web of the $|Y\rangle$ state surface code injection#819213
- Pauli web of the $|Y\rangle$ state surface code injection#809221
- GadIR: A Spatial-Topology Preserving Compiler for Quantum Many-Body Systems Simulation#822198
- Dual-Module QR Codes: Bypassing QR Code Scanners in Enterprise Email GatewaysWhitepaperOffensive Operations6 Aug 2026Steven Legere#434819
Record · ID 925372
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