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

Original language | English (US) |
---|---|

Pages (from-to) | 143-152 |

Number of pages | 10 |

Journal | Mathematics and Computers in Simulation |

Volume | 47 |

Issue number | 2-5 |

State | Published - Aug 1 1998 |

### Fingerprint

### Keywords

- Quantum computers
- Quantum Monte Carlo methods

### ASJC Scopus subject areas

- Information Systems and Management
- Control and Systems Engineering
- Applied Mathematics
- Computational Mathematics
- Modeling and Simulation

### Cite this

*Mathematics and Computers in Simulation*,

*47*(2-5), 143-152.

**Monte Carlo simulation of quantum computation.** / Cerf, N. J.; Koonin, S. E.

Research output: Contribution to journal › Article

*Mathematics and Computers in Simulation*, vol. 47, no. 2-5, pp. 143-152.

}

TY - JOUR

T1 - Monte Carlo simulation of quantum computation

AU - Cerf, N. J.

AU - Koonin, S. E.

PY - 1998/8/1

Y1 - 1998/8/1

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

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

KW - Quantum computers

KW - Quantum Monte Carlo methods

UR - http://www.scopus.com/inward/record.url?scp=0000666630&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000666630&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0000666630

VL - 47

SP - 143

EP - 152

JO - Mathematics and Computers in Simulation

JF - Mathematics and Computers in Simulation

SN - 0378-4754

IS - 2-5

ER -