Abstract
The classical Metropolis sampling method is a cornerstone of many statistical modeling applications that range from physics, chemistry, and biology to economics. This method is particularly suitable for sampling the thermal distributions of classical systems. The challenge of extending this method to the simulation of arbitrary quantum systems is that, in general, eigenstates of quantum Hamiltonians cannot be obtained efficiently with a classical computer. However, this challenge can be overcome by quantum computers. Here, we present a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain. The meaning of quantum generalization is twofold: The proposed algorithm is not only applicable to both classical and quantum systems, but also offers a quantum speedup relative to the classical counterpart. Furthermore, unlike the classical method of quantum Monte Carlo, this quantum algorithm does not suffer from the negative-sign problem associated with fermionic systems. Applications of this algorithm include the study of low-temperature properties of quantum systems, such as the Hubbard model, and preparing the thermal states of sizable molecules to simulate, for example, chemical reactions at an arbitrary temperature.
References
35
Referenced
104
10.1103/RevModPhys.39.883
10.1093/acprof:oso/9780198509417.001.0001
10.1088/1367-2630/13/9/093021
10.1103/RevModPhys.71.1253
- JM Thijssen Computational Physics (Cambridge Univ Press, Cambridge, UK, 1999). / Computational Physics by Thijssen JM (1999)
10.1112/jlms/s2-25.3.564
- M Mezard, G Parisi, MA Virasoro Spin Glass Theory and Beyond (World Scientific, Teaneck, NJ, 1987). / Spin Glass Theory and Beyond by Mezard M (1987)
10.1103/PhysRevLett.94.170201
10.1103/PhysRevLett.85.3547
10.1103/RevModPhys.73.33
10.1007/BF02650179
10.1126/science.1177838
10.1146/annurev-physchem-032210-103512
10.1038/415039a
10.1126/science.273.5278.1073
10.1103/PhysRevE.59.2429
10.1098/rspa.1998.0162
10.1073/pnas.0808245105
10.1103/PhysRevA.64.022319
10.1103/PhysRevLett.102.130503
10.1103/PhysRevLett.103.220502
10.1103/PhysRevLett.105.170405
10.1103/PhysRevA.82.060302
10.1103/PhysRevLett.83.5162
10.1126/science.1113479
10.1039/b804804e
10.1063/1.3503767
10.1080/00268976.2011.552441
10.1038/srep00088
10.1109/FOCS.2004.53
10.1103/PhysRevLett.101.130504
10.1103/PhysRevA.78.042336
10.1103/PhysRevA.61.022301
10.1038/nature09770
10.1038/299802a0
Dates
Type | When |
---|---|
Created | 13 years, 8 months ago (Jan. 4, 2012, 1:38 a.m.) |
Deposited | 3 years, 4 months ago (April 15, 2022, 7:33 a.m.) |
Indexed | 6 days, 15 hours ago (Aug. 30, 2025, 12:51 p.m.) |
Issued | 13 years, 8 months ago (Jan. 3, 2012) |
Published | 13 years, 8 months ago (Jan. 3, 2012) |
Published Online | 13 years, 8 months ago (Jan. 3, 2012) |
Published Print | 13 years, 7 months ago (Jan. 17, 2012) |
@article{Yung_2012, title={A quantum–quantum Metropolis algorithm}, volume={109}, ISSN={1091-6490}, url={http://dx.doi.org/10.1073/pnas.1111758109}, DOI={10.1073/pnas.1111758109}, number={3}, journal={Proceedings of the National Academy of Sciences}, publisher={Proceedings of the National Academy of Sciences}, author={Yung, Man-Hong and Aspuru-Guzik, Alán}, year={2012}, month=jan, pages={754–759} }