1,619 research outputs found
Quantum Commuting Circuits and Complexity of Ising Partition Functions
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum
computation consisting only of commuting two-qubit gates and is not universal
in the sense of standard quantum computation. Nevertheless, it has been shown
that if there is a classical algorithm that can simulate IQP efficiently, the
polynomial hierarchy (PH) collapses at the third level, which is highly
implausible. However, the origin of the classical intractability is still less
understood. Here we establish a relationship between IQP and computational
complexity of the partition functions of Ising models. We apply the established
relationship in two opposite directions. One direction is to find subclasses of
IQP that are classically efficiently simulatable in the strong sense, by using
exact solvability of certain types of Ising models. Another direction is
applying quantum computational complexity of IQP to investigate (im)possibility
of efficient classical approximations of Ising models with imaginary coupling
constants. Specifically, we show that there is no fully polynomial randomized
approximation scheme (FPRAS) for Ising models with almost all imaginary
coupling constants even on a planar graph of a bounded degree, unless the PH
collapses at the third level. Furthermore, we also show a multiplicative
approximation of such a class of Ising partition functions is at least as hard
as a multiplicative approximation for the output distribution of an arbitrary
quantum circuit.Comment: 36 pages, 5 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
- …