Abstract
The study of ground state energies of local Hamiltonians has played a fundamental role in quantum complexity theory. In this article, we take a new direction by introducing the physically motivated notion of “ground state connectivity” of local Hamiltonians, which captures problems in areas ranging from quantum stabilizer codes to quantum memories. Roughly, “ground state connectivity” corresponds to the natural question: Given two ground states |Ψ〉 and |ϕ〉 of a local Hamiltonian H, is there an “energy barrier” (with respect to H) along any sequence of local operations mapping |Ψ〉 to |ϕ〉? We show that the complexity of this question can range from QCMA-complete to PSPACE-complete, as well as NEXP-complete for an appropriately defined “succinct” version of the problem. As a result, we obtain a natural QCMA-complete problem, a goal which has generally proven difficult since the conception of QCMA over a decade ago. Our proofs rely on a new technical tool, the Traversal Lemma, which analyzes the Hilbert space a local unitary evolution must traverse under certain conditions. We show that this lemma is essentially tight with respect to the length of the unitary evolution in question.
- D. Aharonov and T. Naveh. 2002. Quantum NP - A survey. arXiv.org e-Print quant-ph/0210077v1.Google Scholar
- A. Ambainis. 2014. On physical problems that are slightly more difficult than QMA. In Proceedings of 29th IEEE Conference on Computational Complexity (CCC’14). 32--43. Google Scholar
Digital Library
- P. Beame and C. Re. 2004. Lecture 12: Probabilistically checkable proofs. Retrieved March 12, 2018 from http://courses.cs.washington.edu/courses/cse532/04sp/lect12.pdf.Google Scholar
- M. Bonamy and N. Bousquet. 2013. Recoloring bounded treewidth graphs. In Proceedings of the 7th Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS’13).Google Scholar
- M. Bonamy, M. Johnson, I. Lignos, V. Patel, and D. Paulusma. 2011. On the diameter of reconfiguration graphs for vertex colourings. Electronic Notes in Discrete Mathematics 38, 0 (2011), 161--166.Google Scholar
Cross Ref
- P. Bonsma. 2012. The complexity of rerouting shortest paths. Lecture Notes in Computer Science, Vol. 7464. 222--233. Google Scholar
Digital Library
- P. Bonsma and L. Cereceda. 2009. Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. Theoretical Computer Science 410, 50 (2009), 5215--5226. Google Scholar
Digital Library
- S. Bravyi and M. Vyalyi. 2005. Commutative version of the local Hamiltonian problem and common eigenspace problem. Quantum Information 8 Computation 5, 3 (2005), 187--215. Google Scholar
Digital Library
- B. Brown, S. Flammia, and N. Schuch. 2011. Computational difficulty of computing the density of states. Physical Review Letters 104 (2011), 040501.Google Scholar
Cross Ref
- H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. 2001. Quantum fingerprinting. Physical Review Letters 87, 16 (2001), 167902.Google Scholar
Cross Ref
- L. Cereceda, J. van den Heuvel, and M. Johnson. 2008. Connectedness of the graph of vertex-colorings. Discrete Mathematics 308, 56 (2008), 913--919. Google Scholar
Digital Library
- L. Cereceda, J. van den Heuvel, and M. Johnson. 2011. Finding paths between 3-colorings. Journal of Graph Theory 67, 1 (2011), 69--82. Google Scholar
Digital Library
- H. Cohen. 1993. A Course in Computational Algebraic Number Theory. Springer. 96044745 https://books.google.co.uk/books?id=hXGr-9l1DXcC. Google Scholar
Digital Library
- S. Cook. 1972. The complexity of theorem proving procedures. In Proceedings of the 3rd ACM Symposium on Theory of Computing (STOC'72). 151--158. Google Scholar
Digital Library
- T. Cubitt and A. Montanaro. 2013. Complexity classification of local Hamiltonian problems. arXiv.org e-Print quant-ph/1311.3161.Google Scholar
- G. Fricke, S. M. Hedetniemi, S. T. Hedetniemi, and K. R. Hutson. 2011. -Graphs of graphs. Discussiones Mathematicae Graph Theory 31, 3 (2011), 517--531.Google Scholar
Cross Ref
- S. Gharibian. 2013. Approximation, Proof Systems, and Correlations in a Quantum World. Ph.D. dissertation. University of Waterloo. Preprint at arXiv:quant-ph/1301.2632.Google Scholar
- S. Gharibian, Y. Huang, Z. Landau, and S. W. Shin. 2014a. Quantum Hamiltonian complexity. arXiv.org e-Print quant-ph/1401.3916v1. Google Scholar
Digital Library
- S. Gharibian and J. Kempe. 2012. Hardness of approximation for quantum problems. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP’12). 387--398. Google Scholar
Digital Library
- S. Gharibian, Z. Landau, S. W. Shin, and G. Wang. 2014b. Tensor network non-zero testing. arXiv.org e-Print quant-ph/1406.5279.Google Scholar
- P. Gopalan, P. Kolaitis, E. Maneva, and C. Papadimitriou. 2006. The connectivity of Boolean satisfiability: Computational and structural dichotomies. In Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP’06). 346--357. Google Scholar
Digital Library
- D. Gottesman. 1997. Stabilizer codes and quantum error correction. arXiv.org e-Print quant-ph/9705052.Google Scholar
- R. A. Horn and C. H. Johnson. 1990. Matrix Analysis. Cambridge University Press. Google Scholar
Digital Library
- T. Ito, E. D. Demaine, N. J. A. Harvey, C. H. Papadimitriou, M. Sideri, R. Uehara, and Y. Uno. 2011. On the complexity of reconfiguration problems. Theoretical Computer Science 412, 12--14 (2011), 1054--1065. Google Scholar
Digital Library
- T. Ito, M. Kamiński, and E. D. Demaine. 2012a. Reconfiguration of list edge-colorings in a graph. Discrete Applied Mathematics 160, 15 (2012), 2199--2207. Google Scholar
Digital Library
- T. Ito, K. Kawamura, H. Ono, and X. Zhou. 2012b. Reconfiguration of list L(2,1)-labelings in a graph. In Proceedings of the 23rd International Symposium on Algorithms and Computation. 34--43. Google Scholar
Digital Library
- D. Janzing and P. Wocjan. 2006. BQP-complete Problems Concerning Mixing Properties of Classical Random Walks on Sparse Graphs. arXiv.org e-Print quant-ph/0610235v2.Google Scholar
- S. P. Jordan, H. Kobayashi, D. Nagaj, and H. Nishimura. 2012. Achieving perfect completeness in classical-witness quantum Merlin-Arthur proof systems. Quantum Information 8 Computation 12, 5 8 6 (2012), 461--471. Google Scholar
Digital Library
- M. Kamiński, P. Medvedev, and M. Milanic. 2012. Complexity of independent set reconfigurability problems. Theoretical Computer Science 439 (2012), 9--15. Google Scholar
Digital Library
- J. Kempe and O. Regev. 2003. 3-local Hamiltonian is QMA-complete. Quantum Information 8 Computation 3, 3 (2003), 258--264. Google Scholar
Digital Library
- A. Kitaev. 1999. Quantum NP. (1999). Talk at 2nd Workshop on Algorithms in Quantum Information Processing (AQIP 1999), DePaul University.Google Scholar
- A. Kitaev. 2001. Unpaired Majorana fermions in quantum wires. Physics-Uspekhi 44 (2001), 131.Google Scholar
Cross Ref
- A. Kitaev. 2003. Fault-tolerant quantum computation by anyons. Annals of Physics 303, 1 (2003), 2--30.Google Scholar
Cross Ref
- A. Kitaev and C. Laumann. 2009. Topological phases and quantum computation. arXiv.org e-Print quant-ph/0904.2771.Google Scholar
- A. Kitaev, A. Shen, and M. Vyalyi. 2002. Classical and Quantum Computation. American Mathematical Society. Google Scholar
Digital Library
- L. Levin. 1973. Universal search problems. Problems of Information Transmission 9, 3 (1973), 265--266.Google Scholar
- A. Mouawad, N. Nishimura, V. Pathak, and V. Raman. 2014b. Shortest reconfiguration paths in the solution space of Boolean formulas. arXiv.org e-Print cs.CC/1404.3801v2.Google Scholar
- A. Mouawad, N. Nishimura, and V. Raman. 2014a. Vertex cover reconfiguration and beyond. arXiv.org e-Print cs.CC/1402.4926.Google Scholar
- A. E. Mouawad, N. Nishimura, V. Raman, N. Simjour, and A. Suzuki. 2013. On the parameterized complexity of reconfiguration problems. In Proceedings of the 8th International Symposium on Parameterized and Exact Computation (IPEC’13). 281--294.Google Scholar
- M. A. Nielsen and I. L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press. Google Scholar
Digital Library
- R. Oliveira and B. M. Terhal. 2008. The complexity of quantum spin systems on a two-dimensional square lattice. Quantum Information 8 Computation 8, 10 (2008), 0900--0924. Google Scholar
Digital Library
- T. J. Osborne. 2012. Hamiltonian complexity. Reports on Progress in Physics 75, 2 (2012), 022001. http://stacks.iop.org/0034-4885/75/i=2/a=022001.Google Scholar
Cross Ref
- M. Piani, S. Gharibian, G. Adesso, J. Calsamiglia, P. Horodecki, and A. Winter. 2011. All non-classical correlations can be activated into distillable entanglement. Physical Review Letters 106 (2011), 220403.Google Scholar
Cross Ref
- W. J. Savitch. 1970. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4, 2 (1970), 177--192. Google Scholar
Digital Library
- T. J. Schaefer. 1978. The complexity of satisfiability problems. In Proceedings of the 10th Symposium on Theory of Computing. 216--226. Google Scholar
Digital Library
- K. W. Schwerdtfeger. 2013. A computational trichotomy for connectivity of Boolean satisfiability. CoRR (2013). arXiv.org e-Print abs/1312.4524.Google Scholar
- J. Watrous. 2008. Lecture 2: Mathematical Preliminaries. Part II. (2008). Retrieved from www.cs.uwaterloo.ca/∼watrous/CS766/.Google Scholar
- J. Watrous. 2009. Encyclopedia of Complexity and System Science. Springer, Chapter Quantum Computational Complexity.Google Scholar
- M. W. Wilde. 2013. Quantum Information Theory. Cambridge University Press. Google Scholar
Digital Library
- A. Winter. 1999. Coding theorem and strong converse for quantum channels. IEEE Transactions on Information Theory 45, 7 (1999), 2481--2485. Google Scholar
Digital Library
- P. Wocjan, D. Janzing, and T. Beth. 2003. Two QCMA-complete problems. Quantum Information 8 Computation 3, 6 (2003), 635--643. Google Scholar
Digital Library
- P. Wocjan and J. Yard. 2008. The Jones polynomial: Quantum algorithms and applications in quantum complexity theory. Quantum Information 8 Computation 8, 1 (2008), 147--180. Google Scholar
Digital Library
- J. Yan and D. Bacon. 2012. The k-local Pauli commuting Hamiltonians problem is in P. arXiv.org e-Print quant-ph/1203.3906.Google Scholar
Index Terms
Ground State Connectivity of Local Hamiltonians
Recommendations
An efficient algorithm for finding the ground state of 1D gapped local hamiltonians
ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer scienceComputing ground states of local Hamiltonians is a fundamental problem in condensed matter physics. The problem is known to be QMA-complete, even for one-dimensional Hamiltonians [1]. This means that we do not even expect that there is a sub-exponential ...
The commuting local Hamiltonian problem on locally expanding graphs is approximable in $$\mathsf{{NP}}$$NP
The local Hamiltonian problem is famously complete for the class $$\mathsf{{QMA}}$$QMA, the quantum analogue of $$\mathsf{{NP}}$$NP. The complexity of its semiclassical version, in which the terms of the Hamiltonian are required to commute (the $$\...
Non-commuting two-local Hamiltonians for quantum error suppression
Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge. Enabling error ...






Comments