Complexity of stoquastic frustration-free Hamiltonians

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pages. The material related to stoquastic k-SAT is an extended and improved version of quant-ph/0611021

Scientific paper

We study several problems related to properties of non-negative matrices that arise at the boundary between quantum and classical probabilistic computation. Our results are twofold. First, we identify a large class of quantum Hamiltonians describing systems of qubits for which the adiabatic evolution can be efficiently simulated on a classical probabilistic computer. These are stoquastic local Hamiltonians with a "frustration free" ground-state. A Hamiltonian belongs to this class iff it can be represented as $H=\sum_a H_a$ where (1) every term $H_a$ acts non-trivially on a constant number of qubits, (2) every term $H_a$ has real non-positive off-diagonal matrix elements in the standard basis, and (3) the ground-state of $H$ is a ground-state of every term $H_a$. Secondly, we generalize the Cook-Levin theorem proving NP-completeness of the satisfiability problem to the complexity class MA -- a probabilistic analogue of NP. Specifically, we construct a quantum version of the k-SAT problem which we call "stoquastic k-SAT" such that stoquastic k-SAT is contained in MA for any constant $k$, and any promise problem in MA is Karp-reducible to stoquastic 6-SAT. This result provides the first non-trivial example of a MA-complete promise problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Complexity of stoquastic frustration-free Hamiltonians does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of stoquastic frustration-free Hamiltonians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of stoquastic frustration-free Hamiltonians will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-264297

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.