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 [Gharibian and Sikora, ICALP15] that this problem is QCMA-complete for general local Hamiltonians, 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.
[AE11] Dorit Aharonov and Lior Eldar. On the complexity of commuting local Hamiltonians, and tight conditions for topological order in such systems. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 334-343. IEEE, 2011. https://doi.org/10.1109/FOCS.2011.58.
[AGIK09] Dorit Aharonov, Daniel Gottesman, Sandy Irani, and Julia Kempe. The power of quantum systems on a line. Communications in Mathematical Physics, 287(1):41-65, 2009. https://doi.org/10.1109/FOCS.2007.46.
[BLP⁺16] Benjamin J Brown, Daniel Loss, Jiannis K Pachos, Chris N Self, and James R Wootton. Quantum memories at finite temperature. Reviews of Modern Physics, 88(4):045005, 2016. http://dx.doi.org/10.1103/RevModPhys.88.045005.
[BV03] Sergey Bravyi and Mikhail Vyalyi. Commutative version of the k-local Hamiltonian problem and common eigenspace problem. arXiv preprint quant-ph/0308021, 2003.
[Coo71] Stephen A Cook. The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, pages 151-158. ACM, 1971. https://doi.org/10.1145/800157.805047.
[GKMP09] Parikshit Gopalan, Phokion G Kolaitis, Elitza Maneva, and Christos H Papadimitriou. The connectivity of Boolean satisfiability: computational and structural dichotomies. SIAM Journal on Computing, 38(6):2330-2355, 2009. https://doi.org/10.1137/07070440X.
[GS15] Sevag Gharibian and Jamie Sikora. Ground state connectivity of local Hamiltonians. In Automata, Languages, and Programming, pages 617-628. Springer, 2015. https://link.springer.com/chapter/10.1007/978-3-662-47672-7_50.
[Kit03] A Yu Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics, 303(1):2-30, 2003. https://doi.org/10.1016/S0003-4916(02)00018-0.
[KKR06] Julia Kempe, Alexei Kitaev, and Oded Regev. The complexity of the local Hamiltonian problem. SIAM Journal on Computing, 35(5):1070-1097, 2006. http://dx.doi.org/10.1137/S0097539704445226.
[KR03] Julia Kempe and Oded Regev. 3-local Hamiltonian is QMA-complete. arXiv preprint quant-ph/0302079, 2003. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.252.4841.
[KSV02] Alexei Yu Kitaev, Alexander Shen, and Mikhail N Vyalyi. Classical and quantum computation, volume 47. American Mathematical Society Providence, 2002. http://dx.doi.org/10.1090/gsm/047.
[OT08] Roberto Oliveira and Barbara M Terhal. The complexity of quantum spin systems on a two-dimensional square lattice. Quantum Information & Computation, 8(10):900-924, 2008.
[Sch11] Norbert Schuch. Complexity of commuting Hamiltonians on a square lattice of qubits. Quantum Information & Computation, 11(11-12):901-912, 2011.
[Wat11] John Watrous. Theory of quantum information. University of Waterloo Fall, 128, 2011.
This paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.