Here we develop a polynomial time algorithm that provably finds the ground state of any 1D quantum system described by a gapped local Hamiltonian with constant ground-state energy. The algorithm ...

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...

A key area within this field is the study of polynomial time algorithms, which are algorithms that can solve problems in a time that is a polynomial function of the size of the input. Recent ...

A number of solvable problems can be solved by algorithms that halt in a reasonable amount of time. These “polynomial-time algorithms” are efficient algorithms, meaning it’s practical to use ...

I disagree with Nicola Dixon’s claim that “Experts had suspected a polynomial-time algorithm was possible” (17 August, p 9). The general feeling was that such an algorithm does not exist.

A new algorithm efficiently solves the graph isomorphism ... they belong to a category called P, for polynomial time. Others are classified as NP-complete (NP stands for nondeterministic ...

Now, Babai has taken what appears to be a major step forward in pinning down the problem’s difficulty level, by setting forth what he asserts is a “quasi-polynomial-time” algorithm to solve it.