Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Spin Networks, Quantum Topology and Quantum Computation

Louis Hirsch Kauffman, Samuel J. Lomonaco

Published Jan 1, 2007• 0 citations
Publisher
DOI
10.1007/978-3-540-73445-1_18

Related papers

Spin Networks and Anyonic Topological Quantum Computing

Louis Hirsch Kauffman

•Jan 1, 2005•1 citation

Quantum Computing and Quantum Topology

Louis Hirsch Kauffman, Samuel J. Lomonaco

Chapman & Hall/CRC applied mathematics and nonlinear science series•Sep 19, 2007•1 citation

Spin networks and anyonic topological computing II

Louis H. Kauffman, Samuel J. Lomonaco

We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is the Fibonacci model, itself universal for quantum computation. We here formulate these braid group representations in a form suitable for computation and algebraic work.

arXiv:0707.3678•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Apr 27, 2007•1 citation

Non-Euclidean Topology for Quantum Simulation of Spin Networks

Jincheng Zhang

Abstract: We propose a novel method for efficiently simulating spin networks within a non-Euclidean space, leveraging the principles of topological quantum computing. This approach focuses on representing the spin network using a topological representation, simplifying calculations and enhancing the identification of relevant quantum properties. The core claim is that this method will significantly accelerate the simulation of spin networks, offering a potentially more efficient alternative to traditional methods.

•Aug 31, 2026•0 citations

Topology and Quantum Computing

Louis Hirsch Kauffman, Samuel J. Lomonaco

Lecture notes in physics•Nov 7, 2008•4 citations

Permutational quantum computing

Stephen P. Jordan

In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle trajectory, and computes by permuting particles. Whereas topological quantum computation requires anyons, permutational quantum computation can be performed with ordinary spin-1/2 particles, using a variant of the spin-network scheme of Marzuoli and Rasetti. We do not know whether permutational computation is universal. It may represent a new complexity class within BQP. Nevertheless, permutational quantum computers can in polynomial time approximate matrix elements of certain irreducible representations of the symmetric group and approximate certain transition amplitudes from the Ponzano-Regge spin foam model of quantum gravity. No polynomial time classical algorithms for these problems are known.

arXiv:0906.2508•Quantum Information and Computation•May 1, 2010•61 citations
Abstract: We propose a novel method for efficiently simulating spin networks within a non-Euclidean space, leveraging the principles of topological quantum computing. This approach focuses on representing the spin network using a topological representation, simplifying calculations and enhancing the identification of relevant quantum properties. The core claim is that this method will significantly accelerate the simulation of spin networks, offering a potentially more efficient alternative to traditional methods.
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle trajectory, and computes by permuting particles. Whereas topological quantum computation requires anyons, permutational quantum computation can be performed with ordinary spin-1/2 particles, using a variant of the spin-network scheme of Marzuoli and Rasetti. We do not know whether permutational computation is universal. It may represent a new complexity class within BQP. Nevertheless, permutational quantum computers can in polynomial time approximate matrix elements of certain irreducible representations of the symmetric group and approximate certain transition amplitudes from the Ponzano-Regge spin foam model of quantum gravity. No polynomial time classical algorithms for these problems are known.