Computing spin networks
From MaRDI portal
Publication:2484201
DOI10.1016/j.aop.2005.01.005zbMath1072.81013arXivquant-ph/0410105OpenAlexW3100539275MaRDI QIDQ2484201
Mario Rasetti, Annalisa Marzuoli
Publication date: 1 August 2005
Published in: Annals of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0410105
Related Items (11)
The `life machine': a quantum metaphor for living matter ⋮ TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT ⋮ Microscopic description of 2D topological phases, duality, and 3D state sums ⋮ Coupling of quantum angular momenta: an insight into analogic/discrete and local/global models of computation ⋮ Topological quantum computation on supersymmetric spin chains ⋮ Sequential Measurements, Topological Quantum Field Theories, and Topological Quantum Neural Networks ⋮ AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS ⋮ Universal quantum computation by scattering in the Fermi–Hubbard model ⋮ A novel realization of the Virasoro algebra in number state space ⋮ Quantum Physics, Topology, Formal Languages, Computation: A Categorical View as Homage to David Hilbert ⋮ Quantum Computation of Universal Link Invariants
Uses Software
Cites Work
- Right-arm rotation distance between binary trees
- Bounding restricted rotation distance
- Quantum field theory and the Jones polynomial
- A note on some tree similarity measures
- State sum invariants of 3-manifolds and quantum \(6j\)-symbols
- On the diameter of the rotation graph of binary coupling trees
- Quantum automata and quantum grammars
- Holonomic quantum computation
- Hierarchies of invariant spin models
- An efficient upper bound of the rotation distance of binary trees
- Spin network quantum simulator
- Fault-tolerant quantum computation by anyons
- The monodromy rings of one loop Feynman integrals
- Discrete structures in gravity
- Universal Quantum Simulators
- Quantum Geometry
- A polynomial invariant for knots via von Neumann algebras
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Quantum Complexity Theory
- Introduction to Quantum Computation and Information
- SPIN NETWORK SETTING OF TOPOLOGICAL QUANTUM COMPUTATION
- Dominant topologies in Euclidean quantum gravity
- On the computational complexity of the Jones and Tutte polynomials
- Topological quantum memory
- Quantum information and computation
- Quantum invariants of knots and 3-manifolds
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing spin networks
