1,451 research outputs found
Quantum automata, braid group and link polynomials
The spin--network quantum simulator model, which essentially encodes the
(quantum deformed) SU(2) Racah--Wigner tensor algebra, is particularly suitable
to address problems arising in low dimensional topology and group theory. In
this combinatorial framework we implement families of finite--states and
discrete--time quantum automata capable of accepting the language generated by
the braid group, and whose transition amplitudes are colored Jones polynomials.
The automaton calculation of the polynomial of (the plat closure of) a link L
on 2N strands at any fixed root of unity is shown to be bounded from above by a
linear function of the number of crossings of the link, on the one hand, and
polynomially bounded in terms of the braid index 2N, on the other. The growth
rate of the time complexity function in terms of the integer k appearing in the
root of unity q can be estimated to be (polynomially) bounded by resorting to
the field theoretical background given by the Chern-Simons theory.Comment: Latex, 36 pages, 11 figure
Anyons in Geometric Models of Matter
We show that the "geometric models of matter" approach proposed by the first
author can be used to construct models of anyon quasiparticles with fractional
quantum numbers, using 4-dimensional edge-cone orbifold geometries with
orbifold singularities along embedded 2-dimensional surfaces. The anyon states
arise through the braid representation of surface braids wrapped around the
orbifold singularities, coming from multisections of the orbifold normal bundle
of the embedded surface. We show that the resulting braid representations can
give rise to a universal quantum computer.Comment: 22 pages LaTe
A Prehistory of n-Categorical Physics
This paper traces the growing role of categories and n-categories in physics,
starting with groups and their role in relativity, and leading up to more
sophisticated concepts which manifest themselves in Feynman diagrams, spin
networks, string theory, loop quantum gravity, and topological quantum field
theory. Our chronology ends around 2000, with just a taste of later
developments such as open-closed topological string theory, the
categorification of quantum groups, Khovanov homology, and Lurie's work on the
classification of topological quantum field theories.Comment: 129 pages, 8 eps figure
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
Shaded Tangles for the Design and Verification of Quantum Programs (Extended Abstract)
We give a scheme for interpreting shaded tangles as quantum programs, with
the property that isotopic tangles yield equivalent programs. We analyze many
known quantum programs in this way -- including entanglement manipulation and
error correction -- and in each case present a fully-topological formal
verification, yielding in several cases substantial new insight into how the
program works. We also use our methods to identify several new or generalized
procedures.Comment: In Proceedings QPL 2017, arXiv:1802.0973
- …