Quantum
High-Rate Quantum Codes with Proven Distance and Low-Weight Measurements
Publication: quant-ph updates on arXiv.org
Author: Kishor Bharti, Tobias Haug, Runzhou Tao, Kevin Ye
Source published: 05/10/2026, 04:00:00 UTC
Briefing created: 05/10/2026, 04:30:33 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 05/10/2026, 04:13:25 UTC.
Briefings
A new family of quantum subsystem codes was analyzed on rectangular grids with even side lengths of at least four. Researchers derived the number of protected logical qubits and proved the dressed distance without numerical search. At a 10,000 data qubit budget, a code at distance 16 protected 4,096 logical qubits using weight-ten measurements. At distances 32 and 64, codes protected 1,024 and 256 logical qubits respectively, using weight-six measurements. Lean code snippets guide formal verification of the construction and distances.
Key points
- Researchers analyzed a family of quantum subsystem codes defined on rectangular coordinate grids with even side lengths of at least four.
- At a 10,000 data qubit budget, a code at distance 16 protected 4,096 logical qubits using weight-ten measurements.
Context and limitations
The study covers rectangular grids with even side lengths of at least four. Measurements were performed at distances 16, 32, and 64. The tradeoff between encoding rate and measurement weight was determined within a 10,000 data qubit budget. Results are based on direct operator measurements and formal proofs rather than numerical searches.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 05/10/2026, 04:30:33 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeif5apoj6jvzjec6l3oweujo452um3pgl6n7i5bbqo6xhmptpu6ddi