Microwave Simulation of Grover's Quantum Search Algorithm
- Additional Document Info
- View All
An analog of a quantum search method, known as Grover's Algorithm, is modeled without entanglement on the macroscopic level, using numerical simulation of microwave devices and methods. An array of microstrip annular-ring resonators simulates a quantum bit array. An oracle that performs a test to determine which element in the array is the answer to the search algorithm is provided by a microwave-frequency plane wave, modulated by a Gaussian pulse. A single annular ring with a resonant frequency identical to the frequency of the incident pulse serves as the answer to the search. It is shown that the number of Gaussian pulses needed to identify the answer element is equal to the √N iterations predicted by the Grover algorithm. The decay in a microwave-resonator element is used to show that the quantum dual - a spontaneous decay of the excited energy level of a quantum bit, also described as its decoherence - can be a serious obstacle to the development of large quantum-bit data arrays.
author list (cited authors)
Nevels, R., Jeong, J., & Hemmer, P.