scholarly journals Simulation of Grover's quantum search algorithm in an Ising-nuclear-spin-chain quantum computer with first- and second-nearest-neighbour couplings

2008 ◽  
Vol 41 (5) ◽  
pp. 055504 ◽  
Author(s):  
G V López ◽  
T Gorin ◽  
L Lara
Keyword(s):  
Nuclear Spin ◽  
Spin Chain ◽  
Quantum Computer ◽  
Search Algorithm ◽  
Quantum Search ◽  
Nearest Neighbour ◽  
Quantum Search Algorithm

scholarly journals Implementation of a quantum search algorithm on a quantum computer

Nature ◽  
10.1038/30687 ◽  
1998 ◽  
Vol 393 (6683) ◽  
pp. 344-346 ◽  
Author(s):  
Jonathan A. Jones ◽  
Michele Mosca ◽  
Rasmus H. Hansen
Keyword(s):  
Quantum Computer ◽  
Search Algorithm ◽  
Quantum Search ◽  
Quantum Search Algorithm

A quantum search algorithm for future spacecraft attitude determination

2011 ◽  
Vol 68 (7-8) ◽  
pp. 1208-1218 ◽  
Author(s):  
Jack Tsai ◽  
Fu-Yuen Hsiao ◽  
Yi-Ju Li ◽  
Jen-Fu Shen
Keyword(s):  
Attitude Determination ◽  
Search Algorithm ◽  
Spacecraft Attitude ◽  
Quantum Search ◽  
Quantum Search Algorithm

How significant are the known collision and element distinctness quantum algorithms?

2004 ◽  
Vol 4 (3) ◽  
pp. 201-206
Author(s):  
L. Grover ◽  
T. Rudolph
Keyword(s):  
Search Algorithm ◽  
Quantum Algorithms ◽  
Search Space ◽  
Space Complexity ◽  
Quantum Search ◽  
Quantum Search Algorithm ◽  
Time Space ◽  
Simple Quantum ◽  
Structured Problems ◽  
Better Than

Quantum search is a technique for searching $N$ possibilities for a desired target in $O(\sqrt{N})$ steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum hardware. In this paper we propose the criterion that an algorithm which requires $O(S)$ hardware should be considered significant if it produces a speedup of better than $O\left(\sqrt{S}\right)$ over a simple quantum search algorithm. This is because a speedup of $O\left(\sqrt{S}\right)$ can be trivially obtained by dividing the search space into $S$ separate parts and handing the problem to $S$ independent processors that do a quantum search (in this paper we drop all logarithmic factors when discussing time/space complexity). Known algorithms for collision and element distinctness exactly saturate the criterion.

Sign in / Sign up

Export Citation Format

Share Document