Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Spin networks, quantum automata and link invariants

Garnerone, S., Marzuoli, A., Mario Rasetti, Phys. Conf. Ser, J.

Published Jan 1, 2006• 8 citations
OpenAlex

Abstract

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. 1 1

Related papers

Spin networks, quantum automata and link invariants

Silvano Garnerone, Annalisa Marzuoli, Mario Rasetti

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.

arXiv:gr-qc/0511161•Journal of Physics Conference Series•Mar 1, 2006•6 citations

Quantum automata, braid group and link polynomials

Silvano Garnerone, Annalisa Marzuoli, Mario Rasetti

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.

arXiv:quant-ph/0601169•Quantum Information and Computation•Jul 1, 2007•34 citations

Quantum Computation of Universal Link Invariants

Silvano Garnerone, Annalisa Marzuoli, Mario Rasetti

In the framework of the spin-network simulator based on the SU q(2) tensor algebra, we implement families of finite state quantum automata capable of accepting the language generated by the braid group, and whose transition amplitudes are coloured Jones polynomials. The automaton calculation of the polynomial of a link L on n strands at any fixed root of unity q is 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 n, on the other.

Open Systems & Information Dynamics•Nov 13, 2006•9 citations

SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION

Annalisa Marzuoli, Mario Rasetti

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 (TQFTs). The key tool is provided by the fiber space structure underlying the model which exhibits combinatorial properties closely related to SU (2) state sum models, widely employed in discretizing TQFTs and quantum gravity in low spacetime dimensions.

arXiv:quant-ph/0407119•International Journal of Quantum Information•Dec 16, 2004•16 citations

BRAIDING AND ENTANGLEMENT IN SPIN NETWORKS: A COMBINATORIAL APPROACH TO TOPOLOGICAL PHASES

Zoltán Kádár, Annalisa Marzuoli, Mario Rasetti

The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q = root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin network automata are able to perform efficiently approximate calculations of topological invarians of knots and 3-manifolds. The same algebraic background is shared by 2D lattice models supporting topological phases of matter that have recently gained much interest in condensed matter physics. These developments are motivated by the possibility to store quantum information fault-tolerantly in a physical system supporting fractional statistics since a part of the associated Hilbert space is insensitive to local perturbations. Most of currently addressed approaches are framed within a "double" quantum Chern–Simons field theory, whose quantum amplitudes represent evolution histories of local lattice degrees of freedom. We propose here a novel combinatorial approach based on "state sum" models of the Turaev–Viro type associated with SU(2)q-colored triangulations of the ambient 3-manifolds. We argue that boundary 2D lattice models (as well as observables in the form of colored graphs satisfying braiding relations) could be consistently addressed. This is supported by the proof that the Hamiltonian of the Levin–Wen condensed string net model in a surface Σ coincides with the corresponding Turaev–Viro amplitude on Σ × [0,1] presented in the last section.

arXiv:0806.3883•International Journal of Quantum Information•Jan 1, 2009•33 citations

Computing Spin Networks

Annalisa Marzuoli, Mario Rasetti

We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum information manipulation is based on the (re)coupling theory of SU(2) angular momenta. Such scheme automatically incorporates all the essential features that make quantum information encoding much more efficient than classical: it is fully discrete; it deals with inherently entangled states, naturally endowed with a tensor product structure; it allows for generic encoding patterns. The model proposed can be thought of as the non-Boolean generalization of the quantum circuit model, with unitary gates expressed in terms of 3nj coefficients connecting inequivalent binary coupling schemes of n+1 angular momentum variables, as well as Wigner rotations in the eigenspace of the total angular momentum. A crucial role is played by elementary j-gates (6j symbols) which satisfy algebraic identities that make the structure of the model similar to "state sum models", employed in discretizing Topological Quantum Field Theories and quantum gravity. The spin network simulator can thus be viewed also as a Combinatorial QFT model for computation. The semiclassical limit (large j's) is discussed.

•Oct 13, 2004•47 citations
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. 1 1
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.
The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2)SU(2)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 LLL on 2N2N2N 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 2N2N2N, on the other. The growth rate of the time complexity function in terms of the integer kkk appearing in the root of unity qqq can be estimated to be (polynomially) bounded by resorting to the field theoretical background given by the Chern--Simons theory.
In the framework of the spin-network simulator based on the SU q(2) tensor algebra, we implement families of finite state quantum automata capable of accepting the language generated by the braid group, and whose transition amplitudes are coloured Jones polynomials. The automaton calculation of the polynomial of a link L on n strands at any fixed root of unity q is 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 n, on the other.
The spin network quantum simulator relies on the su(2) representation ring (or its q-deformed counterpart at q = root of unity) and its basic features naturally include (multipartite) entanglement and braiding. In particular, q-deformed spin network automata are able to perform efficiently approximate calculations of topological invarians of knots and 3-manifolds. The same algebraic background is shared by 2D lattice models supporting topological phases of matter that have recently gained much interest in condensed matter physics. These developments are motivated by the possibility to store quantum information fault-tolerantly in a physical system supporting fractional statistics since a part of the associated Hilbert space is insensitive to local perturbations. Most of currently addressed approaches are framed within a "double" quantum Chern–Simons field theory, whose quantum amplitudes represent evolution histories of local lattice degrees of freedom. We propose here a novel combinatorial approach based on "state sum" models of the Turaev–Viro type associated with SU(2)q-colored triangulations of the ambient 3-manifolds. We argue that boundary 2D lattice models (as well as observables in the form of colored graphs satisfying braiding relations) could be consistently addressed. This is supported by the proof that the Hamiltonian of the Levin–Wen condensed string net model in a surface Σ coincides with the corresponding Turaev–Viro amplitude on Σ × [0,1] presented in the last section.
We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum information manipulation is based on the (re)coupling theory of SU(2) angular momenta. Such scheme automatically incorporates all the essential features that make quantum information encoding much more efficient than classical: it is fully discrete; it deals with inherently entangled states, naturally endowed with a tensor product structure; it allows for generic encoding patterns. The model proposed can be thought of as the non-Boolean generalization of the quantum circuit model, with unitary gates expressed in terms of 3nj coefficients connecting inequivalent binary coupling schemes of n+1 angular momentum variables, as well as Wigner rotations in the eigenspace of the total angular momentum. A crucial role is played by elementary j-gates (6j symbols) which satisfy algebraic identities that make the structure of the model similar to "state sum models", employed in discretizing Topological Quantum Field Theories and quantum gravity. The spin network simulator can thus be viewed also as a Combinatorial QFT model for computation. The semiclassical limit (large j's) is discussed.