Implementation of quantum search algorithm using classical Fourier optics.
نویسندگان
چکیده
We report on an experiment on Grover's quantum search algorithm showing that classical waves can search a N-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed iteratively as the pulse bounces back and forth between two mirrors. We directly observe the sought item being found in approximately square root[N] iterations, in the form of a growing intensity peak on this profile. Although the lack of quantum entanglement limits the size of our database, our results show that entanglement is neither necessary for the algorithm itself, nor for its efficiency.
منابع مشابه
Implementation of quantum algorithms with resonant interactions
Construction of quantum computer is an enormously appealing task because of quantum computational potential to perform superfast quantum algorithms. Two classes of quantum logarithms illustrate the great theoretical promise of quantum computers. One is based on Shor’s Fourier transformation including quantum factoring [1], Deutsh-Jozsa logarithm [2] and so on, which are all exponential speedup ...
متن کاملProviding a Bird Swarm Algorithm based on Classical Conditioning Learning Behavior and Comparing this Algorithm with sinDE, JOA, NPSO and D-PSO-C Based on Using in Nanoscience
There can be no doubt that nanotechnology will play a major role in our futuretechnology. Computer science offers more opportunities for quantum andnanotechnology systems. Soft Computing techniques such as swarm intelligence, canenable systems with desirable emergent properties. Optimization is an important anddecisive activity in structural designing. The inexpensive re...
متن کاملImplementation of quantum and classical discrete fractional Fourier transforms
Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importanc...
متن کاملDecomposition of Unitary Matrices for Finding Quantum Circuits
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuit...
متن کاملDecomposition of unitary matrices for finding quantum circuits: Application to molecular Hamiltonians
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 88 13 شماره
صفحات -
تاریخ انتشار 2002