pith. sign in

arxiv: 1702.08830 · v1 · pith:G53MH6HCnew · submitted 2017-02-28 · 🪐 quant-ph · cs.CC

The Complexity of Translationally-Invariant Low-Dimensional Spin Lattices in 3D

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

In this paper, we consider spin systems in three spatial dimensions, and prove that the local Hamiltonian problem for 3D lattices with face-centered cubic unit cells, 4-local translationally-invariant interactions between spin-3/2 particles and open boundary conditions is QMAEXP-complete. We go beyond a mere embedding of past hard 1D history state constructions, and utilize a classical Wang tiling problem as binary counter in order to translate one cube side length into a binary description for the verifier input. We further make use of a recently-developed computational model especially well-suited for history state constructions, and combine it with a specific circuit encoding shown to be universal for quantum computation. These novel techniques allow us to significantly lower the local spin dimension, surpassing the best translationally-invariant result to date by two orders of magnitude (in the number of degrees of freedom per coupling). This brings our models en par with the best non-translationally-invariant construction.

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.