4 research outputs found
Classical spin systems and the quantum stabilizer formalism: general mappings and applications
We present general mappings between classical spin systems and quantum
physics. More precisely, we show how to express partition functions and
correlation functions of arbitrary classical spin models as inner products
between quantum stabilizer states and product states, thereby generalizing
mappings for some specific models established in [Phys. Rev. Lett. 98, 117207
(2007)]. For Ising- and Potts-type models with and without external magnetic
field, we show how the entanglement features of the corresponding stabilizer
states are related to the interaction pattern of the classical model, while the
choice of product states encodes the details of interaction. These mappings
establish a link between the fields of classical statistical mechanics and
quantum information theory, which we utilize to transfer techniques and methods
developed in one field to gain insight into the other. For example, we use
quantum information techniques to recover well known duality relations and
local symmetries of classical models in a simple way, and provide new classical
simulation methods to simulate certain types of classical spin models. We show
that in this way all inhomogeneous models of q-dimensional spins with pairwise
interaction pattern specified by a graph of bounded tree-width can be simulated
efficiently. Finally, we show relations between classical spin models and
measurement-based quantum computation.Comment: 24 pages, 5 figures, minor corrections, version as accepted in JM
Concatenated tensor network states
We introduce the concept of concatenated tensor networks to efficiently
describe quantum states. We show that the corresponding concatenated tensor
network states can efficiently describe time evolution and possess arbitrary
block-wise entanglement and long-ranged correlations. We illustrate the
approach for the enhancement of matrix product states, i.e. 1D tensor networks,
where we replace each of the matrices of the original matrix product state with
another 1D tensor network. This procedure yields a 2D tensor network, which
includes -- already for tensor dimension two -- all states that can be prepared
by circuits of polynomially many (possibly non-unitary) two-qubit quantum
operations, as well as states resulting from time evolution with respect to
Hamiltonians with short-ranged interactions. We investigate the possibility to
efficiently extract information from these states, which serves as the basic
step in a variational optimization procedure. To this aim we utilize known
exact and approximate methods for 2D tensor networks and demonstrate some
improvements thereof, which are also applicable e.g. in the context of 2D
projected entangled pair states. We generalize the approach to higher
dimensional- and tree tensor networks.Comment: 16 pages, 4 figure
Completeness of classical spin models and universal quantum computation
We study mappings between distinct classical spin systems that leave the
partition function invariant. As recently shown in [Phys. Rev. Lett. 100,
110501 (2008)], the partition function of the 2D square lattice Ising model in
the presence of an inhomogeneous magnetic field, can specialize to the
partition function of any Ising system on an arbitrary graph. In this sense the
2D Ising model is said to be "complete". However, in order to obtain the above
result, the coupling strengths on the 2D lattice must assume complex values,
and thus do not allow for a physical interpretation. Here we show how a
complete model with real -and, hence, "physical"- couplings can be obtained if
the 3D Ising model is considered. We furthermore show how to map general
q-state systems with possibly many-body interactions to the 2D Ising model with
complex parameters, and give completeness results for these models with real
parameters. We also demonstrate that the computational overhead in these
constructions is in all relevant cases polynomial. These results are proved by
invoking a recently found cross-connection between statistical mechanics and
quantum information theory, where partition functions are expressed as quantum
mechanical amplitudes. Within this framework, there exists a natural
correspondence between many-body quantum states that allow universal quantum
computation via local measurements only, and complete classical spin systems.Comment: 43 pages, 28 figure
Topological Color Codes and Two-Body Quantum Lattice Hamiltonians
Topological color codes are among the stabilizer codes with remarkable
properties from quantum information perspective. In this paper we construct a
four-valent lattice, the so called ruby lattice, governed by a 2-body
Hamiltonian. In a particular regime of coupling constants, degenerate
perturbation theory implies that the low energy spectrum of the model can be
described by a many-body effective Hamiltonian, which encodes the color code as
its ground state subspace. The gauge symmetry
of color code could already be realized by
identifying three distinct plaquette operators on the lattice. Plaquettes are
extended to closed strings or string-net structures. Non-contractible closed
strings winding the space commute with Hamiltonian but not always with each
other giving rise to exact topological degeneracy of the model. Connection to
2-colexes can be established at the non-perturbative level. The particular
structure of the 2-body Hamiltonian provides a fruitful interpretation in terms
of mapping to bosons coupled to effective spins. We show that high energy
excitations of the model have fermionic statistics. They form three families of
high energy excitations each of one color. Furthermore, we show that they
belong to a particular family of topological charges. Also, we use
Jordan-Wigner transformation in order to test the integrability of the model
via introducing of Majorana fermions. The four-valent structure of the lattice
prevents to reduce the fermionized Hamiltonian into a quadratic form due to
interacting gauge fields. We also propose another construction for 2-body
Hamiltonian based on the connection between color codes and cluster states. We
discuss this latter approach along the construction based on the ruby lattice.Comment: 56 pages, 16 figures, published version