Quantum algorithms Quantum algorithms The Deutsch-Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992. It was one of first examples of a quantum algorithm, which is a class of algorithms designed for execution on Quantum computers and have the potential to be more efficient than conventional, classical, algorithms by taking advantage of the quantum superposition and entanglement principles. ...more on Wikipedia about "Deutsch-Jozsa algorithm"
Grover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O(N1/2) time and using O(logN) storage space (see big O notation). It was invented by Lov Grover in 1996. ...more on Wikipedia about "Grover's algorithm"
A quantum algorithm is an algorithm designed for use on a quantum computer. ...more on Wikipedia about "Quantum algorithm"
Shor's algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space, named after Peter Shor. ...more on Wikipedia about "Shor's algorithm"
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Quantum algorithms".
| MAIN PAGE | MAIN INDEX | CONTACT US |