Computing spin networks
From MaRDI portal
Publication:2484201
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3180958 (Why is no real title available?)
- scientific article; zbMATH DE number 3743203 (Why is no real title available?)
- scientific article; zbMATH DE number 34890 (Why is no real title available?)
- scientific article; zbMATH DE number 50691 (Why is no real title available?)
- scientific article; zbMATH DE number 3467565 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1235471 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1161281 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 782139 (Why is no real title available?)
- A note on some tree similarity measures
- A polynomial invariant for knots via von Neumann algebras
- An efficient upper bound of the rotation distance of binary trees
- Bounding restricted rotation distance
- Discrete structures in gravity
- Dominant topologies in Euclidean quantum gravity
- Fault-tolerant quantum computation by anyons
- Hierarchies of invariant spin models
- Holonomic quantum computation
- Introduction to Quantum Computation and Information
- On the computational complexity of the Jones and Tutte polynomials
- On the diameter of the rotation graph of binary coupling trees
- Quantum Complexity Theory
- Quantum Geometry
- Quantum automata and quantum grammars
- Quantum field theory and the Jones polynomial
- Quantum information and computation
- Quantum invariants of knots and 3-manifolds
- Right-arm rotation distance between binary trees
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION
- Spin network quantum simulator
- State sum invariants of 3-manifolds and quantum \(6j\)-symbols
- The On-Line Encyclopedia of Integer Sequences
- The monodromy rings of one loop Feynman integrals
- Topological quantum memory
- Universal Quantum Simulators
Cited in
(26)- Microscopic description of 2D topological phases, duality, and 3D state sums
- Elements of spin logic
- scientific article; zbMATH DE number 5832281 (Why is no real title available?)
- Quantum and semiclassical spin networks: from atomic and molecular physics to quantum computing and gravity
- Quantum physics, topology, formal languages, computation: a categorical view as homage to David Hilbert
- Quantum ground–state computation with kinematical gates
- TOWARDS NONCOMMUTATIVE COMPUTING
- Spin network quantum simulator
- Quantum Computation of Universal Link Invariants
- Holographic software for quantum networks
- Quantum circuits for spin and flavor degrees of freedom of quarks forming nucleons
- Eigenvalue degeneracy relations for a fully connected isotropic spin network
- 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
- The `life machine': a quantum metaphor for living matter
- Computing with Tangles
- Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation
- On the circuit paradigm in quantum networks
- 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
- scientific article; zbMATH DE number 915619 (Why is no real title available?)
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)
