Related papers: Automata and one-dimensional TQFTs with defects
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
We give an introduction for the non-expert to TQFT (Topological Quantum Field Theory), focussing especially on its role in algebraic topology. We compare the Atiyah axioms for TQFT with the Eilenberg Steenrod axioms for homology, give a few…
We present a novel automata-based approach to address linear temporal logic modulo theory (LTL-MT) as a specification language for data words. LTL-MT extends LTL_f by replacing atomic propositions with quantifier-free multi-sorted…
The orbifold construction via topological defects in quantum field theory can either be understood as a state sum construction internal to a given ambient theory, or as the procedure of (identifying and) gauging ordinary and…
Quantum field theory has various projective characteristics which are captured by what are called anomalies. This paper explores this idea in the context of fully-extended three-dimensional topological quantum field theories (TQFTs). Given…
We design Latvian quantum finite state automata (LQFAs for short) recognizing unary regular languages with isolated cut point 1/2. From an architectural point of view, we combine two LQFAs recognizing with isolated cut point, respectively,…
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial…
For p>3 a prime, and g>2 an integer, we use Topological Quantum Field Theory (TQFT) to study a family of p-1 highest weight modules L_p(lambda) for the symplectic group Sp(2g,K) where K is an algebraically closed field of characteristic p.…
A two-dimensional finite automaton has a read-only input head that moves in four directions on a finite array of cells labelled by symbols of the input alphabet. A three-way two-dimensional automaton is prohibited from making upward moves,…
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound $ s $…
We study the cohomology of $G$-representation varieties and $G$-character stacks by means of a topological quantum field theory (TQFT). This TQFT is constructed as the composite of a so-called field theory and the 6-functor formalism of…
We study 1-way quantum finite automata (QFAs) and compare them with their classical counterparts. We show that 1-way QFAs can be very space efficient. We construct a 1-way QFAs that are quadratically smaller than any equivalent…
We study quantized non-local order parameters, constructed by using partial time-reversal and partial reflection, for fermionic topological phases of matter in one spatial dimension protected by an orientation reversing symmetry, using…
We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed…
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum…
Automata networks are mappings of the form f : Q Z $\rightarrow$ Q Z , where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networks. An update schedule dictates when each entity updates its…
We study a model of one-way quantum automaton where only measurement operations are allowed (MOn-1qfa). We give an algebraic characterization of LMO, showing that the syntactic monoids of the languages in LMO are exactly the literal…
It is believed that most (perhaps all) gapped phases of matter can be described at long distances by Topological Quantum Field Theory (TQFT). On the other hand, it has been rigorously established that in 1+1d ground states of gapped…
We construct two-dimensional non-commutative topological quantum field theories (TQFTs), one for each Hecke algebra corresponding to a finite Coxeter system. These TQFTs associate an invariant to each ciliated surface, which is a Laurent…