English
Related papers

Related papers: Automata and one-dimensional TQFTs with defects

200 papers

Quantified CTL (QCTL) is a well-studied temporal logic that extends CTL with quantification over atomic propositions. It has recently come to the fore as a powerful intermediary framework to study logics for strategic reasoning. We extend…

Logic in Computer Science · Computer Science 2018-09-05 Raphaël Berthon , Bastien Maubert , Aniello Murano

The $(D+1)$-dimensional symmetry topological field theory (SymTFT$_{D+1}$) of a $D$-dimensional absolute quantum field theory (QFT$_D$) provides a topological characterization of symmetry data. In this framework, the SymTFT comes equipped…

High Energy Physics - Theory · Physics 2026-04-22 Oren Bergman , Jonathan J. Heckman , Max Hübner , Daniele Migliorati , Xingyang Yu , Hao Y. Zhang

Symmetry Topological Field Theory (SymTFT) is a framework to capture universal features of quantum many-body systems by viewing them as a boundary of topological order in one higher dimension. This has yielded numerous insights in static…

Strongly Correlated Electrons · Physics 2024-03-04 Vedant Motamarri , Campbell McLauchlan , Benjamin Béri

We consider topological defect lines (TDLs) in two-dimensional conformal field theories. Generalizing and encompassing both global symmetries and Verlinde lines, TDLs together with their attached defect operators provide models of fusion…

High Energy Physics - Theory · Physics 2019-01-30 Chi-Ming Chang , Ying-Hsuan Lin , Shu-Heng Shao , Yifan Wang , Xi Yin

Entanglement is a special feature of the quantum world that reflects the existence of subtle, often non-local, correlations between local degrees of freedom. In topological theories such non-local correlations can be given a very intuitive…

High Energy Physics - Theory · Physics 2020-01-31 D. Melnikov , A. Mironov , S. Mironov , A. Morozov , An. Morozov

After the first treatments of quantum finite state automata by Moore and Crutchfield and by Kondacs and Watrous, a number of papers study the power of quantum finite state automata and their variants. This paper introduces a model of…

Computational Complexity · Computer Science 2007-05-23 Tomohiro Yamasaki , Hirotada Kobayashi , Hiroshi Imai

We define a once extended non-compact 3-dimensional TQFT $\mathcal{Z}$ from the data of a (potentially) non-semisimple modular tensor category. This is in the framework of generators and relations of [Bartlett et al., arxiv:1509.06811…

Quantum Algebra · Mathematics 2025-12-30 Theodoros Lagiotis

We study the quantum Fourier transform (QFT) block-encoding of the semi-discrete fractional Laplacian on bounded domains with open, zero-extension boundary conditions. In the notation of the main construction, the target operator is the…

Quantum Physics · Physics 2026-05-19 Younes Javanmard , Sina Kazemian

In this paper we investigate the problem of constructing Topological Quantum Field Theories (TQFTs) to quantize algebraic invariants. We exhibit necessary conditions for quantizability based on Euler characteristics. In the case of…

Quantum Algebra · Mathematics 2025-09-23 Ángel González-Prieto

We study Quot schemes of vector bundles on algebraic curves. Marian and Oprea gave a description of a topological quantum field theory (TQFT) studied by Witten in terms of intersection numbers on Quot schemes of trivial bundles. Since these…

Algebraic Geometry · Mathematics 2019-07-19 Thomas Goller

We develop a systematic framework for constructing (3+1)-dimensional topological orders or topological quantum field theories (TQFTs) that realize specified anomalies of finite symmetries, as encountered in gauge theories with fermions or…

Mathematical Physics · Physics 2026-02-24 Arun Debray , Weicheng Ye , Matthew Yu

1-way quantum finite automata are deterministic and reversible in nature, which greatly reduces its accepting property. In fact the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. In this…

Formal Languages and Automata Theory · Computer Science 2015-12-10 Kingshuk Chatterjee , Kumar Sankar Ray

We construct zero-error quantum finite automata (QFAs) for promise problems which cannot be solved by bounded-error probabilistic finite automata (PFAs). Here is a summary of our results: - There is a promise problem solvable by an exact…

Quantum Physics · Physics 2014-04-11 Jibran Rashid , Abuzer Yakaryilmaz

This paper addresses the torsion problem for a class of automaton semigroups, defined as semigroups of transformations induced by Mealy automata, aka letter-by-letter transducers with the same input and output alphabet. The torsion problem…

Formal Languages and Automata Theory · Computer Science 2014-12-04 Thibault Godin , Ines Klimann , Matthieu Picantin

In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality $p^k$, i.e. the maps $T_{f[l,r]}:\mathbb{Z}^{\mathbb{Z}}_{p^k}\to\mathbb{Z}^{\mathbb{Z}}_{p^k}$ which…

Dynamical Systems · Mathematics 2009-02-24 Hasan Akin

We establish a relation between fully extended $2$-dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of $2D$ closed TFTs and rational exchangeable series and we…

Rings and Algebras · Mathematics 2018-05-08 Roland M. Friedrich

We explain that a bulk with arbitrary dimensions can be added to the space over which a quantum field theory is defined. This gives a TQFT such that its correlation functions in a slice are the same as those of the original quantum field…

High Energy Physics - Theory · Physics 2016-09-06 Laurent Baulieu

Integrality properties of partial sums over irreducible representations, along columns of character tables of finite groups, were recently derived using combinatorial topological string theories (CTST). These CTST were based on…

High Energy Physics - Theory · Physics 2024-09-11 Adrian Padellaro , Rajath Radhakrishnan , Sanjaye Ramgoolam

The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…

Group Theory · Mathematics 2017-02-03 Adam Woryna

Consider a d-dimensional quantum field theory (QFT) $\mathfrak{T}$, with a generalized symmetry $\mathcal{S}$, which may or may not be invertible. We study the action of $\mathcal{S}$ on generalized or $q$-charges, i.e. $q$-dimensional…

High Energy Physics - Theory · Physics 2025-10-15 Lakshya Bhardwaj , Sakura Schafer-Nameki