Stochastic Simulation of Grover's Algorithm

2003/01/16 by L. R. U. MANSSUR, L. R. U. Manssur, R. Portugal +3
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0301077

15 pages, 2 figures

arxiv created 2003/01/16 · openalex publication_date 2003/01/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Strengths and Weaknesses of Quantum Computing
• Elementary gates for quantum computation

Related

• Monte Carlo Simulation of Quantum Computation
• Computational leakage: Grover's algorithm with imperfections
• Classical simulation of quantum algorithms using the tensor product representation
• Connecting Quantum Computing with Classical Stochastic Simulation
• Simple third order operator-splitting schemes for stochastic mechanics and field theory