pith. sign in

arxiv: 1506.04014 · v2 · pith:OCTGJ7PCnew · submitted 2015-06-12 · 🪐 quant-ph · cs.CC

The complexity of antiferromagnetic interactions and 2D lattices

classification 🪐 quant-ph cs.CC
keywords localantiferromagneticinteractionsqma-completehamiltonianprobleminteractionrestricted
0
0 comments X
read the original abstract

Estimation of the minimum eigenvalue of a quantum Hamiltonian can be formalised as the Local Hamiltonian problem. We study the natural special case of the Local Hamiltonian problem where the same 2-local interaction, with differing weights, is applied across each pair of qubits. First we consider antiferromagnetic/ferromagnetic interactions, where the weights of the terms in the Hamiltonian are restricted to all be of the same sign. We show that for symmetric 2-local interactions with no 1-local part, the problem is either QMA-complete or in StoqMA. In particular the antiferromagnetic Heisenberg and antiferromagnetic XY interactions are shown to be QMA-complete. We also prove StoqMA-completeness of the antiferromagnetic transverse field Ising model. Second, we study the Local Hamiltonian problem under the restriction that the interaction terms can only be chosen to lie on a particular graph. We prove that nearly all of the QMA-complete 2-local interactions remain QMA-complete when restricted to a 2D square lattice. Finally we consider both restrictions at the same time and discover that, with the exception of the antiferromagnetic Heisenberg interaction, all of the interactions which are QMA-complete with positive coefficients remain QMA-complete when restricted to a 2D triangular lattice.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians

    quant-ph 2026-05 unverdicted novelty 6.0

    Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.

  2. On the Complexity of the Succinct State Local Hamiltonian Problem

    quant-ph 2025-09 unverdicted novelty 6.0

    The succinct state 2-local Hamiltonian problem for qubit Hamiltonians is promise-MA-complete.

  3. The Complexity of Local Stoquastic Hamiltonians on 2D Lattices

    quant-ph 2025-02 unverdicted novelty 5.0

    The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.