■ Block 01 / research
Research
Foundations other work depends on. Each entry explains what it is, why it is load-bearing, its open problems, and a reviewed timeline of progress.
Foundations other work depends on. Each entry explains what it is, why it is load-bearing, its open problems, and a reviewed timeline of progress.
Algorithms for quantum computers, from Shor's factoring and Grover's search to quantum simulation, and the evidence about which speedups are real, provable or only heuristic.
Algorithms that multiply n×n matrices with fewer than n³ arithmetic operations, from Strassen (1969) to the laser method, and their link to tensor rank.
The study of how much time, memory and other resources problems need, organised into classes such as P, NP and PSPACE. Its open questions bound what any algorithm can do.