Ising model formulation for highly accurate topological color codes decoding

Abstract

Quantum error correction is an essential ingredient for reliable quantum computation for theoretically provable quantum speedup. Topological color codes, one of the quantum error correction codes, have an advantage against the surface codes in that all Clifford gates can be implemented transversely. However, the hardness of decoding makes the color codes not suitable as the best candidate for experimentally feasible implementation of quantum error correction. Here we propose an Ising model formulation that enables highly accurate decoding of the color codes. In this formulation, we map stabilizer operators to classical spin variables to represent an error satisfying the syndrome. Then we construct an Ising Hamiltonian that counts the number of errors and formulate the decoding problem as an energy minimization problem of an Ising Hamiltonian, which is solved by simulated annealing. In numerical simulations on the (4.8.8) lattice, we find an error threshold of 10.36(5)% for bit-flip noise model, 18.47(5)% for depolarizing noise model, and 2.90(4)% for phenomenological noise model (bit-flip error is located on each of data and measurement qubits), all of which are higher than the thresholds of existing efficient decoding algorithms. Furthermore, we verify that the achieved logical error rates are almost optimal in the sense that they are almost the same as those obtained by exact optimizations by CPLEX with smaller decoding time in many cases. Since the decoding process has been a bottleneck for performance analysis, the proposed decoding method is useful for further exploration of the possibility of the topological color codes.

arXiv comment14 pages, 12 figures

References in corpus (31)

• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum algorithm for solving linear systems of equations
• Surface codes: Towards practical large-scale quantum computation
• Quantum computational advantage using photons
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• Topological Quantum Distillation
• Roads towards fault-tolerant universal quantum computation
• Surface code quantum computing by lattice surgery
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Quantum Low-Density Parity-Check Codes
• Towards practical classical processing for the surface code
• Topological Computation without Braiding
• Strong Resilience of Topological Codes to Depolarization
• Universal transversal gates with color codes - a simplified approach
• Tailoring surface codes for highly biased noise
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• High threshold error correction for the surface code
• Universal topological phase of 2D stabilizer codes
• Advantages of versatile neural-network decoding for topological codes
• NP-hardness of decoding quantum error-correction codes
• Tricolored Lattice Gauge Theory with Randomness: Fault-Tolerance in Topological Color Codes
• Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors
• Fault-tolerant interface between quantum memories and quantum processors
• Accuracy thresholds of topological color codes on the hexagonal and square-octagonal lattices
• Measurement-free topological protection using dissipative feedback
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• Error tolerance of topological codes with independent bit-flip and measurement errors

Cited by in corpus (5)

• Color code decoder with improved scaling for correcting circuit-level noise
• Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization
• Anomalous distribution of magnetization in an Ising spin glass with correlated disorder
• Low-overhead magic state distillation with color codes
• Simulated-annealing decoder for the XZZX code with greedy-matching initialization