Monte Carlo simulation of quantum computation1Presented at the IMACS Seminar on Monte Carlo Methods, Brussels, 1–3 April 1997.1

N.J. Cerf and S.E. Koonin

Mathematics and Computers in Simulation (MATCOM), 1998, vol. 47, issue 2, 143-152

Abstract: The many-body dynamics of a quantum computer can be reduced to the time evolution of non-interacting quantum bits in auxiliary fields using 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.

Keywords: Quantum Monte Carlo methods; Quantum computers (search for similar items in EconPapers)
Date: 1998
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475498000998
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:47:y:1998:i:2:p:143-152

DOI: 10.1016/S0378-4754(98)00099-8

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().