pith. sign in

arxiv: quant-ph/0301077 · v1 · submitted 2003-01-16 · 🪐 quant-ph

Stochastic Simulation of Grover's Algorithm

classification 🪐 quant-ph
keywords algorithmcomputerequationsgatesgroversimulationstochasticalgebra
0
0 comments X
read the original abstract

We simulate Grover's algorithm in a classical computer by means of a stochastic method using the Hubbard-Stratonovich decomposition of n-qubit gates into one-qubit gates integrated over auxiliary fields. The problem reduces to finding the fixed points of the associated system of Langevin differential equations. The equations are obtained automatically for any number of qubits by employing a computer algebra program. We present the numerical results of the simulation for a small search space.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.