Computing spin networks
From MaRDI portal
Publication:2484201
DOI10.1016/J.AOP.2005.01.005zbMATH Open1072.81013arXivquant-ph/0410105OpenAlexW3100539275MaRDI QIDQ2484201FDOQ2484201
Authors: Annalisa Marzuoli, M. Rasetti 
Publication date: 1 August 2005
Published in: Annals of Physics (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/quant-ph/0410105
Recommendations
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- A polynomial invariant for knots via von Neumann algebras
- Title not available (Why is that?)
- Quantum field theory and the Jones polynomial
- Universal Quantum Simulators
- Quantum Geometry
- Fault-tolerant quantum computation by anyons
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum Complexity Theory
- Introduction to Quantum Computation and Information
- On the computational complexity of the Jones and Tutte polynomials
- Quantum information and computation
- Quantum invariants of knots and 3-manifolds
- State sum invariants of 3-manifolds and quantum \(6j\)-symbols
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topological quantum memory
- Holonomic quantum computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient upper bound of the rotation distance of binary trees
- Discrete structures in gravity
- Quantum automata and quantum grammars
- Bounding restricted rotation distance
- A note on some tree similarity measures
- Right-arm rotation distance between binary trees
- Title not available (Why is that?)
- Dominant topologies in Euclidean quantum gravity
- Spin network quantum simulator
- On the diameter of the rotation graph of binary coupling trees
- SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION
- The monodromy rings of one loop Feynman integrals
- Hierarchies of invariant spin models
Cited In (26)
- Title not available (Why is that?)
- Quantum physics, topology, formal languages, computation: a categorical view as homage to David Hilbert
- Quantum and semiclassical spin networks: from atomic and molecular physics to quantum computing and gravity
- Microscopic description of 2D topological phases, duality, and 3D state sums
- Elements of spin logic
- Quantum ground–state computation with kinematical gates
- TOWARDS NONCOMMUTATIVE COMPUTING
- Quantum Computation of Universal Link Invariants
- Spin network quantum simulator
- Eigenvalue degeneracy relations for a fully connected isotropic spin network
- Holographic software for quantum networks
- Quantum circuits for spin and flavor degrees of freedom of quarks forming nucleons
- SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION
- Topological quantum computation on supersymmetric spin chains
- Sequential Measurements, Topological Quantum Field Theories, and Topological Quantum Neural Networks
- Computing with Tangles
- The `life machine': a quantum metaphor for living matter
- On the circuit paradigm in quantum networks
- Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation
- Universal quantum computation by scattering in the Fermi–Hubbard model
- AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
- Simplicial topological coding and homology of spin networks
- TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT
- A novel realization of the Virasoro algebra in number state space
- Spectral networks with spin
- Title not available (Why is that?)
Uses Software
This page was built for publication: Computing spin networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484201)
