Conjoining only bit-flip and phase-flip repetition codes can generate any CSS code, and an iterative algorithm grows sparse subsystem codes with kd^2=O(n) worst-case scaling.
Time-efficient constant-space-overhead fault-tolerant quantum computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Growing Sparse Quantum Codes from a Seed
Conjoining only bit-flip and phase-flip repetition codes can generate any CSS code, and an iterative algorithm grows sparse subsystem codes with kd^2=O(n) worst-case scaling.