arXiv (All)
open access
Quantum codes are quantized codes: Stabilizer codes from quantization over finite fields
We present a discrete analogue of geometric quantization over finite fields which, when applied to certain classical error-correcting codes, yields quantum error-correcting codes. This provides a physical interpretation for a previously known quantum-classical correspondence in coding theory.
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
- Regev's reduction as a candidate quantum algorithm for the discrete logarithm problem in finite abelian groups#1155184
- Transversal non-Clifford gates on good quantum locally testable codes#1064919
- Algebraic quantum field theory: A Status report#498754
- Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition#973273
- Decoder- and Noise-Aware Optimization Framework for Clifford-Deformed Quantum Error-Correcting Codes#1297941
Record · ID 1215703
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