The Complexity of the Local Hamiltonian Problem
Work
Year: 2006
Type: article
Abstract: The k-{\locHam} problem is a natural complete problem for the complexity class $\QMA$, the quantum analogue of $\NP$. It is similar in spirit to {\sc MAX-k-SAT}, which is $\NP$-complete for $k\geq 2$.... more
Source: SIAM Journal on Computing
Authors Julia Kempe, Alexei Kitaev, Oded Regev
Institutions University of California, Berkeley, Laboratoire de Recherche en Informatique, Université Paris Cité, Centre National de la Recherche Scientifique, Berkeley College +2 more
Cites: 9
Cited by: 592
Related to: 10
FWCI: 41.09
Citation percentile (by year/subfield): 100
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green