quantum algorithm

History

The first quantum algorithm was devised by David Deutsch in 1985, demonstrating that a quantum computer can solve problems more efficiently than a classical one.

How it works

Qubits become entangled so that a change in one instantly affects another, even at a distance. The algorithm processes the superposition of all input numbers simultaneously, as if computing on an infinite number of calculators in parallel. At the end, measurement collects the result — as if extracting the desired sound from a chorus of voices.

History

The first quantum algorithm was devised by David Deutsch in 1985, demonstrating that a quantum computer can solve problems more efficiently than a classical one.

How it works

Qubits become entangled so that a change in one instantly affects another, even at a distance. The algorithm processes the superposition of all input numbers simultaneously, as if computing on an infinite number of calculators in parallel. At the end, measurement collects the result — as if extracting the desired sound from a chorus of voices.

History

The theoretical foundations were laid by Richard Feynman in 1982, who pointed out that quantum systems are hard to simulate classically. David Deutsch in 1985 formulated the concept of a quantum Turing machine and gave the first example of a quantum algorithm that requires fewer oracle queries. In 1992, Deutsch and Richard Jozsa generalized it, demonstrating exponential advantage. In 1994, Peter Shor developed the factorization algorithm, and in 1996, Lov Grover proposed the algorithm for quadratic speedup in search.

How it works

A typical quantum algorithm consists of four stages: initialization of the register in a superposition of all input states (e.g., Hadamard transform), application of an oracle (quantum function evaluation), amplification of the correct solution (e.g., Grover iteration or quantum Fourier transform), and measurement. The speedup arises because quantum operations act on amplitudes rather than probabilities, and the number of possible states grows exponentially with the number of qubits.

Open problems & fun facts

Construction of practically useful quantum algorithms that outperform classical ones for real-world problems (optimization, machine learning).; Development of quantum algorithms robust to noise without full error correction.; Achieving quantum supremacy in problems of commercial or scientific value.

💡 Grover's algorithm provides quadratic speedup: a database of a million entries can be scanned in about 1000 operations, while a classical computer would need up to a million.