Name
Abstract | ||
|---|---|---|
In this work We consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (efficiently preparable) state to another by applying a polynomial length sequence of 2-qubit unitaries while remaining at all times in a state with low energy for a given Hamiltonian H. It was shown in [GS15] that this problem is QCMA-complete for general local Haniiltorlians, where QCMA is defined as QMA with a classical witness and BQP verifier. Here we show that the commuting version of the problem is also QCMA-complete. This provides one of the first examples where commuting local Hamiltonians exhibit complexity theoretic hardness equivalent to general local Hamiltonians. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.22331/q-2017-07-14-16 | QUANTUM |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Polynomial,Hamiltonian (quantum mechanics),Low energy,Mathematics,BQP | Journal | 1 |
ISSN | Citations | PageRank |
2521-327X | 0 | 0.34 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Gosset | 1 | 39 | 6.76 |
| Jenish C. Mehta | 2 | 1 | 1.04 |
| Thomas Vidick | 3 | 377 | 31.69 |