arXiv (All)
open access
Low-Weight Canonical Logical Bases from Pair-Partition Codes
We construct complete canonical logical bases for qubit CSS codes by assigning quaternary coefficients to binary circulant permutation matrix pair-partition (CPM-PP) checks, constructing and normalizing logical representatives, and expanding the result into binary matrices. When the two check system
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
- Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes#1144362
- Concise Binary Object Representation (CBOR)#134818
- Even universal binary Hermitian lattices over imaginary quadratic fields#1110012
- GALIC: hybrid multi-qubitwise pauli grouping for quantum computing measurement#495594
- An iterated $I$-projection procedure for solving the generalized minimum information checkerboard copula problem#189338
Record · ID 1130255
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