Monte Carlo simulation of quantum computation

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 qua...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics and computers in simulation 1998-08, Vol.47 (2-5), p.143-152
Main Authors: Cerf, N.J., Koonin, S.E.
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical simulation
Quantum computers
Quantum Monte Carlo methods
Sciences and techniques of general use
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0378-4754
1872-7166
DOI:10.1016/S0378-4754(98)00099-8