Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Deep Quantum Error Correction (2301.11930v2)

Published 27 Jan 2023 in quant-ph, cs.AI, cs.ET, cs.IT, and math.IT

Abstract: Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. QECC, as its classical counterpart (ECC), enables the reduction of error rates, by distributing quantum logical information across redundant physical qubits, such that errors can be detected and corrected. In this work, we efficiently train novel {\emph{end-to-end}} deep quantum error decoders. We resolve the quantum measurement collapse by augmenting syndrome decoding to predict an initial estimate of the system noise, which is then refined iteratively through a deep neural network. The logical error rates calculated over finite fields are directly optimized via a differentiable objective, enabling efficient decoding under the constraints imposed by the code. Finally, our architecture is extended to support faulty syndrome measurement, by efficient decoding of repeated syndrome sampling. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy, outperforming {for small distance topological codes,} the existing {end-to-end }neural and classical decoders, which are often computationally prohibitive.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (72)
  1. Fault-tolerant quantum computation with constant error. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, 176–188.
  2. Quantum error correction for the toric code using deep reinforcement learning. Quantum, 3: 183.
  3. High-fidelity quantum logic gates using trapped-ion hyperfine qubits. Physical review letters, 117(6): 060504.
  4. Estimating or propagating gradients through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432.
  5. Deep learning for decoding of linear codes-a syndrome-based approach. In 2018 IEEE International Symposium on Information Theory (ISIT), 1595–1599. IEEE.
  6. Strong resilience of topological codes to depolarization. Physical Review X, 2(2): 021004.
  7. Combinatorial mathematics and its applications: proceedings of the conference held at the University of North Carolina at Chapel Hill, April 10-14, 1967. 4. University of North Carolina Press.
  8. Correcting coherent errors with surface codes. npj Quantum Information, 4(1): 1–6.
  9. Quantum codes on a lattice with boundary. arXiv preprint quant-ph/9811052.
  10. Language models are few-shot learners. Advances in neural information processing systems, 33: 1877–1901.
  11. Brun, T. A. 2020. Quantum Error Correction.
  12. Learned Decimation for Neural Belief Propagation Decoders. arXiv preprint arXiv:2011.02161.
  13. Good quantum error-correcting codes exist. Physical Review A, 54(2): 1098.
  14. Scaling deep learning-based decoding of polar codes via partitioning. In GLOBECOM 2017-2017 IEEE Global Communications Conference, 1–6. IEEE.
  15. Deep neural decoders for near term fault-tolerant experiments. Quantum Science and Technology, 3(4): 044002.
  16. Error Correction Code Transformer. Advances in Neural Information Processing Systems (NeurIPS).
  17. Denoising Diffusion Error Correction Codes. International Conference on Learning Representations (ICLR).
  18. Experimental quantum error correction. Physical Review Letters, 81(10): 2152.
  19. Almost-linear time decoding algorithm for topological codes. Quantum, 5: 595.
  20. Topological quantum memory. Journal of Mathematical Physics, 43(9): 4452–4505.
  21. Fast decoders for topological quantum codes. Physical review letters, 104(5): 050504.
  22. Fault-tolerant renormalization group decoder for abelian topological codes. arXiv preprint arXiv:1304.6100.
  23. Edmonds, J. 1965. Paths, trees, and flowers. Canadian Journal of mathematics, 17: 449–467.
  24. Fowler, A. G. 2013. Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O⁢(1)𝑂1O(1)italic_O ( 1 ) parallel time. arXiv preprint arXiv:1307.1740.
  25. Towards practical classical processing for the surface code. Physical review letters, 108(18): 180501.
  26. Demonstrating a continuous set of two-qubit gates for near-term quantum algorithms. Physical Review Letters, 125(12): 120504.
  27. Gidney, C. 2021. Stim: a fast stabilizer circuit simulator. Quantum, 5: 497.
  28. Gottesman, D. 1997. Stabilizer codes and quantum error correction. California Institute of Technology.
  29. Going beyond Bell’s theorem. In Bell’s theorem, quantum theory and conceptions of the universe, 69–72. Springer.
  30. On deep learning-based channel decoding. In 2017 51st Annual Conference on Information Sciences and Systems (CISS), 1–6. IEEE.
  31. Higgott, O. 2022. PyMatching: A Python package for decoding quantum codes with minimum-weight perfect matching. ACM Transactions on Quantum Computing, 3(3): 1–16.
  32. PyMatching v2. https://github.com/oscarhiggott/PyMatching.
  33. Fault-tolerant weighted union-find decoding on the toric code. Physical Review A, 102(1): 012419.
  34. Fidelity benchmarks for two-qubit gates in silicon. Nature, 569(7757): 532–536.
  35. Efficient Markov chain Monte Carlo algorithm for the surface code. Physical Review A, 89(2): 022326.
  36. Communication algorithms via deep learning. In Sixth International Conference on Learning Representations (ICLR).
  37. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980.
  38. Kitaev, A. Y. 1997a. Quantum computations: algorithms and error correction. Russian Mathematical Surveys, 52(6): 1191.
  39. Kitaev, A. Y. 1997b. Quantum computations: algorithms and error correction. Russian Mathematical Surveys, 52(6): 1191.
  40. Kitaev, A. Y. 1997c. Quantum error correction with imperfect gates. In Quantum communication, computing, and measurement, 181–188. Springer.
  41. Kitaev, A. Y. 2003. Fault-tolerant quantum computation by anyons. Annals of Physics, 303(1): 2–30.
  42. Kolmogorov, V. 2009. Blossom V: a new implementation of a minimum cost perfect matching algorithm. Mathematical Programming Computation, 1(1): 43–67.
  43. Deep neural network probabilistic decoder for stabilizer codes. Scientific reports, 7(1): 1–7.
  44. On the hardnesses of several quantum decoding problems. Quantum Information Processing, 19(4): 1–17.
  45. Quantum error correction. Cambridge university press.
  46. A survey of transformers. arXiv preprint arXiv:2106.04554.
  47. Neural offset min-sum decoding. In 2017 IEEE International Symposium on Information Theory (ISIT), 1361–1365. IEEE.
  48. MacKay, D. J. 2003. Information theory, inference and learning algorithms. Cambridge university press.
  49. Scalable neural decoder for topological surface codes. Physical Review Letters, 128(8): 080505.
  50. An O (v— v— c— E—) algoithm for finding maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 17–27. IEEE.
  51. Learning to decode linear codes using deep learning. In 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 341–346. IEEE.
  52. Hyper-graph-network decoders for block codes. In Advances in Neural Information Processing Systems, 2326–2336.
  53. Mathematical foundations of quantum mechanics. Princeton university press.
  54. Quantum computation and quantum information.
  55. Open-source C++ implementation of the Union-Find decoder, https://github.com/chaeyeunpark/UnionFind. Physical Review Letters, 128(8): 080505.
  56. Pearl, J. 1988. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan kaufmann.
  57. Preskill, J. 1998. Reliable quantum computers. Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454(1969): 385–410.
  58. Quantum computing: dream or nightmare. DARK MATTER IN COSMOLOGY QUANTUM MEASUREMENTS EXPERIMENTAL GRA VITA Tl ON, 341.
  59. Experimental repetitive quantum error correction. Science, 332(6033): 1059–1061.
  60. Shannon, C. E. 1948. A mathematical theory of communication. The Bell system technical journal, 27(3): 379–423.
  61. Shor, P. W. 1995. Scheme for reducing decoherence in quantum computer memory. Physical review A, 52(4): R2493.
  62. Reinforcement learning decoders for fault-tolerant quantum computation. Machine Learning: Science and Technology, 2(2): 025005.
  63. Neural decoder for topological codes. Physical review letters, 119(3): 030501.
  64. Determination of the semion code threshold using neural decoders. Physical Review A, 102(3): 032411.
  65. Decoding small surface codes with feedforward neural networks. Quantum Science and Technology, 3(1): 015004.
  66. Attention is all you need. In Advances in neural information processing systems, 5998–6008.
  67. Symmetries for a high-level neural decoder on the toric code. Physical Review A, 102(4): 042411.
  68. Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory. Annals of Physics, 303(1): 31–58.
  69. Linformer: Self-attention with linear complexity. arXiv preprint arXiv:2006.04768.
  70. A single quantum cannot be cloned. Nature, 299(5886): 802–803.
  71. High threshold error correction for the surface code. Physical review letters, 109(16): 160503.
  72. Xiong, R.; et al. 2020. On layer normalization in the transformer architecture. arXiv:2002.04745.
Citations (8)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now