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 previous best algorithm — which Babai was also involved in creating in 1983 with Eugene Luks, now a professor emeritus at the University of Oregon — ran in “subexponential” time, a running time ...

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...

The amount of time it takes for an algorithm to solve a polynomial function, which is a mathematical expression that does not contain fractions or negative numbers. The time is proportional to the ...

Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many ...

Elegant algorithm. Published 21 September 2002. From Cristian Calude . I disagree with Nicola Dixon’s claim that “Experts had suspected a polynomial-time algorithm was possible” (17 August ...

Graph isomorphism in quasipolynomial time I: The “Local Certificates Algorithm.” Combinatorics and Theoretical Computer Science seminar, Chicago, November 10, 2015.

The previous best algorithm—which Babai was also involved in creating in 1983 with Eugene Luks, now a professor emeritus at the University of Oregon—ran in “subexponential” time, a running ...