Use of Quantum Sampling to Calculate Mean Values of Observables and Partition Function of a Quantum System
arXiv:0912.4402
Abstract
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with polynomial efficiency, certain diagonal matrix elements of an observable. This sub-algorithm is performed on a quantum computer, using quantum phase estimation and tomography. The second sub-algorithm is for sampling a probability distribution. This sub-algorithm is not polynomially efficient. It can be performed either on a classical or a quantum computer, but a quantum computer can perform it quadratically faster.
V1-12 pages(5 files: 1.tex, 3 .sty, 1 .eps);V2-minor changes;V3-minor changes and extension of scenario(c)
References in corpus (6)
- Quantum algorithm for solving linear systems of equations
- Quantum Metropolis Sampling
- Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
- Code Generator for Quantum Simulated Annealing
- Use of a Quantum Computer to do Importance and Metropolis-Hastings Sampling of a Classical Bayesian Network
- Quantum Gibbs Sampling Using Szegedy Operators