Abstract | ||
---|---|---|
The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has heuristics which work well, while the 13-state qudit case has been shown to be QMA-complete. We show that this problem remains QMA-complete when the dimensionality of the qudits is brought down to 8. |
Year | Venue | Keywords |
---|---|---|
2013 | Quantum Information & Computation | local hamiltonian,13-state qudit case,local hamiltonian problem,class qma |
Field | DocType | Volume |
Discrete mathematics,Adiabatic quantum computation,Hamiltonian (quantum mechanics),Curse of dimensionality,Hamiltonian path problem,Heuristics,Qubit,Mathematics,Eigenvalues and eigenvectors | Journal | 13 |
Issue | ISSN | Citations |
9-10 | Quantum Information & Computation, Vol.13, No.9&10, pp0721-0750
(2013) | 6 |
PageRank | References | Authors |
0.55 | 5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sean Hallgren | 1 | 320 | 31.57 |
Daniel Nagaj | 2 | 57 | 5.84 |
Sandeep Narayanaswami | 3 | 6 | 0.55 |