Algorithms run on quantum computers, typically relying on superposition and/or entanglement
In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation.[1][2] A classical (or non-quantum) algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer,[3]: 126 the term quantum algorithm is generally reserved for algorithms that seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.
Problems that are undecidable using classical computers remain undecidable using quantum computers.[4]: 127 What makes quantum algorithms interesting is that they might be able to solve some problems faster than classical algorithms because the quantum superposition and quantum entanglement that quantum algorithms exploit generally cannot be efficiently simulated on classical computers (see Quantum supremacy).
The best-known algorithms are Shor's algorithm for factoring and Grover's algorithm for searching an unstructured database or an unordered list. Shor's algorithm runs much (almost exponentially) faster than the best-known classical algorithm for factoring, the general number field sieve.[5] Grover's algorithm runs quadratically faster than the best possible classical algorithm for the same task,[6] a linear search.
^Nielsen, Michael A.; Chuang, Isaac L. (2000). Quantum Computation and Quantum Information. Cambridge University Press. ISBN 978-0-521-63503-5.
^Mosca, M. (2008). "Quantum Algorithms". arXiv:0808.0369 [quant-ph].
^Lanzagorta, Marco; Uhlmann, Jeffrey K. (1 January 2009). Quantum Computer Science. Morgan & Claypool Publishers. ISBN 9781598297324.
^Nielsen, Michael A.; Chuang, Isaac L. (2010). Quantum Computation and Quantum Information (2nd ed.). Cambridge: Cambridge University Press. ISBN 978-1-107-00217-3.
^"Shor's algorithm".
^"IBM quantum composer user guide: Grover's algorithm". quantum-computing.ibm.com. Retrieved 7 June 2022.
In quantum computing, a quantumalgorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the...
applied quantum theory to cryptography protocols and demonstrated that quantum key distribution could enhance information security. Quantumalgorithms then...
In quantum computing, the quantum phase estimation algorithm is a quantumalgorithm to estimate the phase corresponding to an eigenvalue of a given unitary...
Quantum optimization algorithms are quantumalgorithms that are used to solve optimization problems. Mathematical optimization deals with finding the best...
The Harrow–Hassidim–Lloyd algorithm or HHL algorithm is a quantumalgorithm for numerically solving a system of linear equations, designed by Aram Harrow...
Quantum machine learning is the integration of quantumalgorithms within machine learning programs. The most common use of the term refers to machine...
that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task. Examples...
Quantum counting algorithm is a quantumalgorithm for efficiently counting the number of solutions for a given search problem. The algorithm is based on...
In quantum computing, the variational quantum eigensolver (VQE) is a quantumalgorithm for quantum chemistry, quantum simulations and optimization problems...
decision problem is a member of BQP if there exists a quantumalgorithm (an algorithm that runs on a quantum computer) that solves the decision problem with...
in quantum programming which limits the amount of skills that can be carried over from traditional programming.[citation needed] Quantumalgorithm and...
discrete Fourier transform. The quantum Fourier transform is a part of many quantumalgorithms, notably Shor's algorithm for factoring and computing the...
term "quantum annealing" was first proposed in 1988 by B. Apolloni, N. Cesa Bianchi and D. De Falco as a quantum-inspired classical algorithm. It was...
the advent of quantum computing, which used quantum mechanics to design algorithms. At this point, quantum computers showed promise of being much faster...
is the quantum analogue to the complexity class BPP. A decision problem is a member of BQP if there exists a quantumalgorithm (an algorithm that runs...
various popular quantumalgorithms and protocols. In classical computing, operations are deterministic and reversible. However, in quantum computing, operations...
operators to manipulate a quantum system for a desired outcome or results of a given experiment. Quantum circuit algorithms can be implemented on integrated...
their value. QuantumalgorithmQuantumalgorithms run on a realistic model of quantum computation. The term is usually used for those algorithms which seem...
Deutsch-Jozsa algorithm is a quantumalgorithm designed to solve a toy problem with a smaller query complexity than is possible with a classical algorithm. The...
_{2}n} queries in the worst case. In comparison, Grover's algorithm is the optimal quantumalgorithm for searching an unordered list of elements, and it requires...
pattern recognition) with the advantages of quantum information in order to develop more efficient algorithms. One important motivation for these investigations...
the deterministic Deutsch–Jozsa algorithm on a quantum computer, but for which no deterministic classical algorithm is possible. This was perhaps the...
In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within...
Global Information