Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Quantum Monte Carlo methods and stabilizer states

Bhilahari Jeevanesan*

  • *Contact author: billa.j@gmail.com

Phys. Rev. A 112, 012603 – Published 2 July, 2025

DOI: https://doi.org/10.1103/8jmy-sj3f

Abstract

The quantum Monte Carlo technique known as the stochastic series expansion (SSE) relies on a crucial no-branching condition: the SSE sampling is carried out in the computational basis, and the no-branching assumption ensures that superpositions of basis states do not appear when operators are applied. Without this proviso, the number of complex amplitudes would grow exponentially with the number of qubits and would eventually overwhelm the memory and processing power of a classical computer. However, the action of Clifford group elements on stabilizer states can be very efficiently described without resorting to an amplitude description. We explore how stabilizer states allow an extension of the SSE technique, and we give an example of a toy model that can be studied in this way. The method is also illustrated using the transverse-field Ising model.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (45)

  1. J. E. Hirsch, R. L. Sugar, D. J. Scalapino, and R. Blankenbecler, Monte Carlo simulations of one-dimensional fermion systems, Phys. Rev. B 26, 5033 (1982).
  2. B. B. Beard and U.-J. Wiese, Simulations of discrete quantum systems in continuous euclidean time, Phys. Rev. Lett. 77, 5130 (1996).
  3. N. V. Prokof'ev, B. V. Svistunov, and I. S. Tupitsyn, Exact, complete, and universal continuous-time worldline Monte Carlo approach to the statistics of discrete quantum systems, J. Expt. Theor. Phys. 87, 310 (1998).
  4. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of state calculations by fast computing machines, J. Chem. Phys. 21, 1087 (1953).
  5. Z.-X. Li and H. Yao, Sign-problem-free fermionic quantum Monte Carlo: Developments and applications, Annu. Rev. Condens. Matter Phys. 10, 337 (2019).
  6. P. Henelius and A. W. Sandvik, Sign problem in Monte Carlo simulations of frustrated quantum spin systems, Phys. Rev. B 62, 1102 (2000).
  7. S. Lloyd, Universal quantum simulators, Science 273, 1073 (1996).
  8. R. P. Feynman, Simulating physics with computers, in Feynman and Computation (CRC Press, Boca Raton, FL, 2018), pp. 133–153.
  9. A. W. Sandvik, Computational studies of quantum spin systems, in AIP Conference Proceedings (American Institute of Physics, Melville, New York, 2010), Vol. 1297, pp. 135–338.
  10. A. W. Sandvik and J. Kurkijärvi, Quantum Monte Carlo simulation method for spin systems, Phys. Rev. B 43, 5950 (1991).
  11. A. W. Sandvik, Stochastic series expansion method with operator-loop update, Phys. Rev. B 59, R14157 (1999).
  12. R. K. Kaul, R. G. Melko, and A. W. Sandvik, Bridging lattice-scale physics and continuum field theory with quantum Monte Carlo simulations, Annu. Rev. Condens. Matter Phys. 4, 179 (2013).
  13. R. H. Swendsen and J.-S. Wang, Nonuniversal critical dynamics in Monte Carlo simulations, Phys. Rev. Lett. 58, 86 (1987).
  14. A. W. Sandvik, Stochastic series expansion method for quantum Ising models with arbitrary interactions, Phys. Rev. E 68, 056701 (2003).
  15. O. F. Syljuåsen and A. W. Sandvik, Quantum Monte Carlo with directed loops, Phys. Rev. E 66, 046701 (2002).
  16. K. C. Tan, D. Bhowmick, and P. Sengupta, Sign-problem free quantum stochastic series expansion algorithm on a quantum computer, npj Quantum Inf. 8, 44 (2022).
  17. T. Jiang, J. Zhang, M. K. A. Baumgarten, M.-F. Chen, H. Q. Dinh, A. Ganeshram, N. Maskara, A. Ni, and J. Lee, Walking through Hilbert space with quantum computers, arXiv:2407.11672.
  18. P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A 52, R2493 (1995).
  19. A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098 (1996).
  20. A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77, 793 (1996).
  21. D. Gottesman, Stabilizer Codes and Quantum Error Correction (California Institute of Technology, Pasadena California, 1997).
  22. D. Fattal, T. S. Cubitt, Y. Yamamoto, S. Bravyi, and I. L. Chuang, Entanglement in the stabilizer formalism, arXiv:quant-ph/0406168.
  23. B. Jeevanesan, SSE stabilizer Monte Carlo, 2025, https://github.com/BillyJay/SSE-Stabilizer-Monte-Carlo.
  24. D. C. Handscomb, A Monte Carlo method applied to the Heisenberg ferromagnet, in Mathematical Proceedings of the Cambridge Philosophical Society (Cambridge University Press, Cambridge, 1964), Vol. 60, pp. 115–122.
  25. D. C. Handscomb, The Monte Carlo method in quantum statistical mechanics, in Mathematical Proceedings of the Cambridge Philosophical Society (Cambridge University Press, Cambridge, 1962), Vol. 58, pp. 594–598.
  26. M. Suzuki, Relationship between d-dimensional quantal spin systems and (d+1)-dimensional Ising systems: Equivalence, critical exponents and systematic approximants of the partition function and spin correlations, Prog. Theor. Phys. 56, 1454 (1976).
  27. P. Diaconis, The Markov chain Monte Carlo revolution, Bull. Am. Math. Soc. 46, 179 (2009).
  28. D. Gottesman, The Heisenberg representation of quantum computers, arXiv:quant-ph/9807006.
  29. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2010).
  30. S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70, 052328 (2004).
  31. D. Gottesman, Theory of fault-tolerant quantum computation, Phys. Rev. A 57, 127 (1998).
  32. I. Lesanovsky and H. Katsura, Interacting Fibonacci anyons in a Rydberg gas, Phys. Rev. A 86, 041601 (2012).
  33. H. Bernien, S. Schwartz, A. Keesling, H. Levine, A. Omran, H. Pichler, S. Choi, A. S. Zibrov, M. Endres, M. Greiner et al., Probing many-body dynamics on a 51-atom quantum simulator, Nature (London) 551, 579 (2017).
  34. M. Serbyn, D. A. Abanin, and Z. Papić, Quantum many-body scars and weak breaking of ergodicity, Nat. Phys. 17, 675 (2021).
  35. A. Yu. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303, 2 (2003).
  36. S. Anders and H. J. Briegel, Fast simulation of stabilizer circuits using a graph-state representation, Phys. Rev. A 73, 022334 (2006).
  37. M. Creutz, Quarks, Gluons and Lattices (Cambridge University Press, Cambridge, 1983).
  38. U.-J. Wiese, Ultracold quantum gases and lattice systems: Quantum simulation of lattice gauge theories, Ann. Phys. 525, 777 (2013).
  39. C. W. Bauer, Z. Davoudi, A. B. Balantekin, T. Bhattacharya, M. Carena, W. A. De Jong, P. Draper, A. El-Khadra, N. Gemelke, M. Hanada et al., Quantum simulation for high-energy physics, PRX Quantum 4, 027001 (2023).
  40. M. Aidelsburger, L. Barbiero, A. Bermudez, T. Chanda, A. Dauphin, D. González-Cuadra, P. R. Grzybowski, S. Hands, F. Jendrzejewski, J. Jünemann et al., Cold atoms meet lattice gauge theory, Phil. Trans. R. Soc. A 380, 20210064 (2022).
  41. M. C. Banuls, R. Blatt, J. Catani, A. Celi, J. I. Cirac, M. Dalmonte, L. Fallani, K. Jansen, M. Lewenstein, S. Montangero et al., Simulating lattice gauge theories within quantum technologies, Eur. Phys. J. D 74, 165 (2020).
  42. X. Chen, Z.-X. Liu, and X.-G. Wen, Two-dimensional symmetry-protected topological orders and their protected gapless edge excitations, Phys. Rev. B 84, 235141 (2011).
  43. D. T. Stephen and X. Chen, Fusion of one-dimensional gapped phases and their domain walls, Phys. Rev. B 110, 165144 (2024).
  44. C. R. Harris, K. J. Millman, S. J. van der Walt, R. Gommers, P. Virtanen, D. Cournapeau, E. Wieser, J. Taylor, S. Berg, N. J. Smith, R. Kern, M. Picus, S. Hoyer, M. H. van Kerkwijk, M. Brett, A. Haldane, J. F. del Río, M. Wiebe, P. Peterson, P. Gérard-Marchant et al., Array programming with NumPy, Nature (London) 585, 357 (2020).
  45. A. Meurer, C. P. Smith, M. Paprocki, O. Čertík, S. B. Kirpichev, M. Rocklin, A. Kumar, S. Ivanov, J. K. Moore, S. Singh et al., Sympy: Symbolic computing in Python, PeerJ Comput. Sci. 3, e103 (2017).

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation