Abstract

Boolean circuits are used to represent programs on finite data. Reversible Boolean circuits and quantum Boolean circuits have been introduced to modelize some physical aspects of computation. Those notions are essential in complexity theory, but we claim that a deep mathematical theory is needed to make progress in this area. For that purpose, the recent developments of knot theory is a major source of inspiration. Following the ideas of Burroni, we consider logical gates as generators for some algebraic structure with two compositions, and we are interested in the relations satisfied by those generators. For that purpose, we introduce canonical forms and rewriting systems. Up to now, we have mainly studied the basic case and the linear case, but we hope that our methods can be used to get presentations by generators and relations for the (reversible) classical case and for the (unitary) quantum case.

Citations

152	Functorial Semantics of Algebraic Theories - Lawvere - 1963
56	Categories for the Working - Lane - 1971
18	A new finiteness condition for monoids presented by complete rewriting systems (after Craig - Lafont - 1995
16	Equational Reasoning with 2-Dimensional Diagrams - Lafont - 1995
11	Church-Rosser property and homology of monoids - Lafont, Prouté - 1991
5	diagrams and 2-dimensional rewriting - Lafont, Penrose - 1992
3	Minimality of the system of seven equations for the category of finite sets. Theoretical Computer Science - Massol - 1997
1	Calcul symbolique avec des diagrammes de Penrose, thèse de doctorat, Université d’Aix-Marseille - Massol - 1997
1	Générateurs et relations pour les circuits booléens réversibles, rapport de stage, Institut de Mathématiques de Luminy, preprint 97-32 - Musset - 1987