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.
The paper proposes a general setting for the quantum structure of quantum information. The framework is a non-Boolean generalization of the quantum circuit model based on a combinatorial approach to spin networks. After a careful description of computational Hilbert spaces, gates are defined as unitary transformations on these spaces. If the spin network quantum circuit is defined, one deals with semi-classical and SU(2) state sum models on the one hand, and spin network together with topological quantum computation, on the other hand.
Recommendations
Cites work
- 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
- 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?)
- 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 automata and quantum grammars
- Quantum Complexity Theory
- Quantum field theory and the Jones polynomial
- Quantum Geometry
- 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 quantum simulator
- SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION
- State sum invariants of 3-manifolds and quantum \(6j\)-symbols
- The monodromy rings of one loop Feynman integrals
- The On-Line Encyclopedia of Integer Sequences
- Topological quantum memory
- Universal Quantum Simulators
Cited in
(26)- Holographic software for quantum networks
- Spin network quantum simulator
- The `life machine': a quantum metaphor for living matter
- Elements of spin logic
- Quantum ground–state computation with kinematical gates
- scientific article; zbMATH DE number 5832281 (Why is no real title available?)
- Eigenvalue degeneracy relations for a fully connected isotropic spin network
- Quantum Computation of Universal Link Invariants
- AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
- Quantum and semiclassical spin networks: from atomic and molecular physics to quantum computing and gravity
- Quantum circuits for spin and flavor degrees of freedom of quarks forming nucleons
- Simplicial topological coding and homology of spin networks
- SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION
- On the circuit paradigm in quantum networks
- scientific article; zbMATH DE number 915619 (Why is no real title available?)
- Spectral networks with spin
- Universal quantum computation by scattering in the Fermi–Hubbard model
- Quantum physics, topology, formal languages, computation: a categorical view as homage to David Hilbert
- TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT
- TOWARDS NONCOMMUTATIVE COMPUTING
- Computing with Tangles
- Topological quantum computation on supersymmetric spin chains
- Microscopic description of 2D topological phases, duality, and 3D state sums
- Sequential Measurements, Topological Quantum Field Theories, and Topological Quantum Neural Networks
- A novel realization of the Virasoro algebra in number state space
- Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation
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)
