Microsoft Quantum and collaborators prove shallow quantum circuits provide an exponential advantage
We know that Shor’s algorithm can factor integers on a quantum computer exponentially faster than any known classical algorithm, and that there are problems, such as the simulation of physical systems as posed by Richard Feynman in the 1980s, that quantum computers can solve that would take classical computers more than the lifetime of the Read more