Categorical computation

Abstract

In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors between two (higher) categories. If from Turing computing to quantum computing is the first quantization of computation, then this new scheme can be viewed as the second quantization of computation. The fundamental problem in realizing this idea is how to realize a (higher) functor physically. We provide a theoretical idea of realizing (higher) functors physically based on the physics of topological orders.

arXiv comment11 pages, comments are welcome

References in corpus (13)

• Fault-tolerant quantum computation by anyons
• Probing Topological Spin Liquids on a Programmable Quantum Simulator
• Direct observation of anyonic braiding statistics at the $\nu$=1/3 fractional quantum Hall state
• Models for gapped boundaries and domain walls
• Choreographed entangle dances: topological states of quantum matter
• On the classification of topological orders
• Four dimensional topological quantum field theory, Hopf categories, and the canonical bases
• Symmetry Protected Topological phases and Generalized Cohomology
• Boundary-bulk relation in topological orders
• Categories of quantum liquids I
• The center functor is fully faithful
• Defects in the 3-dimensional toric code model form a braided fusion 2-category
• Topological orders and factorization homology