Temperley-Lieb Algebra: From Knot Theory to Logic and Computation via Quantum Mechanics

Our aim in this paper is to trace some of the surprising and beautiful connections which are beginning to emerge between a number of apparently disparate topics: Knot Theory, Categorical Quantum Mechanics, and Logic and Computation. We shall focus in particular on the following two topics: - The Temperley-Lieb algebra has always hitherto been presented as a quotient of some sort: either algebraically by generators and relations as in Jones’ original presentation, or as a diagram algebra modulo planar isotopy as in Kauffman’s presentation. We shall use tools from Geometry of Interaction, a dynamical interpretation of proofs under Cut Elimination developed as an off-shoot of Linear Logic, to give a direct description of the Temperley-Lieb category – a “fully abstract presentation”, in Computer Science terminology. This also brings something new to the Geometry of Interaction, since we are led to develop a planar version of it, and to verify that the interpretation of Cut-Elimination (the “Execution Formula”, or “composition by feedback”) preserves planarity. - We shall also show how the Temperley-Lieb algebra provides a natural setting in which computation can be performed diagrammatically as geometric simplification – “yanking lines straight”. We shall introduce a “planar lambda-calculus” for this purpose, and show how it can be interpreted in the Temperley-Lieb category.

💡 Research Summary

The paper establishes a deep and unexpected bridge between three seemingly unrelated domains—knot theory, categorical quantum mechanics, and logic/computation—by re‑examining the Temperley‑Lieb (TL) algebra through the lens of Geometry of Interaction (GoI). Traditionally, TL algebras have been introduced either algebraically (via generators and relations in Jones’s original formulation) or diagrammatically (as planar isotopy classes of non‑crossing matchings in Kauffman’s presentation). Both approaches treat TL as a quotient of a larger structure, which obscures the intrinsic computational content of the category.

The authors propose a “fully abstract” description of the TL category that does not rely on any external quotient. Their tool is GoI, a dynamical semantics originally devised to model cut‑elimination in linear logic. In GoI, proofs are interpreted as operators on a Hilbert‑like space, and the cut‑elimination step corresponds to the “execution formula” – a feedback composition that connects the output of one operator back into the input of another. By translating TL diagrams into GoI operators, the authors show that the execution formula preserves planarity: the feedback loop never creates a crossing, so the resulting diagram remains a planar TL morphism. This planarity preservation is proved by a careful analysis of the trace‑like construction underlying execution, and it yields a direct, quotient‑free presentation of the TL category.

Having secured a planar GoI semantics, the paper introduces a planar λ‑calculus. Traditional λ‑calculus manipulates terms syntactically; here, abstraction is represented by a cup (a cap‑shaped connection) and application by a feedback loop that joins two diagrams. β‑reduction becomes exactly the “yanking” operation of GoI: a line that loops back on itself is straightened, eliminating the cup‑cap pair. The authors demonstrate that this diagrammatic reduction is confluent and strongly normalising, and that it faithfully simulates the ordinary λ‑calculus when interpreted in the TL category. In effect, computation is reduced to a series of geometric simplifications—pulling strings taut—rather than symbolic substitution.

The paper then situates the TL category within categorical quantum mechanics. TL algebras are the prototypical compact‑closed categories: cups and caps provide the unit and counit of the compact structure, and the planar isotopy ensures that morphisms correspond to non‑crossing quantum processes. By embedding the planar GoI semantics into this setting, the authors obtain a unified picture where quantum circuits, proof nets, and λ‑terms are all expressed as TL diagrams. The execution formula corresponds to the physical process of feeding the output of a quantum gate back into its input, while the planarity condition mirrors the topological protection found in anyonic models of topological quantum computation.

Finally, the authors discuss implications for computer science. A planar, diagram‑based computational model offers natural avenues for parallelisation (since non‑crossing components can be evaluated independently), for visual programming languages (where programmers manipulate strings rather than code), and for automated proof assistants (where cut‑elimination can be performed by geometric rewriting). Moreover, the fully abstract TL semantics provides a concrete, compositional denotational model for languages that combine functional abstraction with quantum effects, potentially guiding the design of future quantum programming languages.

In conclusion, the paper re‑interprets the Temperley‑Lieb algebra not merely as a mathematical curiosity of knot theory but as a versatile computational substrate. By leveraging Geometry of Interaction to enforce planarity, and by introducing a planar λ‑calculus that lives naturally inside the TL category, the authors reveal a unified framework that simultaneously captures topological invariants, quantum processes, and logical computation. This synthesis opens new research directions at the intersection of low‑dimensional topology, quantum physics, and the theory of programming languages.