Simulation of classical thermal states on a quantum computer: A transfer-matrix approach
- 30 December 2010
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 82 (6)
Abstract
We present a hybrid quantum-classical algorithm to simulate thermal states of classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one at a time. We identified a class of classical models for which our method is efficient and avoids potential exponential overheads encountered by Grover-like or quantum Metropolis schemes. Our algorithm also gives an exponential advantage for two-dimensional Ising models with magnetic field on a square lattice, compared with the previously known Zalka's algorithm.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Quantum SimulatorsScience, 2009
- Quantum algorithm for approximating partition functionsPhysical Review A, 2009
- Information, Physics, and Computation2009
- Speedup via quantum samplingPhysical Review A, 2008
- Quantum Simulations of Classical Annealing ProcessesPhysical Review Letters, 2008
- Quantum speedup of classical mixing processesPhysical Review A, 2007
- Efficient Classical Simulation of Slightly Entangled Quantum ComputationsPhysical Review Letters, 2003
- Simulating quantum systems on a quantum computerProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Simulating Ising spin glasses on a quantum computerPhysical Review E, 1997
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982