Measurement-based quantum computation is different from other approaches for quantum
computation, in that everything needs to be done is only local measurement on a certain …

We introduce a new model of interacting spin 1/2. It describes interactions of three nearest
neighbors. The Hamiltonian can be expressed in terms of Fredkin gates. The Fredkin gate …

Frustration-free (FF) spin chains have a property that their ground state minimizes all
individual terms in the chain Hamiltonian. We ask how entangled the ground state of a FF …

We show that quantum nondemolition (QND) measurements can be used to realize
measurement-based imaginary-time evolution. In our proposed scheme, repeated weak …

We prove that estimating the ground state energy of a translationally invariant, nearest-
neighbour Hamiltonian on a 1D spin chain is QMA _ EXP QMA EXP-complete, even for …

Recently, it was shown that the non-local correlations needed for measurement-based
quantum computation (MBQC) can be revealed in the ground state of the Affleck–Kennedy …

We demonstrate that the spin-2 Affleck-Kennedy-Lieb-Tasaki (AKLT) state on a square
lattice is a universal resource for measurement-based quantum computation. Our proof is …

The most famous example of a spin chain is the XXX Heisenberg model. The density of the
Hamiltonian can be expressed as a permutation operator [swap gate]. Faddeev represented …

Traditional quantum physics solves ground states for a given Hamiltonian, while quantum
information science asks for the existence and construction of certain Hamiltonians for given …

We present exact results on the exactly solvable spin chain of Bravyi et al.[Phys. Rev. Lett.
109, 207202 (2012)]. This model is a spin one chain and has a Hamiltonian that is local and …