Differences

This shows you the differences between two versions of the page.

--- quantum-algorithm [May 25, 2026 at 13:55] – external edit 127.0.0.1
+++ quantum-algorithm [June 13, 2026 at 03:13] (current) – external edit 127.0.0.1
@@ Line 3: / Line 3: @@
 Not all problems are easier on a quantum computer. The best known quantum speedups are for specific structured problems: factoring integers ([[shor|Shor's algorithm]], exponential speedup), searching an unstructured database ([[grover|Grover's algorithm]], quadratic speedup), and simulating quantum systems. For general-purpose computation, quantum computers are not faster than classical ones. The power of quantum algorithms lies in identifying structure that quantum mechanics can exploit through interference.
-## List of quantum algorithms
- - [[deutsch]]
- - [[deutsch-jozsa]]
- - [[qpe]]
- - [[qft]]
- - [[grover]]
- - [[shor]]
- - [[hsp]]
- - [[hhl]]
- - [[nisq]]
- - [[qaoa]]
- - [[vqe]]