REVIEW 1 cited by
Complexity of commuting Hamiltonians on a square lattice of qubits
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Complexity of commuting Hamiltonians on a square lattice of qubits
read the original abstract
We consider the computational complexity of Hamiltonians which are sums of commuting terms acting on plaquettes in a square lattice of qubits, and we show that deciding whether the ground state minimizes the energy of each local term individually is in the complexity class NP. That is, if the ground states has this property, this can be proven using a classical certificate which can be efficiently verified on a classical computer. Different to previous results on commuting Hamiltonians, our certificate proves the existence of such a state without giving instructions on how to prepare it.
Forward citations
Cited by 1 Pith paper
-
The Complexity of Local Stoquastic Hamiltonians on 2D Lattices
The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.