arXiv (All)
open access
Local Clifford equivalence to CSS codes: Polynomial-time classification and conversion
Calderbank--Shor--Steane (CSS) codes support decoding and fault-tolerant logical operations through separate pure $X$ and pure $Z$ stabilizer checks. Generator choices and single-qubit Clifford transformations can obscure this structure. We give a deterministic polynomial-time algorithm that decides
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
- Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise#1050804
- Periodicity of weight enumerators for codes generated by an integral matrix#1069734
- Reconstructing algebraic functions from a nonconforming exponential weighted enriched finite element#122013
- Hidden Ciphers and Where to Find Them: Static Discovery and Assessment of Cryptographic Assets in Software#429264
- Universal Hashing and Geometric Codes#921554
Record · ID 1412978
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