QCMA hardness of ground space connectivity for commuting Hamiltonians

@article{Gosset2016QCMAHO,
  title={QCMA hardness of ground space connectivity for commuting Hamiltonians},
  author={D. Gosset and Jenish C. Mehta and T. Vidick},
  journal={ArXiv},
  year={2016},
  volume={abs/1610.03582}
}
  • D. Gosset, Jenish C. Mehta, T. Vidick
  • Published 2016
  • Computer Science, Physics, Mathematics
  • ArXiv
  • 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… CONTINUE READING
    Pinned QMA: The power of fixing a few qubits in proofs
    The complexity of simulating local measurements on quantum systems
    1
    Clustering in Hilbert space of a quantum optimization problem
    2
    The Complexity of Simulating Local Measurements on Quantum Systems
    5

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES
    Ranking of fuzzy numbers by sign distance
    290
    Sarangan , WeiPing Huang , and Toshi Makino , “ Spectral domain modeling of distributed feedback lasers ”
    • 1997
    Large Graph Algorithms for Massively Multithreaded Architectures
    93
    AAS Meeting
    • 2003
    Ground State Connectivity of Local Hamiltonians
    20
    3-local Hamiltonian is QMA-complete
    73