Related papers: Automata and one-dimensional TQFTs with defects
In this paper, we introduce Topological Quantum Field Theories (TQFTs) generalizing the arithmetic computations done by Hausel and Rodr\'iguez-Villegas and the geometric construction done by Logares, Mu\~noz, and Newstead to study…
We extend the TFT construction of CFT correlators of [arXiv:hep-th/0204148] to so-called finite logarithmic CFTs for which the algebraic input data is no longer semisimple but still finite. More specifically, starting from the data of a…
While the complexity of translating future linear temporal logic (LTL) into automata on infinite words is well-understood, the size increase involved in turning automata back to LTL is not. In particular, there is no known elementary bound…
Topological quantum field theories (TQFTs) are symmetric monoidal functors out of cobordism categories. In dimension two, oriented TQFTs are famously classified by commutative Frobenius algebras. In the unoriented setting, the…
We introduce a quantum analogue of a classical synchronizing automaton. In classical case the state of a system evolves according to a set of rules forming an alphabet, and sequences of these rules, called words, govern its evolution.…
Let $L_{>\lambda}(\mathcal{A})$ and $L_{\geq\lambda}(\mathcal{A})$ be the languages recognized by {\em measure many 1-way quantum finite automata (MM-QFA)} (or,{\em enhanced 1-way quantum finite automata(EQFA)}) $\mathcal{A}$ with strict…
Fracton phases exhibit striking behavior which appears to render them beyond the standard topological quantum field theory (TQFT) paradigm for classifying gapped quantum matter. Here, we explore fracton phases from the perspective of defect…
Cognitive computation such as e.g. language processing, is conventionally regarded as Turing computation, and Turing machines can be uniquely implemented as nonlinear dynamical systems using generalized shifts and subsequent G\"odel…
We construct topological quantum field theories (TQFTs) and commuting projector Hamiltonians for any 1+1d gapped phases with non-anomalous fusion category symmetries, i.e. finite symmetries that admit SPT phases. The construction is based…
Matrix Product States (MPSs) provide a powerful framework to study and classify gapped quantum phases --symmetry-protected topological (SPT) phases in particular--defined in one dimensional lattices. On the other hand, it is natural to…
In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's are equivalent in power to classical probabilistic finite…
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of…
Topological quantum field theories (TQFT) encode quantum correlations in topological features of spaces. In this work, we leverage this feature to explore how information encoded in TQFTs can be stored and retrieved in the presence of local…
A generalised orbifold of a defect TQFT $\mathcal{Z}$ is another TQFT $\mathcal{Z}_{\mathcal{A}}$ obtained by performing a state sum construction internal to $\mathcal{Z}$. As an input it needs a so-called orbifold datum $\mathcal{A}$ which…
We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the…
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…
A complete deterministic finite (semi)automaton (DFA) with a set of states $Q$ is \emph{completely reachable} if every nonempty subset of $Q$ is the image of the action of some word applied to $Q$. The concept of completely reachable…
We consider a generalization of the axioms of a TQFT, so called half-projective TQFT's, with an anomaly, $x^{\mu}$, in the composition law. $\mu$ is a coboundary on the cobordism categories with non-negative, integer values. The element $x$…