“We had to control how big a number shows up as we do this guessing and coordination,” said Peng. Peng and Vempala prove that their algorithm can solve any sparse linear system in n 2.332 steps. This ...

Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation ...

So by imagining a pseudo Bose-Einstein condensate tailor made for each nonlinear problem, this algorithm deduces a useful linear approximation. “Give me your favorite nonlinear differential equation, ...

It may be that life is just an example of Grover’s quantum search at work, and that this algorithm is itself a fundamental property of nature. That’s a Big Idea if ever there was one.