Optimized Many-Hypercube Codes toward Lower Logical Error Rates and Earlier Realization
Hayato Goto

TL;DR
This paper investigates smaller many-hypercube quantum error-detecting codes to achieve lower logical error rates and earlier experimental realization, introducing efficient fault-tolerant encoders and demonstrating superior performance in circuit-level noise models.
Contribution
It introduces optimized smaller many-hypercube codes and fault-tolerant encoders, showing they outperform larger codes in logical error rates and resource overhead.
Findings
Smaller codes like D_{6,4,4} achieve lower logical error rates than larger codes.
Efficient fault-tolerant encoders reduce overhead by about 60%.
D_{6,4,4} performs best for logical CNOT gates in circuit-level noise models.
Abstract
Many-hypercube codes, concatenated quantum error-detecting codes ( is even), have recently been proposed as high-rate quantum codes suitable for fault-tolerant quantum computing. While the original many-hypercube codes with can achieve remarkably high encoding rates (about 30% and 20% at concatenation levels 3 and 4, respectively), they have large code block sizes at high levels (216 and 1296 physical qubits per block at levels 3 and 4, respectively), making not only experimental realization difficult but also logical error rates per code block high. Toward earlier experimental realization and lower logical error rates, here we comprehensively investigate smaller many-hypercube codes with and/or codes, where, e.g., denotes the many-hypercube code using at level 1 and at levels 2 and 3. As a result, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Radiation Effects in Electronics
