Physics, Topology, Logic and Computation: A Rosetta Stone

  title={Physics, Topology, Logic and Computation: A Rosetta Stone},
  author={John C. Baez and Michael Stay},
  journal={Lecture Notes in Physics},
In physics, Feynman diagrams are used to reason about quantum processes. In the 1980s, it became clear that underlying these diagrams is a powerful analogy between quantum physics and topology. Namely, a linear operator behaves very much like a “cobordism”: a manifold representing spacetime, going between two manifolds representing space. This led to a burst of work on topological quantum field theory and “quantum topology”. But this was just the beginning: similar diagrams can be used to… 
Computation and the Periodic Table
  • J. Baez
  • Physics
    2009 24th Annual IEEE Symposium on Logic In Computer Science
  • 2009
This talk is based on work in progress with Paul-Andre Mellies and Mike Stay and an important clue comes from the way symmetric monoidal closed 2-categories describe rewrite rules in the lambda calculus and multiplicative intuitionistic linear logic.
The Abstract Structure of Quantum Algorithms
It is shown that adopting a unified and general language for process theories advances foundations and practical applications of quantum information, and a novel model of quantum blackbox algorithms in non-deterministic classical computation is constructed.
Logical aspects of quantum computation
This thesis begins by demonstrating the effectiveness of string diagrams for practical calculations in category theory, and introduces a parameterized, duality based frame- work for coalgebraic logic, and proves that the semantics of these logics satisfy certain "institution conditions" providing harmony between syntactic and semantic transformations.
Deep Beauty: A Universe of Processes and Some of Its Guises
Our starting point is a particular `canvas' aimed to `draw' theories of physics, which has symmetric monoidal categories as its mathematical backbone. In this paper we consider the conceptual
Categories of Physical Processes
We study the mathematical foundations of physics. We reconstruct textbook quantum theory from a single symmetric monoidal functor $GNS : \mathbf{Phys} \longrightarrow \ast\mathbf{Mod}$, based on the
Categorical quantum circuits
A realization of a dagger-compact category that can model finite-dimensional quantum systems and explicitly allows for the interaction of systems of arbitrary, possibly unequal, dimensions is presented.
Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program
It is argued that partial recursive functions that according to Church’s thesis exhaust the universe of (semi)computable maps are generally not everywhere defined due to potentially infinite searches and loops and can be addressed in the same way as Feynman divergences.
Interacting Quantum Observables: Categorical Algebra and Diagrammatics
The ZX-calculus is introduced, an intuitive and universal graphical calculus for multi-qubit systems, which greatly simplifies derivations in the area of quantum computation and information and axiomatize phase shifts within this framework.
Quantum picturalism
Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the ‘no-cloning theorem’ is easy, and its


Topological Quantum Computation
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones poly-
Simulation of Topological Field Theories¶by Quantum Computers
Abstract: Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a
Frobenius Algebras and 2-D Topological Quantum Field Theories
This 2003 book describes a striking connection between topology and algebra, namely that 2D topological quantum field theories are equivalent to commutative Frobenius algebras. The precise
Quantum Quandaries: a Category-Theoretic Perspective
General relativity may seem very different from quantum theory, but work on quantum gravity has revealed a deep analogy between the two. General relativity makes heavy use of the category nCob, whose
Operads in algebra, topology, and physics
'Operads are powerful tools, and this is the book in which to read about them' - ""Bulletin of the London Mathematical Society"". Operads are mathematical devices that describe algebraic structures
Conservative logic
Conservative logic shows that it is ideally possible to build sequential circuits with zero internal power dissipation and proves that universal computing capabilities are compatible with the reversibility and conservation constraints.
De-linearizing Linearity: Projective Quantum Axiomatics From Strong Compact Closure
  • B. Coecke
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2007
Quantum measurements without sums
Sums play a prominent role in the formalisms of quantum me- chanics, whether for mixing and superposing states, or for composing state spaces. Surprisingly, a conceptual analysis of quantum
A Lambda Calculus for Quantum Computation
A quantum lambda calculus is developed as an alternative model of quantum computation, which combines some of the benefits of both the quantum Turing machine and the quantum circuit models and it is argued that it is equivalent to the Quantum Turing machine.
A Modular Functor Which is Universal¶for Quantum Computation
Abstract:We show that the topological modular functor from Witten–Chern–Simons theory is universal for quantum computation in the sense that a quantum circuit computation can be efficiently