Papers
Topics
Authors
Recent
Search
2000 character limit reached

Decoding algorithms for surface codes

Published 27 Jul 2023 in quant-ph | (2307.14989v6)

Abstract: Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone to errors. For this reason, quantum error correction is an invaluable tool to make quantum information reliable and enable the ultimate goal of fault-tolerant quantum computing. Surface codes currently stand as the most promising candidates to build near term error corrected qubits given their two-dimensional architecture, the requirement of only local operations, and high tolerance to quantum noise. Decoding algorithms are an integral component of any error correction scheme, as they are tasked with producing accurate estimates of the errors that affect quantum information, so that they can subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. This poses a connundrum, where decoding performance is improved at the expense of complexity and viceversa. In this review, a thorough discussion of state-of-the-art decoding algorithms for surface codes is provided. The target audience of this work are both readers with an introductory understanding of the field as well as those seeking to further their knowledge of the decoding paradigm of surface codes. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results. In addition, both the decoding performance, in terms of error correction capability, and decoding complexity, are compared. A review of the existing software tools regarding surface codes decoding is also provided.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (239)
  1. Richard P Feynman. “Simulating physics with computers”. International journal of theoretical physics 21, 467–488 (1982).
  2. John Preskill. “Quantum computing and the entanglement frontier” (2012). arXiv:1203.5813.
  3. P.W. Shor. “Algorithms for quantum computation: discrete logarithms and factoring”. In Proceedings 35th Annual Symposium on Foundations of Computer Science. Pages 124–134.  (1994).
  4. Ashley Montanaro. “Quantum algorithms: an overview”. npj Quantum Information 2, 15023 (2016).
  5. C. H. Bennett and G. Brassard. “Quantum cryptography: Public key distribution and coin tossing”. In Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing. Page 175. India (1984).
  6. Artur K. Ekert. “Quantum cryptography based on bell’s theorem”. Phys. Rev. Lett. 67, 661–663 (1991).
  7. “Noisy intermediate-scale quantum algorithms”. Rev. Mod. Phys. 94, 015004 (2022).
  8. “Quantum algorithm for data fitting”. Phys. Rev. Lett. 109, 050505 (2012).
  9. “Quantum machine learning”. Nature 549, 195–202 (2017).
  10. “The prospects of quantum computing in computational molecular biology”. WIREs Computational Molecular Science 11, e1481 (2021).
  11. “Molecular quantum dynamics: A quantum computing perspective”. Accounts of Chemical Research 54, 4229–4238 (2021).
  12. “Gate-based quantum computing for protein design”. PLoS Comput. Biol. 19, e1011033 (2023).
  13. “Traversable wormhole dynamics on a quantum processor”. Nature 612, 51–55 (2022).
  14. “Quantum technologies in particle physics”. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 380, 20210072 (2022).
  15. “Quantum supremacy using a programmable superconducting processor”. Nature 574, 505–510 (2019).
  16. “Quantum computational advantage using photons”. Science 370, 1460–1463 (2020).
  17. “Strong quantum computational advantage using a superconducting quantum processor”. Phys. Rev. Lett. 127, 180501 (2021).
  18. “Quantum advantage in learning from experiments”. Science 376, 1182–1186 (2022).
  19. “Quantum computational advantage with a programmable photonic processor”. Nature 606, 75–81 (2022).
  20. “Quantum computation and quantum information: 10th anniversary edition”. Cambridge University Press. USA (2011). 10th edition.
  21. “A programmable qudit-based quantum processor”. Nature Communications 13, 1166 (2022).
  22. “A one-way quantum computer”. Phys. Rev. Lett. 86, 5188–5191 (2001).
  23. “Measurement-based quantum computation”. Nature Physics 5, 19–26 (2009).
  24. “Quantum quenching, annealing and computation”. Springer-Verlag Berlin. DE (2010). 1 edition.
  25. “Quantum information processing with bosonic qubits in circuit qed”. Quantum Science and Technology 6, 033001 (2021).
  26. “Superconducting quantum computing: a review”. Science China Information Sciences 63, 180501 (2020).
  27. “Quantum computing with trapped ions”. Physics Reports 469, 155–203 (2008).
  28. “Photonic quantum information processing: A concise review”. Applied Physics Reviews6 (2019).
  29. Peter W. Shor. “Scheme for reducing decoherence in quantum computer memory”. Phys. Rev. A 52, R2493–R2496 (1995).
  30. “Approximating decoherence processes for the design and simulation of quantum error correction codes on classical computers”. IEEE Access 8, 172623–172643 (2020).
  31. “Randomized benchmarking and process tomography for gate errors in a solid-state qubit”. Phys. Rev. Lett. 102, 090502 (2009).
  32. “Surface codes: Towards practical large-scale quantum computation”. Phys. Rev. A 86, 032324 (2012).
  33. John Preskill. “Quantum Computing in the NISQ era and beyond”. Quantum 2, 79 (2018).
  34. “Decoherence benchmarking of superconducting qubits”. npj Quantum Information 5, 54 (2019).
  35. “Time-varying quantum channel models for superconducting qubits”. npj Quantum Information 7, 115 (2021).
  36. I. S. Reed and G. Solomon. “Polynomial codes over certain finite fields”. Journal of the Society for Industrial and Applied Mathematics 8, 300–304 (1960).
  37. R. Gallager. “Low-density parity-check codes”. IRE Transactions on Information Theory 8, 21–28 (1962).
  38. “Near shannon limit error-correcting coding and decoding: Turbo-codes. 1”. In Proceedings of ICC ’93 - IEEE International Conference on Communications. Volume 2, pages 1064–1070 vol.2.  (1993).
  39. Daniel Gottesman. “Stabilizer codes and quantum error correction”. Phd thesis. California Institute of Technology. Pasadena, CA (1997).
  40. A.Yu. Kitaev. “Fault-tolerant quantum computation by anyons”. Annals of Physics 303, 2–30 (2003).
  41. “The xzzx surface code”. Nature Communications 12, 2172 (2021).
  42. “Ultrahigh error threshold for surface codes with biased noise”. Phys. Rev. Lett. 120, 050505 (2018).
  43. “Topological and subsystem codes on low-degree graphs with flag qubits”. Phys. Rev. X 10, 011022 (2020).
  44. H. Bombin and M. A. Martin-Delgado. “Topological quantum distillation”. Phys. Rev. Lett. 97, 180501 (2006).
  45. “Sparse-graph codes for quantum error correction”. IEEE Transactions on Information Theory 50, 2315–2330 (2004).
  46. “Degenerate Quantum LDPC Codes With Good Finite Length Performance”. Quantum 5, 585 (2021).
  47. “Quantum ldpc codes with almost linear minimum distance”. IEEE Transactions on Information Theory 68, 213–229 (2022).
  48. “Asymptotically Good Quantum and Locally Testable Classical LDPC Codes” (2021). arXiv:2111.03654.
  49. “Quantum low-density parity-check codes”. PRX Quantum 2, 040101 (2021).
  50. “Approach for the construction of non-calderbank-steane-shor low-density-generator-matrix–based quantum codes”. Phys. Rev. A 102, 012423 (2020).
  51. “Quantum serial turbo codes”. IEEE Transactions on Information Theory 55, 2776–2798 (2009).
  52. “Entanglement-assisted quantum turbo codes”. IEEE Transactions on Information Theory 60, 1203–1222 (2014).
  53. “Depolarizing channel mismatch and estimation protocols for quantum turbo codes”. Entropy 21, 1133 (2019).
  54. “Degeneracy and its impact on the decoding of sparse quantum codes”. IEEE Access 9, 89093–89119 (2021).
  55. “Hardness of decoding quantum stabilizer codes”. IEEE Transactions on Information Theory 61, 5209–5223 (2015).
  56. Barbara M. Terhal. “Quantum error correction for quantum memories”. Rev. Mod. Phys. 87, 307–346 (2015).
  57. “Sparse Blossom: correcting a million errors per core second with minimum-weight matching” (2023). arXiv:2303.15933.
  58. “Correcting coherent errors with surface codes”. npj Quantum Information 4, 55 (2018).
  59. “Topological quantum memory”. Journal of Mathematical Physics 43, 4452–4505 (2002).
  60. “Fault-tolerant quantum computation with high threshold in two dimensions”. Phys. Rev. Lett. 98, 190504 (2007).
  61. “High-threshold universal quantum computation on the surface code”. Phys. Rev. A 80, 052312 (2009).
  62. H. Bombin and M. A. Martin-Delgado. “Optimal resources for topological two-dimensional stabilizer codes: Comparative study”. Phys. Rev. A 76, 012305 (2007).
  63. “Realizing repeated quantum error correction in a distance-three surface code”. Nature 605, 669–674 (2022).
  64. “Suppressing quantum errors by scaling a surface code logical qubit”. Nature 614, 676–681 (2023).
  65. Benjamin Schumacher. “Quantum coding”. Phys. Rev. A 51, 2738–2747 (1995).
  66. “Can quantum-mechanical description of physical reality be considered complete?”. Phys. Rev. 47, 777–780 (1935).
  67. “Quantum-channel capacity of very noisy channels”. Phys. Rev. A 57, 830–839 (1998).
  68. “Quantum communication with zero-capacity channels”. Science 321, 1812–1815 (2008).
  69. M. B. Hastings. “Superadditivity of communication capacity using entangled inputs”. Nature Physics 5, 255–257 (2009).
  70. “Superadditivity effects of quantum capacity decrease with the dimension for qudit depolarizing channels”. Phys. Rev. A 108, 032602 (2023).
  71. “Catalytic quantum error correction”. IEEE Transactions on Information Theory 60, 3073–3089 (2014).
  72. “Zero noise extrapolation on logical qubits by scaling the error correction code distance” (2023). arXiv:2304.14985.
  73. “Error mitigation extends the computational reach of a noisy quantum processor”. Nature 567, 491–495 (2019).
  74. “Probabilistic error cancellation with sparse pauli–lindblad models on noisy quantum processors”. Nature Physics (2023).
  75. “Evidence for the utility of quantum computing before fault tolerance”. Nature 618, 500–505 (2023).
  76. “Quantum Error Mitigation” (2022). arXiv:2210.00921.
  77. “Correcting quantum errors with entanglement”. Science 314, 436–439 (2006).
  78. Josu Etxezarreta Martinez. “Decoherence and quantum error correction for quantum computing and communications”. Phd thesis. Tecnun - Universidad de Navarra. Donostia, Spain (2022).
  79. “Theory of quantum error-correcting codes”. Phys. Rev. A 55, 900–911 (1997).
  80. “Np-hardness of decoding quantum error-correction codes”. Phys. Rev. A 83, 052331 (2011).
  81. “On the hardness of decoding quantum stabilizer codes under the depolarizing channel”. In 2012 International Symposium on Information Theory and its Applications. Pages 208–211.  (2012).
  82. “On the hardnesses of several quantum decoding problems”. Quantum Information Processing 19, 123 (2020).
  83. “Surface code quantum computing by lattice surgery”. New Journal of Physics 14, 123011 (2012).
  84. “Quantum codes on a lattice with boundary” (1998). arXiv:quant-ph/9811052.
  85. “Good quantum error-correcting codes exist”. Phys. Rev. A 54, 1098–1105 (1996).
  86. Andrew Steane. “Multiple-particle interference and quantum error correction”. Proceedings: Mathematical, Physical and Engineering Sciences 452, 2551–2577 (1996).
  87. “Improved decoding of circuit noise and fragile boundaries of tailored surface codes”. Phys. Rev. X 13, 031007 (2023).
  88. “Performance enhancement of surface codes via recursive minimum-weight perfect-match decoding”. Phys. Rev. A 108, 022401 (2023).
  89. “Thresholds of surface codes on the general lattice structures suffering biased error and loss”. AIP Conference Proceedings 1633, 198–200 (2014).
  90. “Fault-tolerant quantum computation with constant error rate”. SIAM Journal on Computing 38, 1207–1282 (2008).
  91. “Resilient quantum computation”. Science 279, 342–345 (1998).
  92. Steffen Schlör. “Intrinsic decoherence in superconducting quantum circuits”. Phd thesis. Karlsruher Institut für Technologie. Karlsruhe, Germany (2019).
  93. “Open quantum systems - an introduction”. Springer Berlin, Heidelberg. DE (2011). 1 edition.
  94. “Decoherence and decay of motional quantum states of a trapped atom coupled to engineered reservoirs”. Phys. Rev. A 62, 053807 (2000).
  95. “Completely positive dynamical semigroups of N-level systems”. Journal of Mathematical Physics 17, 821–825 (1976).
  96. G. Lindblad. “On the generators of quantum dynamical semigroups”. Communications in Mathematical Physics 48, 119–130 (1976).
  97. Man-Duen Choi. “Completely positive linear maps on complex matrices”. Linear Algebra and its Applications 10, 285–290 (1975).
  98. “Information-theoretic aspects of the generalized amplitude-damping channel”. Phys. Rev. A 102, 012401 (2020).
  99. L. Lami and V. Giovannetti. “Entanglement–breaking indices”. Journal of Mathematical Physics56 (2015).
  100. “Asymmetric quantum codes: constructions, bounds and performance”. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 465, 1645–1672 (2009).
  101. “Symmetrized characterization of noisy quantum processes”. Science 317, 1893–1896 (2007).
  102. “Scalable protocol for identification of correctable codes”. Phys. Rev. A 78, 012347 (2008).
  103. D Gottesman. “The heisenberg representation of quantum computers”. Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics (1998).
  104. “Performance of surface codes in realistic quantum hardware”. Phys. Rev. A 106, 062428 (2022).
  105. “Learning correlated noise in a 39-qubit quantum processor” (2023). arXiv:2303.00780.
  106. “Correcting non-independent and non-identically distributed errors with surface codes” (2022). arXiv:2208.02191.
  107. “Universal quantum computing with twist-free and temporally encoded lattice surgery”. PRX Quantum 3, 010331 (2022).
  108. “Qubit noise deconvolution”. EPJ Quantum Technology 9, 29 (2022).
  109. “Almost-linear time decoding algorithm for topological codes”. Quantum 5, 595 (2021).
  110. “Codes for the quantum erasure channel”. Phys. Rev. A 56, 33–38 (1997).
  111. Francesco Battistel. “Mitigating leakage and noise in superconducting quantum computing”. Phd thesis. TU Delft. Delft, Netherlands (2022).
  112. “Experimental deterministic correction of qubit loss”. Nature 585, 207–210 (2020).
  113. “Understanding the effects of leakage in superconducting quantum-error-detection circuits”. Phys. Rev. A 88, 062329 (2013).
  114. Niels Bohr. “On the constitution of atoms and molecules”. Pages 13–33. Springer International Publishing. Cham (1913).
  115. “Observation of quantum jumps”. Phys. Rev. Lett. 57, 1696–1698 (1986).
  116. “Single quantum deletion error-correcting codes”. In 2020 International Symposium on Information Theory and Its Applications (ISITA). Pages 329–333.  (2020).
  117. Jack Edmonds. “Paths, trees, and flowers”. Canadian Journal of Mathematics 17, 449–467 (1965).
  118. Yue Wu. “Fusion blossom” (2022).
  119. “Fusion Blossom: Fast MWPM Decoders for QEC” (2023). arXiv:2305.08307.
  120. Oscar Higgott. “Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching”. ACM Transactions on Quantum Computing3 (2022).
  121. “Efficient algorithms for maximum likelihood decoding in the surface code”. Phys. Rev. A 90, 032326 (2014).
  122. “Decoding across the quantum low-density parity-check code landscape”. Phys. Rev. Res. 2, 043423 (2020).
  123. “Fast decoders for topological quantum codes”. Phys. Rev. Lett. 104, 050504 (2010).
  124. “Cellular-automaton decoders for topological quantum memories”. npj Quantum Information 1, 15010 (2015).
  125. “Decoding small surface codes with feedforward neural networks”. Quantum Science and Technology 3, 015004 (2017).
  126. “Decoding quantum color codes with MaxSAT” (2023). arXiv:2303.14237.
  127. Austin G. Fowler. “Minimum weight perfect matching of fault-tolerant topological quantum error correction in average o(1) parallel time”. Quantum Info. Comput. 15, 145–158 (2015).
  128. “On the logical error rate of sparse quantum codes”. IEEE Transactions on Quantum Engineering 3, 1–12 (2022).
  129. “Homological product codes”. In Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing. Page 273–282. STOC ’14New York, NY, USA (2014). Association for Computing Machinery.
  130. “An interpretation of Union-Find Decoder on Weighted Graphs” (2022). arXiv:2211.03288.
  131. “Rectangular surface code under biased noise”. Quantum Information Processing 20, 231 (2021).
  132. “Fault-tolerant thresholds for the surface code in excess of 5%percent55\%5 % under biased noise”. Phys. Rev. Lett. 124, 130501 (2020).
  133. “Multiqubit time-varying quantum channels for nisq-era superconducting quantum processors”. Phys. Rev. Res. 5, 033055 (2023).
  134. “A decoding algorithm for css codes using the x/z correlations”. In 2014 IEEE International Symposium on Information Theory. Pages 1071–1075.  (2014).
  135. Austin G. Fowler. “Optimal complexity correction of correlated errors in the surface code” (2013). arXiv:1310.0863.
  136. Craig Gidney. “Stim: a fast stabilizer circuit simulator”. Quantum 5, 497 (2021). arXiv:2103.02202.
  137. “Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel”. Phys. Rev. Res. 2, 033042 (2020).
  138. Robert Endre Tarjan. “Efficiency of a good but not linear set union algorithm”. J. ACM 22, 215–225 (1975).
  139. “Fault-tolerant weighted union-find decoding on the toric code”. Phys. Rev. A 102, 012419 (2020).
  140. “Toward a union-find decoder for quantum ldpc codes”. IEEE Transactions on Information Theory 68, 3187–3199 (2022).
  141. Judea Pearl. “Probabilistic reasoning in intelligent systems”. Morgan Kaufmann. CA, USA (1998). 1 edition.
  142. “Factor graphs and the sum-product algorithm”. IEEE Transactions on Information Theory 47, 498–519 (2001).
  143. Niclas Wiberg. “Codes and decoding on general graphs”. Phd thesis. Linköping University,. Linköping , Sweden (1996).
  144. “On the iterative decoding of sparse quantum codes”. Quantum Info. Comput. 8, 987–1000 (2008).
  145. “On the design of low-density parity-check codes within 0.0045 db of the shannon limit”. IEEE Communications Letters 5, 58–60 (2001).
  146. “Fiber Bundle Codes: Breaking the N1/2⁢polylog⁡(N)superscript𝑁12polylog𝑁N^{1/2}\operatorname{polylog}(N)italic_N start_POSTSUPERSCRIPT 1 / 2 end_POSTSUPERSCRIPT roman_polylog ( italic_N ) Barrier for Quantum LDPC Codes” (2020). arXiv:2009.03921.
  147. “Balanced product quantum codes”. IEEE Transactions on Information Theory 67, 6653–6674 (2021).
  148. A. Leverrier and G. Zemor. “Quantum tanner codes”. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). Pages 872–883. Los Alamitos, CA, USA (2022). IEEE Computer Society.
  149. “Degenerate quantum codes for pauli channels”. Phys. Rev. Lett. 98, 030501 (2007).
  150. “Trapping Sets of Quantum LDPC Codes”. Quantum 5, 562 (2021).
  151. Nithin Raveendran. “Trapping sets of iterative decoders for quantum and classical low-density parity check codes”. Phd thesis. The University of Arizona. Arizona, USA (2021).
  152. “Soft-decision decoding of linear block codes based on ordered statistics”. IEEE Transactions on Information Theory 41, 1379–1396 (1995).
  153. M.P.C. Fossorier. “Iterative reliability-based decoding of low-density parity check codes”. IEEE Journal on Selected Areas in Communications 19, 908–917 (2001).
  154. “Bias-tailored quantum LDPC codes”. Quantum 7, 1005 (2023).
  155. “Matrix computations”. John Hopkins University Press. EN (2013). 4 edition.
  156. “Syndrome-based min-sum vs osd-0 decoders: Fpga implementation and analysis for quantum ldpc codes”. IEEE Access 9, 138734–138743 (2021).
  157. “Stabilizer inactivation for message-passing decoding of quantum ldpc codes”. In 2022 IEEE Information Theory Workshop (ITW). Pages 488–493.  (2022).
  158. “Multi-path Summation for Decoding 2D Topological Codes”. Quantum 2, 102 (2018).
  159. “Soft syndrome decoding of quantum ldpc codes for joint correction of data and syndrome errors”. In 2022 IEEE International Conference on Quantum Computing and Engineering (QCE). Pages 275–281.  (2022).
  160. “Improved quantum error correction using soft information” (2021). arXiv:2107.13589.
  161. “Improved single-shot decoding of higher-dimensional hypergraph-product codes”. PRX Quantum 4, 020332 (2023).
  162. Héctor Bombín. “Single-shot fault-tolerant quantum error correction”. Phys. Rev. X 5, 031043 (2015).
  163. “Single-shot decoding of linear rate ldpc quantum codes with high performance”. IEEE Transactions on Information Theory 68, 272–286 (2022).
  164. “Single-shot decoding of good quantum LDPC codes” (2023). arXiv:2306.12470.
  165. “Constant overhead quantum fault tolerance with quantum expander codes”. Commun. ACM 64, 106–114 (2020).
  166. R. Orús. “A practical introduction to tensor networks: Matrix product states and projected entangled pair states”. Annals of Physics 349, 117–158 (2014).
  167. “Tensor networks and quantum error correction”. Phys. Rev. Lett. 113, 030501 (2014).
  168. G. Evenbly and G. Vidal. “Class of highly entangled many-body states that can be efficiently simulated”. Phys. Rev. Lett. 112, 240502 (2014).
  169. G. Vidal. “Entanglement renormalization”. Phys. Rev. Lett. 99, 220405 (2007).
  170. “Tailoring surface codes for highly biased noise”. Phys. Rev. X 9, 041031 (2019).
  171. Christopher T. Chubb. “General tensor network decoding of 2d pauli codes” (2021). arXiv:2101.04125.
  172. “Matrix product states and projected entangled pair states: Concepts, symmetries, theorems”. Rev. Mod. Phys. 93, 045003 (2021).
  173. “String-net condensation: A physical mechanism for topological phases”. Phys. Rev. B 71, 045110 (2005).
  174. R. Orús and G. Vidal. “Infinite time-evolving block decimation algorithm beyond unitary evolution”. Phys. Rev. B 78, 155117 (2008).
  175. “Simulation of two-dimensional quantum systems on an infinite lattice revisited: Corner transfer matrix for tensor contraction”. Phys. Rev. B 80, 094403 (2009).
  176. “Classical simulation of infinite-size quantum lattice systems in two spatial dimensions”. Phys. Rev. Lett. 101, 250602 (2008).
  177. F. Verstraete and J. I. Cirac. “Renormalization algorithms for quantum-many body systems in two and higher dimensions” (2004). arXiv:cond-mat/0407066.
  178. “Variational study of hard-core bosons in a two-dimensional optical lattice using projected entangled pair states”. Physical Review A75 (2007).
  179. Ulrich Schollwöck. “The density-matrix renormalization group in the age of matrix product states”. Annals of Physics 326, 96–192 (2011).
  180. David K. Tuckett. “Tailoring surface codes: Improvements in quantum error correction with biased noise (qecsim)” (2020).
  181. “Computational complexity of projected entangled pair states”. Phys. Rev. Lett. 98, 140506 (2007).
  182. Benjamin Villalonga. “Maximum likelihood decoders of stabilizer codes under device noise using tensor networks”. APS March Meeting (2022).
  183. James W. Harrington. “Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes”. Phd thesis. California Institute of Technology. Pasadena, CA (2004).
  184. Aleksander M. Kubica. “The abcs of the color code: A study of topological quantum codes as toy models for fault-tolerant quantum computation and quantum phases of matter”. Phd thesis. California Institute of Technology. Pasadena, CA (2018).
  185. “Cellular-automaton decoders with provable thresholds for topological codes”. Phys. Rev. Lett. 123, 020501 (2019).
  186. “Cellular automaton decoders for topological quantum codes with noisy measurements and beyond”. Scientific Reports 11, 2027 (2021).
  187. “Efficient color code decoders in d≥2𝑑2d\geq 2italic_d ≥ 2 dimensions from toric code decoders”. Quantum 7, 929 (2023).
  188. “Confinement-higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory”. Annals of Physics 303, 31–58 (2003).
  189. “Efficient decoding of topological color codes”. Phys. Rev. A 85, 022317 (2012).
  190. “Quantum self-correction in the 3d cubic code model”. Phys. Rev. Lett. 111, 200501 (2013).
  191. “Fast fault-tolerant decoder for qubit and qudit surface codes”. Phys. Rev. A 92, 032309 (2015).
  192. James Wootton. “A simple decoder for topological codes”. Entropy 17, 1946–1957 (2015).
  193. “Fast decoders for qudit topological codes”. New Journal of Physics 16, 063038 (2014).
  194. “Improved hdrg decoders for qudit and non-abelian quantum error correction”. New Journal of Physics 17, 035017 (2015).
  195. “Renormalization group decoder for a four-dimensional toric code”. IEEE Transactions on Information Theory 65, 2545–2562 (2019).
  196. “Overfeat: Integrated recognition, localization and detection using convolutional networks”. In 2nd International Conference on Learning Representations, ICLR 2014.  (2014).
  197. “Deep neural decoders for near term fault-tolerant experiments”. Quantum Science and Technology 3, 044002 (2018).
  198. “Comparing neural network based decoders for the surface code”. IEEE Transactions on Computers 69, 300–311 (2020).
  199. “Reinforcement learning decoders for fault-tolerant quantum computation”. Machine Learning: Science and Technology 2, 025005 (2020).
  200. “Decoding surface code with a distributed neural network–based decoder”. Quantum Machine Intelligence 2, 3 (2020).
  201. “Neural network decoder for near-term surface-code experiments” (2023). arXiv:2307.03280.
  202. “Data-driven decoding of quantum error correcting codes using graph neural networks” (2023). arXiv:2307.01241.
  203. “Neural decoder for topological codes”. Phys. Rev. Lett. 119, 030501 (2017).
  204. “Deep neural network probabilistic decoder for stabilizer codes”. Scientific Reports 7, 11003 (2017).
  205. “Neural belief-propagation decoders for quantum error-correcting codes”. Phys. Rev. Lett. 122, 200501 (2019).
  206. “Quantum error correction for the toric code using deep reinforcement learning”. Quantum 3, 183 (2019).
  207. “Symmetries for a high-level neural decoder on the toric code”. Phys. Rev. A 102, 042411 (2020).
  208. “Deep q-learning decoder for depolarizing noise on the toric code”. Phys. Rev. Res. 2, 023230 (2020).
  209. “Reinforcement learning for optimal error correction of toric codes”. Physics Letters A 384, 126353 (2020).
  210. Xiaotong Ni. “Neural Network Decoders for Large-Distance 2D Toric Codes”. Quantum 4, 310 (2020).
  211. “Scalable neural decoder for topological surface codes”. Phys. Rev. Lett. 128, 080505 (2022).
  212. “Neural network decoder for topological color codes with circuit level noise”. New Journal of Physics 21, 013003 (2019).
  213. S. Varona and M. A. Martin-Delgado. “Determination of the semion code threshold using neural decoders”. Phys. Rev. A 102, 032411 (2020).
  214. “Techniques for combining fast local decoders with global decoders under circuit-level noise”. Quantum Science and Technology 8, 045011 (2023).
  215. Mark W. Krentel. “The complexity of optimization problems”. Journal of Computer and System Sciences 36, 490–509 (1988).
  216. “Plaquette: an all-encompassing fault-tolerance software package” (2023).
  217. Mark S. Hu. “Qsurface” (2020).
  218. Joschka Roffe. “Bp+osd: A decoder for quantum ldpc codes” (2022).
  219. Cristopher T. Chubb. “Sweepcontractor.jl” (2022).
  220. Michael Vasmer. “Sweep-decoder-boundaries” (2021).
  221. Jacob Marks. “Qtop” (2017).
  222. Stefan Krastanov. “Neural network decoders for quantum error correcting codes” (2017).
  223. Ronagh Pooya. “Deep neural decoders for fault-tolerant quantum error correction” (2018).
  224. Paul Baireuther. “neural_network_decoder” (2018).
  225. “Qecc: An mqt tool for quantum error correcting codes written in c++” (2023).
  226. “Software tools for decoding quantum low-density parity-check codes”. In Proceedings of the 28th Asia and South Pacific Design Automation Conference. Page 709–714. ASPDAC ’23New York, NY, USA (2023). Association for Computing Machinery.
  227. “Parallel window decoding enables scalable fault tolerant quantum computation”. Nature Communications 14, 7040 (2023).
  228. “Scalable surface-code decoders with parallelization in time”. PRX Quantum 4, 040344 (2023).
  229. “Fault-tolerant computing with biased-noise superconducting qubits: a case study”. New Journal of Physics 11, 013061 (2009).
  230. J. Tolar. “On Clifford groups in quantum computing”. In Journal of Physics Conference Series. Volume 1071 of Journal of Physics Conference Series, page 012022.  (2018). arXiv:1810.10259.
  231. “Tailored xzzx codes for biased noise”. Phys. Rev. Res. 5, 013035 (2023).
  232. C.Ch. Yuan, Y. & Lu. “A Modified MWPM Decoding Algorithm for Quantum Surface Codes Over Depolarizing Channels” (2022). arXiv:2202.11239.
  233. “Fundamentals of wireless communication”. Cambridge University Press. USA (2005).
  234. “Quantum turbo decoding for quantum channels exhibiting memory”. IEEE Access 6, 12369–12381 (2018).
  235. “Pauli channels can be estimated from syndrome measurements in quantum error correction”. Quantum 6, 809 (2022).
  236. “Adaptive weight estimator for quantum error correction in a time-dependent environment (adv. quantum technol. 1/2018)”. Advanced Quantum Technologies 1, 1870015 (2018).
  237. A. Yu Kitaev. “Quantum computations: algorithms and error correction”. Russian Mathematical Surveys 52, 1191–1249 (1997).
  238. “High-threshold and low-overhead fault-tolerant quantum memory” (2023). arXiv:2308.07915.
  239. M. Jeruchim. “Techniques for estimating the bit error rate in the simulation of digital communication systems”. IEEE Journal on Selected Areas in Communications 2, 153–170 (1984).
Citations (57)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Tweets

Sign up for free to view the 2 tweets with 4 likes about this paper.

Sign Up for Free