A Classical Analog of Quantum Search *

نویسندگان

  • Lov K. Grover
  • Anirvan M. Sengupta
چکیده

Quantum search is a quantum mechanical technique for searching N possibilities in only √ N steps. We show that the algorithm can be described as a resonance phenomenon. A similar algorithm applies in a purely classical setting when there are N oscillators, one of which is of a different resonant frequency. We could identify which one this is by measuring the oscillation frequency of each oscillator, a procedure that would take about N cycles. We show, how by coupling the oscillators together in a very simple way, it is possible to identify the different one in only √ N cycles. ∗Research of the first author was partly supported by NSA & ARO under contract no. DAAG55-98-C-0040.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability of additive functional equation on discrete quantum semigroups

We construct  a noncommutative analog of additive functional equations on discrete quantum semigroups and show that this noncommutative functional equation has Hyers-Ulam stability on amenable discrete quantum semigroups. The discrete quantum semigroups that we consider in this paper are in the sense of van Daele, and the amenability is in the sense of Bèdos-Murphy-Tuset. Our main result genera...

متن کامل

When the classical & quantum mechanical considerations hint to a single point; a microscopic particle in a one dimensional box with two infinite walls and a linear potential inside it

In this paper we have solved analytically the Schrödinger equation for a microscopic particle in a one-dimensional box with two infinite walls, which the potential function inside it, has a linear form. Based on the solutions of this special quantum mechanical system, we have shown that as the quantum number approaches infinity the expectation values of microscopic particle position and square ...

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Non-classical Role of Potential Energy in Adiabatic Quantum Annealing

Adiabatic quantum annealing is a paradigm of analog quantum computation, where a given computational job is converted to the task of finding the global minimum of some classical potential energy function and the search for the global potential minimum is performed by employing external kinetic quantum fluctuations and subsequent slow reduction (annealing) of them. In this method, the entire pot...

متن کامل

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

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001