Monte Carlo Simulation of Quantum Computation
Quantum Physics
2007-05-23 v1
Abstract
The many-body dynamics of a quantum computer can be reduced to the time evolution of non-interacting quantum bits in auxiliary fields by use of the Hubbard-Stratonovich representation of two-bit quantum gates in terms of one-bit gates. This makes it possible to perform the stochastic simulation of a quantum algorithm, based on the Monte Carlo evaluation of an integral of dimension polynomial in the number of quantum bits. As an example, the simulation of the quantum circuit for the Fast Fourier Transform is discussed.
Cite
@article{arxiv.quant-ph/9703050,
title = {Monte Carlo Simulation of Quantum Computation},
author = {N. J. Cerf and S. E. Koonin},
journal= {arXiv preprint arXiv:quant-ph/9703050},
year = {2007}
}
Comments
12 pages Latex, 2 Postscript figures, to appear in Proceedings of the IMACS (International Association for Mathematics and Computers in Simulation) Conference on Monte Carlo Methods, Brussels, April 97