arXiv (OAI Expanded)
open access
Canonical Form and Finite Blocklength Bounds for Stabilizer Codes
First, a canonical form for stabilizer parity check matrices of arbitrary size and rank is derived. Next, it is shown that the closely related canonical form of the Clifford group can be computed in time $O(n^3)$ for $n$ qubits, which improves upon the previously known time $O(n^6)$. Finally, the re
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
- Canonical Form and Finite Blocklength Bounds for Stabilizer Codes#924401
- Asymptotically Optimal Mixed-State Cloning#1130828
- Lifted-Product QLDPC Codes in the Polynomial Domain#821254
- High-Rate Quasi-Dyadic Quantum LDPC Codes#1050384
- Floquet Majorana XYZ Codes with Tunable Logical Dynamics#997678
Record · ID 920170
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