21 research outputs found
Quantum Knitting
We analyze the connections between the mathematical theory of knots and
quantum physics by addressing a number of algorithmic questions related to both
knots and braid groups.
Knots can be distinguished by means of `knot invariants', among which the
Jones polynomial plays a prominent role, since it can be associated with
observables in topological quantum field theory.
Although the problem of computing the Jones polynomial is intractable in the
framework of classical complexity theory, it has been recently recognized that
a quantum computer is capable of approximating it in an efficient way. The
quantum algorithms discussed here represent a breakthrough for quantum
computation, since approximating the Jones polynomial is actually a `universal
problem', namely the hardest problem that a quantum computer can efficiently
handle.Comment: 29 pages, 5 figures; to appear in Laser Journa
Quantum geometry and quantum algorithms
Motivated by algorithmic problems arising in quantum field theories whose
dynamical variables are geometric in nature, we provide a quantum algorithm
that efficiently approximates the colored Jones polynomial. The construction is
based on the complete solution of Chern-Simons topological quantum field theory
and its connection to Wess-Zumino-Witten conformal field theory. The colored
Jones polynomial is expressed as the expectation value of the evolution of the
q-deformed spin-network quantum automaton. A quantum circuit is constructed
capable of simulating the automaton and hence of computing such expectation
value. The latter is efficiently approximated using a standard sampling
procedure in quantum computation.Comment: Submitted to J. Phys. A: Math-Gen, for the special issue ``The
Quantum Universe'' in honor of G. C. Ghirard
Spin networks, quantum automata and link invariants
The spin network simulator model represents a bridge between (generalized)
circuit schemes for standard quantum computation and approaches based on
notions from Topological Quantum Field Theories (TQFT). More precisely, when
working with purely discrete unitary gates, the simulator is naturally modelled
as families of quantum automata which in turn represent discrete versions of
topological quantum computation models. Such a quantum combinatorial scheme,
which essentially encodes SU(2) Racah--Wigner algebra and its braided
counterpart, is particularly suitable to address problems in topology and group
theory and we discuss here a finite states--quantum automaton able to accept
the language of braid group in view of applications to the problem of
estimating link polynomials in Chern--Simons field theory.Comment: LateX,19 pages; to appear in the Proc. of "Constrained Dynamics and
Quantum Gravity (QG05), Cala Gonone (Italy) September 12-16 200
Entanglement and Density Matrix of a Block of Spins in AKLT Model
We study a 1-dimensional AKLT spin chain, consisting of spins in the bulk
and at both ends. The unique ground state of this AKLT model is described
by the Valence-Bond-Solid (VBS) state. We investigate the density matrix of a
contiguous block of bulk spins in this ground state. It is shown that the
density matrix is a projector onto a subspace of dimension . This
subspace is described by non-zero eigenvalues and corresponding eigenvectors of
the density matrix. We prove that for large block the von Neumann entropy
coincides with Renyi entropy and is equal to .Comment: Revised version, typos corrected, references added, 31 page