论文信息 - On the complexity of stoquastic Hamiltonians

On the complexity of stoquastic Hamiltonians

Stoquastic Hamiltonians, those for which all off-diagonal matrix elements in the standard basis are real and non-positive, are common in the physical world. We survey recent work on the complexity of stoquastic Hamiltonians. We discuss results relating stoquastic Hamiltonians and Merlin-Arthur games, including the result that stoquastic k-local Hamiltonian is StoqMA-complete, focusing in particular on the first non-trivial example of an MA-complete problem, stoquastic k-SAT.

I. Kivlichan

[1] M. Hastings,et al. On Complexity of the Quantum Ising Model , 2014, 1410.0703.

[2] P. Love,et al. Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices , 2009, 0905.4755.

[3] Barbara M. Terhal,et al. Complexity of Stoquastic Frustration-Free Hamiltonians , 2008, SIAM J. Comput..

[4] Barbara M. Terhal,et al. Merlin-Arthur Games and Stoquastic Complexity , 2006, ArXiv.

[5] David P. DiVincenzo,et al. The complexity of stoquastic local Hamiltonian problems , 2006, Quantum Inf. Comput..

[6] Sergey Bravyi,et al. Efficient algorithm for a quantum analogue of 2-SAT , 2006, quant-ph/0602108.

[7] Julia Kempe,et al. The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.