New circuits and an open source decoder for the color code (2312.08813v1)
Abstract: We present two new color code circuits: one inspired by superdense coding and the other based on a middle-out strategy where the color code state appears halfway between measurements. We also present ``Chromobius'', an open source implementation of the m\"obius color code decoder. Using Chromobius, we show our new circuits reduce the performance gap between color codes and surface codes. Under uniform depolarizing noise with a noise strength of $0.1\%$, the middle-out color code circuit achieves a teraquop footprint of 1250 qubits (vs 650 for surface codes decoded by correlated matching). Finally, we highlight that Chromobius decodes toric color codes better when given less information, suggesting there's substantial room for improvement in color code decoders.
- “Encoding electronic spectra in quantum circuits with linear T complexity” In Physical Review X 8.4 APS, 2018, pp. 041015
- “Neural network decoder for topological color codes with circuit level noise” In New Journal of Physics 21.1 IOP Publishing, 2019, pp. 013003 DOI: 10.1088/1367-2630/aaf29e
- “Topological Quantum Distillation” In Physical Review Letters 97.18 American Physical Society (APS), 2006 DOI: 10.1103/physrevlett.97.180501
- “High-threshold and low-overhead fault-tolerant quantum memory” arXiv, 2023 DOI: 10.48550/ARXIV.2308.07915
- Charles H. Bennett and Stephen J. Wiesner “Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states” In Physical Review Letters 69.20 American Physical Society (APS), 1992, pp. 2881–2884 DOI: 10.1103/physrevlett.69.2881
- “Triangular color codes on trivalent graphs with flag qubits” In New Journal of Physics 22.2 IOP Publishing, 2020, pp. 023019 DOI: 10.1088/1367-2630/ab68fd
- Jack Edmonds “Paths, trees, and flowers” In Canadian Journal of mathematics 17 Cambridge University Press, 1965, pp. 449–467
- “Surface codes: Towards practical large-scale quantum computation” arXiv:1208.0928 In Phys. Rev. A 86, 2012, pp. 032324 DOI: 10.1103/PhysRevA.86.032324
- “How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits” In Quantum 5 Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften, 2021, pp. 433 DOI: 10.22331/q-2021-04-15-433
- Craig Gidney “A Pair Measurement Surface Code on Pentagons” arXiv, 2022 DOI: 10.48550/ARXIV.2206.12780
- “Data for "New circuits and an open source decoder for the color code"” In Zenodo Zenodo, 2023 DOI: 10.5281/zenodo.10375289
- “Improved quantum circuits for elliptic curve discrete logarithms” In Post-Quantum Cryptography: 11th International Conference, PQCrypto 2020, Paris, France, April 15–17, 2020, Proceedings 12100, 2020, pp. 425 Springer Nature DOI: 10.1007/978-3-030-44223-1_23
- “Sparse Blossom: correcting a million errors per core second with minimum-weight matching” In arXiv preprint arXiv:2303.15933, 2023
- “Efficient color code decoders in d≥2𝑑2d\geq 2italic_d ≥ 2 dimensions from toric code decoders” In Quantum 7 Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften, 2023, pp. 929 DOI: 10.22331/q-2023-02-21-929
- “Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction” In PRX Quantum 2 American Physical Society, 2021, pp. 030305 DOI: 10.1103/PRXQuantum.2.030305
- Matt McEwen, Dave Bacon and Craig Gidney “Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics” arXiv, 2023 DOI: 10.48550/ARXIV.2302.02192
- Kaavya Sahay and Benjamin J. Brown “Decoder for the Triangular Color Code by Matching on a Möbius Strip” In PRX Quantum 3.1 American Physical Society (APS), 2022 DOI: 10.1103/prxquantum.3.010310
- “Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories” In Physical Review Applied 18.1 American Physical Society (APS), 2022 DOI: 10.1103/physrevapplied.18.014072
- Wikipedia “Steiner tree problem”, 2023 URL: https://en.wikipedia.org/wiki/Steiner_tree_problem
- “Fusion Blossom: Fast MWPM Decoders for QEC” arXiv, 2023 DOI: 10.48550/ARXIV.2305.08307
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.