Computing with Coloured Tangles
arXiv:1408.2685 · doi:10.3390/sym7031289
Abstract
We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated coloured tangle, similar to those that appear in low dimensional topology, plays the role of a circuit diagram. Equivalent diagrams represent bisimilar computations. We prove that our model of computation is Turing complete, and that with bounded resources it can moreover decide any language in complexity class IP, sometimes with better performance parameters than corresponding classical protocols.
arXiv comment36 pages,; Introduction entirely rewritten, Section 4.3 added
References in corpus (8)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- Physics, Topology, Logic and Computation: A Rosetta Stone
- Braiding Operators are Universal Quantum Gates
- Anyons from non-solvable finite groups are sufficient for universal quantum computation
- Fixing the functoriality of Khovanov homology
- GLC actors, artificial chemical connectomes, topological issues and knots
- Tangle Machines