Spin network quantum simulator
From MaRDI portal
Abstract: We propose a general setting for a universal representation of the quantum structure on which quantum information stands, whose dynamical evolution (information manipulation) is based on angular momentum recoupling theory. Such scheme complies with the notion of 'quantum simulator' in the sense of Feynmann, and is shown to be related with the topological quantum field theory approach to quantum computation.
Recommendations
Cites work
- scientific article; zbMATH DE number 3743203 (Why is no real title available?)
- scientific article; zbMATH DE number 3743204 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3274680 (Why is no real title available?)
- A possible strategy to defeat decoherence in quantum computation: the role of symmetries, dynamical algebras, and all that.
- An efficient upper bound of the rotation distance of binary trees
- Hierarchies of invariant spin models
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Skein theory and Turaev-Viro invariants
Cited in
(25)- Quantum physics, topology, formal languages, computation: a categorical view as homage to David Hilbert
- Braiding, Majorana fermions, Fibonacci particles and topological quantum computing
- ON THE VOLUME CONJECTURE FOR CLASSICAL SPIN NETWORKS
- Entanglement in Valence-Bond-Solid states
- Quantum Computation of Universal Link Invariants
- Exploiting slack time for just-in-time scheduling in wireless sensor networks
- SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION
- Sequential Measurements, Topological Quantum Field Theories, and Topological Quantum Neural Networks
- The `life machine': a quantum metaphor for living matter
- Communication protocols and QECC from the perspective of TQFT. II: QECCs as spacetimes
- Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation
- AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
- Computing spin networks
- Simplicial topological coding and homology of spin networks
- THE FIBONACCI MODEL AND THE TEMPERLEY-LIEB ALGEBRA
- TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT
- Characterization of complex behaviors of TCP/RED computer networks based on nonlinear time series analysis methods
- A novel realization of the Virasoro algebra in number state space
- Finite-time sliding mode flow control design via reduced model for a connection-oriented communication network
- Topology and Quantum Computing
- Performance Analysis of a Multicast Protocol for Wireless Environments
- Enhanced multi-attribute trust protocol for malicious node detection in wireless sensor networks
- q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION
- Entanglement and density matrix of a block of spins in AKLT model
- Meta-entanglement
This page was built for publication: Spin network quantum simulator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1852589)