Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum memory at nonzero temperature in a thermodynamically trivial system

Published 15 Mar 2024 in quant-ph and cond-mat.stat-mech | (2403.10599v2)

Abstract: Passive error correction protects logical information forever (in the thermodynamic limit) by updating the system based only on local information and few-body interactions. A paradigmatic example is the classical two-dimensional Ising model: a Metropolis-style Gibbs sampler retains the sign of the initial magnetization (a logical bit) for thermodynamically long times in the low-temperature phase. Known models of passive quantum error correction similarly exhibit thermodynamic phase transitions to a low-temperature phase wherein logical qubits are protected by thermally stable topological order. Here, in contrast, we show that certain families of constant-rate classical and quantum low-density parity check codes have no thermodynamic phase transitions at nonzero temperature, but nonetheless exhibit ergodicity-breaking dynamical transitions: below a critical nonzero temperature, the mixing time of local Gibbs sampling diverges in the thermodynamic limit. Slow Gibbs sampling of such codes enables fault-tolerant passive quantum error correction using finite-depth circuits. This strategy is well suited to measurement-free quantum error correction and may present a desirable experimental alternative to conventional quantum error correction based on syndrome measurements and active feedback.

Authors (3)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (89)
  1. Lawrence E. Thomas, “Bound on the mass gap for finite volume stochastic ising models at low temperature,” Communications in Mathematical Physics 126, 1–11 (1989).
  2. Eric Dennis, Alexei Kitaev, Andrew Landahl,  and John Preskill, “Topological quantum memory,” Journal of Mathematical Physics 43, 4452–4505 (2002).
  3. Lars Onsager, “Crystal statistics. i. a two-dimensional model with an order-disorder transition,” Phys. Rev. 65, 117–149 (1944).
  4. R. Alicki, M. Horodecki, P. Horodecki,  and R. Horodecki, “On thermal stability of topological qubit in kitaev’s 4d model,”  (2008), arXiv:0811.0033 [quant-ph] .
  5. Beni Yoshida, “Feasibility of self-correcting quantum memory and thermal stability of topological order,” Annals of Physics 326, 2566–2633 (2011).
  6. Matthew B. Hastings, “Topological order at nonzero temperature,” Physical Review Letters 107 (2011), 10.1103/physrevlett.107.210501.
  7. Benjamin J. Brown, Daniel Loss, Jiannis K. Pachos, Chris N. Self,  and James R. Wootton, “Quantum memories at finite temperature,” Reviews of Modern Physics 88 (2016), 10.1103/revmodphys.88.045005.
  8. Yu-Jie Liu and Simon Lieu, “Dissipative phase transitions and passive error correction,” Phys. Rev. A 109, 022422 (2024).
  9. Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pattison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasic, Mikhail D. Lukin, Liang Jiang,  and Hengyun Zhou, “Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays,”  (2023), arXiv:2308.08648 [quant-ph] .
  10. Yifan Hong, Matteo Marinelli, Adam M. Kaufman,  and Andrew Lucas, “Long-range-enhanced surface codes,”   (2023), arXiv:2309.11719 [quant-ph] .
  11. R. Gallager, “Low-density parity-check codes,” IRE Transactions on Information Theory 8, 21–28 (1962).
  12. Nikolas P. Breuckmann and Jens Niklas Eberhardt, “Quantum low-density parity-check codes,” PRX Quantum 2 (2021), 10.1103/prxquantum.2.040101.
  13. Sergey Bravyi, David Poulin,  and Barbara Terhal, “Tradeoffs for reliable quantum information storage in 2d systems,” Physical Review Letters 104 (2010), 10.1103/physrevlett.104.050503.
  14. Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller,  and Edward Teller, “Equation of State Calculations by Fast Computing Machines,” The Journal of Chemical Physics 21, 1087–1092 (1953), https://pubs.aip.org/aip/jcp/article-pdf/21/6/1087/18802390/1087_1_online.pdf .
  15. W. K. Hastings, “Monte Carlo sampling methods using Markov chains and their applications,” Biometrika 57, 97–109 (1970), https://academic.oup.com/biomet/article-pdf/57/1/97/23940249/57-1-97.pdf .
  16. M. Sipser and D.A. Spielman, “Expander codes,” IEEE Transactions on Information Theory 42, 1710–1722 (1996).
  17. Tom Richardson and Ruediger Urbanke, Modern coding theory (Cambridge University Press, 2008).
  18. M. H. Freedman and M. B. Hastings, “Quantum systems on non-k𝑘kitalic_k-hyperfinite complexes: A generalization of classical statistical mechanics on expander graphs,”  (2013), arXiv:1301.1363 [quant-ph] .
  19. Zack Weinstein, Gerardo Ortiz,  and Zohar Nussinov, “Universality classes of stabilizer code hamiltonians,” Physical Review Letters 123 (2019), 10.1103/physrevlett.123.230503.
  20. Tibor Rakovszky and Vedika Khemani, “The Physics of (good) LDPC Codes I. Gauging and dualities,”   (2023), arXiv:2310.16032 [quant-ph] .
  21. Tibor Rakovszky and Vedika Khemani, “The Physics of (good) LDPC Codes II. Product constructions,”   (2024), arXiv:2402.16831 [quant-ph] .
  22. Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan,  and Michael Viderman, “Locally testable codes require redundant testers,” in 2009 24th Annual IEEE Conference on Computational Complexity (2009) pp. 52–61.
  23. Pavel Panteleev and Gleb Kalachev, “Asymptotically good quantum and locally testable classical ldpc codes,” in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 (Association for Computing Machinery, New York, NY, USA, 2022) p. 375–388.
  24. Ting-Chun Lin and Min-Hsiu Hsieh, “c3superscript𝑐3c^{3}italic_c start_POSTSUPERSCRIPT 3 end_POSTSUPERSCRIPT-locally testable codes from lossless expanders,”  (2022), arXiv:2201.11369 [cs.IT] .
  25. Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky,  and Shahar Mozes, “Good locally testable codes,”  (2022a), arXiv:2207.11929 [cs.IT] .
  26. A. R. Calderbank and Peter W. Shor, “Good quantum error-correcting codes exist,” Physical Review A 54, 1098–1105 (1996).
  27. Andrew Steane, “Multiple-particle interference and quantum error correction,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 452, 2551–2577 (1996).
  28. Anthony Leverrier and Gilles Zémor, “Quantum tanner codes,”  (2022), arXiv:2202.13641 [quant-ph] .
  29. Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin,  and Thomas Vidick, “Good quantum ldpc codes with linear time decoders,”  (2022b), arXiv:2206.07750 [quant-ph] .
  30. Jean-Pierre Tillich and Gilles Zemor, “Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,” IEEE Transactions on Information Theory 60, 1193–1202 (2014).
  31. Anthony Leverrier, Jean-Pierre Tillich,  and Gilles Zémor, “Quantum expander codes,” in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (IEEE, 2015).
  32. R. Peierls, “On ising’s model of ferromagnetism,” Mathematical Proceedings of the Cambridge Philosophical Society 32, 477–481 (1936).
  33. Matthew B. Hastings, Grant H. Watson,  and Roger G. Melko, “Self-correcting quantum memories beyond the percolation threshold,” Phys. Rev. Lett. 112, 070501 (2014).
  34. Jeongwan Haah, “Local stabilizer codes in three dimensions without string logical operators,” Phys. Rev. A 83, 042330 (2011).
  35. Kamil P. Michnicki, “3d topological quantum memory with a power-law energy barrier,” Phys. Rev. Lett. 113, 130501 (2014).
  36. Sergey Bravyi and Jeongwan Haah, “Quantum self-correction in the 3d cubic code model,” Phys. Rev. Lett. 111, 200501 (2013).
  37. Karthik Siva and Beni Yoshida, “Topological order and memory time in marginally-self-correcting quantum memory,” Physical Review A 95 (2017), 10.1103/physreva.95.032324.
  38. Héctor Bombin, “Single-shot fault-tolerant quantum error correction,” Physical Review X 5 (2015), 10.1103/physrevx.5.031043.
  39. Earl T Campbell, “A theory of single-shot error correction for adversarial noise,” Quantum Science and Technology 4, 025006 (2019).
  40. Armanda O. Quintavalle, Michael Vasmer, Joschka Roffe,  and Earl T. Campbell, “Single-shot error correction of three-dimensional homological product codes,” PRX Quantum 2, 020340 (2021).
  41. Omar Fawzi, Antoine Grospellier,  and Anthony Leverrier, “Constant overhead quantum fault-tolerance with quantum expander codes,” in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2018).
  42. Shouzhen Gu, Eugene Tang, Libor Caha, Shin Ho Choe, Zhiyang He,  and Aleksander Kubica, “Single-shot decoding of good quantum LDPC codes,”   (2023), arXiv:2306.12470 [quant-ph] .
  43. Charlene Ahn, Andrew C. Doherty,  and Andrew J. Landahl, “Continuous quantum error correction via quantum feedback control,” Phys. Rev. A 65, 042301 (2002).
  44. Mohan Sarovar and G. J. Milburn, “Continuous quantum error correction by cooling,” Phys. Rev. A 72, 012306 (2005).
  45. W. Forrest Stinespring, “Positive functions on c*-algebras,” Proceedings of the American Mathematical Society 6, 211–216 (1955).
  46. Aaron J. Friedman, Chao Yin, Yifan Hong,  and Andrew Lucas, “Locality and error correction in quantum dynamics with measurement,”   (2022), arXiv:2206.09929 [quant-ph] .
  47. Pablo Sala, Tibor Rakovszky, Ruben Verresen, Michael Knap,  and Frank Pollmann, “Ergodicity breaking arising from hilbert space fragmentation in dipole-conserving hamiltonians,” Phys. Rev. X 10, 011047 (2020).
  48. Vedika Khemani, Michael Hermele,  and Rahul Nandkishore, “Localization from hilbert space shattering: From theory to physical realizations,” Phys. Rev. B 101, 174204 (2020).
  49. Oliver Hart and Rahul Nandkishore, “Hilbert space shattering and dynamical freezing in the quantum ising model,” Physical Review B 106 (2022), 10.1103/physrevb.106.214426.
  50. David T. Stephen, Oliver Hart,  and Rahul M. Nandkishore, “Ergodicity breaking provably robust to arbitrary perturbations,” Physical Review Letters 132 (2024), 10.1103/physrevlett.132.040401.
  51. Charles Stahl, Rahul Nandkishore,  and Oliver Hart, “Topologically stable ergodicity breaking from emergent higher-form symmetries in generalized quantum loop models,”  (2023), arXiv:2304.04792 [cond-mat.stat-mech] .
  52. Yiqiu Han, Xiao Chen,  and Ethan Lake, “Exponentially slow thermalization and the robustness of Hilbert space fragmentation,”   (2024), arXiv:2401.11294 [quant-ph] .
  53. Anurag Anshu, Nikolas P. Breuckmann,  and Chinmay Nirkhe, “Nlts hamiltonians from good quantum codes,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC ’23 (ACM, 2023).
  54. Xie Chen, Zheng-Cheng Gu,  and Xiao-Gang Wen, “Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order,” Phys. Rev. B 82, 155138 (2010).
  55. Shengqi Sang, Yijian Zou,  and Timothy H. Hsieh, “Mixed-state quantum phases: Renormalization and quantum error correction,”  (2023), arXiv:2310.08639 [quant-ph] .
  56. M. Saffman, T. G. Walker,  and K. Mølmer, “Quantum information with Rydberg atoms,” Rev. Mod. Phys. 82, 2313–2363 (2010).
  57. Adam M Kaufman and Kang-Kuen Ni, “Quantum science with optical tweezer arrays of ultracold atoms and molecules,” Nature Physics 17, 1324–1333 (2021).
  58. Iris Cong, Harry Levine, Alexander Keesling, Dolev Bluvstein, Sheng-Tao Wang,  and Mikhail D Lukin, “Hardware-efficient, fault-tolerant quantum computation with rydberg atoms,” Physical Review X 12, 021049 (2022).
  59. Dolev Bluvstein, Harry Levine, Giulia Semeghini, Tout T Wang, Sepehr Ebadi, Marcin Kalinowski, Alexander Keesling, Nishad Maskara, Hannes Pichler, Markus Greiner, et al., “A quantum processor based on coherent transport of entangled atom arrays,” Nature 604, 451–456 (2022).
  60. Alec Jenkins, Joanna W. Lis, Aruku Senoo, William F. McGrew,  and Adam M. Kaufman, “Ytterbium nuclear-spin qubits in an optical tweezer array,” Phys. Rev. X 12, 021027 (2022).
  61. Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim, Sophie H. Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiter, J. Pablo Bonilla Ataides, Nishad Maskara, Iris Cong, Xun Gao, Pedro Sales Rodriguez, Thomas Karolyshyn, Giulia Semeghini, Michael J. Gullans, Markus Greiner, Vladan Vuletić,  and Mikhail D. Lukin, “Logical quantum processor based on reconfigurable atom arrays,” Nature 626, 58–65 (2023).
  62. Joanna W. Lis, Aruku Senoo, William F. McGrew, Felix Rönchen, Alec Jenkins,  and Adam M. Kaufman, “Midcircuit operations using the omg architecture in neutral atom arrays,” Phys. Rev. X 13, 041035 (2023).
  63. M. A. Norcia, W. B. Cairncross, K. Barnes, P. Battaglino, A. Brown, M. O. Brown, K. Cassella, C.-A. Chen, R. Coxe, D. Crow, J. Epstein, C. Griger, A. M. W. Jones, H. Kim, J. M. Kindem, J. King, S. S. Kondov, K. Kotru, J. Lauigan, M. Li, M. Lu, E. Megidish, J. Marjanovic, M. McDonald, T. Mittiga, J. A. Muniz, S. Narayanaswami, C. Nishiguchi, R. Notermans, T. Paule, K. A. Pawlak, L. S. Peng, A. Ryou, A. Smull, D. Stack, M. Stone, A. Sucich, M. Urbanek, R. J. M. van de Veerdonk, Z. Vendeiro, T. Wilkason, T.-Y. Wu, X. Xie, X. Zhang,  and B. J. Bloom, “Midcircuit qubit measurement and rearrangement in a Yb171superscriptYb171{}^{171}\mathrm{Yb}start_FLOATSUPERSCRIPT 171 end_FLOATSUPERSCRIPT roman_Yb atomic array,” Phys. Rev. X 13, 041034 (2023).
  64. William Huie, Lintao Li, Neville Chen, Xiye Hu, Zhubing Jia, Won Kyu Calvin Sun,  and Jacob P. Covey, “Repetitive readout and real-time control of nuclear spin qubits in Yb171superscriptYb171{}^{171}\mathrm{Yb}start_FLOATSUPERSCRIPT 171 end_FLOATSUPERSCRIPT roman_Yb atoms,” PRX Quantum 4, 030337 (2023).
  65. Austin G. Fowler, David S. Wang, Charles D. Hill, Thaddeus D. Ladd, Rodney Van Meter,  and Lloyd C. L. Hollenberg, “Surface code quantum communication,” Physical Review Letters 104 (2010), 10.1103/physrevlett.104.180503.
  66. Koji Azuma, Sophia E. Economou, David Elkouss, Paul Hilaire, Liang Jiang, Hoi-Kwong Lo,  and Ilan Tzitrin, “Quantum repeaters: From quantum networks to the quantum internet,” Reviews of Modern Physics 95 (2023), 10.1103/revmodphys.95.045006.
  67. Nikolas P. Breuckmann, Vedika Khemani, Benedikt Placke,  and Tibor Rakovszky, “Thermodynamics and dynamics of good ldpc codes: Extensive energy barriers and glassiness,”  (to appear).
  68. Michael Capalbo, Omer Reingold, Salil Vadhan,  and Avi Wigderson, “Randomness conductors and constant-degree lossless expanders,” in Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, STOC ’02 (Association for Computing Machinery, New York, NY, USA, 2002) p. 659–668.
  69. H. A. Kramers and G. H. Wannier, “Statistics of the two-dimensional ferromagnet. part i,” Phys. Rev. 60, 252–262 (1941).
  70. D. J. C. Mackay and Radford M. Neal, “Near shannon limit performance of low density parity check codes,” Electronics Letters 33, 457–458 (1996).
  71. F.R. Kschischang, B.J. Frey,  and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Information Theory 47, 498–519 (2001).
  72. Daniel Gottesman, “Stabilizer codes and quantum error correction,”  (1997), arXiv:quant-ph/9705052 [quant-ph] .
  73. Sergey Bravyi and Barbara Terhal, “A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes,” New Journal of Physics 11, 043029 (2009).
  74. Nouédyn Baspin and Anirudh Krishna, “Connectivity constrains quantum codes,” Quantum 6, 711 (2022).
  75. Alexey A. Kovalev and Leonid P. Pryadko, “Fault tolerance of quantum low-density parity check codes with sublinear distance scaling,” Physical Review A 87 (2013), 10.1103/physreva.87.020304.
  76. Pavel Panteleev and Gleb Kalachev, “Degenerate quantum ldpc codes with good finite length performance,” Quantum 5, 585 (2021).
  77. Joschka Roffe, “LDPC: Python tools for low density parity check codes,”  (2022).
  78. Joschka Roffe, David R. White, Simon Burton,  and Earl Campbell, “Decoding across the quantum low-density parity-check code landscape,” Physical Review Research 2 (2020), 10.1103/physrevresearch.2.043423.
  79. Oscar Higgott and Craig Gidney, “Sparse blossom: correcting a million errors per core second with minimum-weight matching,” arXiv preprint arXiv:2303.15933  (2023).
  80. E.B. Davies, “Generators of dynamical semigroups,” Journal of Functional Analysis 34, 421–432 (1979).
  81. J. Guo, O. Hart, C-F. Chen, A. J. Friedman,  and A. Lucas, “Designing open quantum systems with known steady state: Davies generators and beyond,”   (to appear).
  82. Daniel Bundala and Jakub Závodný, “Optimal sorting networks,”  (2013), arXiv:1310.6271 [cs.DM] .
  83. Michael Codish, Luis Cruz-Filipe, Michael Frank,  and Peter Schneider-Kamp, “Twenty-five comparators is optimal when sorting nine inputs (and twenty-nine for ten),” in 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (IEEE, 2014).
  84. Jannis Harder, “An answer to the bose-nelson sorting problem for 11 and 12 channels,”  (2022), arXiv:2012.04400 [cs.DS] .
  85. Xiao-Feng Shi, “Deutsch, toffoli, and cnot gates via rydberg blockade of neutral atoms,” Phys. Rev. Appl. 9, 051001 (2018).
  86. Hong-Da Yin, Xiao-Xuan Li, Gang-Cheng Wang,  and Xiao-Qiang Shao, “One-step implementation of toffoli gate for neutral atoms based on unconventional rydberg pumping,” Optics Express 28, 35576 (2020).
  87. K. E. Batcher, “Sorting networks and their applications,” in Proceedings of the April 30–May 2, 1968, Spring Joint Computer Conference, AFIPS ’68 (Spring) (Association for Computing Machinery, New York, NY, USA, 1968) p. 307–314.
  88. Pedro M. Q. Cruz and Bruno Murta, “Shallow unitary decompositions of quantum fredkin and toffoli gates for connectivity-aware equivalent circuit averaging,” APL Quantum 1 (2024), 10.1063/5.0187026.
  89. Davar Kheirandish, Majid Haghparast, Midia Reshadi,  and Mehdi Hosseinzadeh, “Efficient designs of reversible majority voters,” Journal of Electronic Testing 36, 757 – 770 (2020).
Citations (8)
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

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 2 tweets with 1 like about this paper.

Sign Up for Free