Quantum algorithm

In <a href="/facts/Quantum_computing/nbbcgmvq">quantum computing</a>, a quantum algorithm is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> that runs on a realistic model of <a href="/facts/Quantum_computation/nbbcgmvq">quantum computation</a>, the most commonly used model being the <a href="/facts/Quantum_circuit/yuFDFFPa">quantum circuit</a> model of computation. 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 <a href="/facts/Computer/SQe1aK05">computer</a>. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a <a href="/facts/Quantum_computer/nbbcgmvq">quantum computer</a>. Although all classical algorithms can also be performed on a quantum computer,: 126  the term quantum algorithm is generally reserved for algorithms that seem inherently quantum, or use some essential feature of quantum computation such as <a href="/facts/Quantum_superposition/4z1UJg9o">quantum superposition</a> or <a href="/facts/Quantum_entanglement/afzslwN0">quantum entanglement</a>.
Problems that are <a href="/facts/Undecidable_problem/QBxmXBbY">undecidable</a> using classical computers remain undecidable using quantum computers.: 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 <a href="/facts/Quantum_supremacy/yGFzB6QR">Quantum supremacy</a>).
The best-known algorithms are <a href="/facts/Shor%2527s_algorithm/9JwEtznC">Shor's algorithm</a> for factoring and <a href="/facts/Grover%2527s_algorithm/SJuxBPpA">Grover's algorithm</a> for searching an unstructured database or an unordered list. Shor's algorithm runs much (almost exponentially) faster than the most efficient known classical algorithm for factoring, the <a href="/facts/General_number_field_sieve/elC06ARC">general number field sieve</a>. Grover's algorithm runs quadratically faster than the best possible classical algorithm for the same task, a <a href="/facts/Linear_search/cBh6w2sq">linear search</a>.

Quantum algorithm open-in-new

Quantum algorithm