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 ...

Polynomial Time Algorithm: An algorithm whose running time is upper bounded by a polynomial expression in the size of the input, considered efficient in computer science.

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 ...

Scientists have developed an exact approach to a key quantum error correction problem once believed to be unsolvable, and have shown that what appeared to be hardware-related errors may in fact be due ...

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 ...

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.

Computer scientists generally consider an algorithm to be efficient if its running time can be expressed not as a factorial but as a polynomial, such as n 2 or n 3; polynomials grow much more ...