English
Related papers

Related papers: Automata and one-dimensional TQFTs with defects

200 papers

One-way quantum finite automata together with classical states (1QFAC) proposed in [Journal of Computer and System Sciences 81(2) (2015) 359--375] is a new one-way quantum finite automata (1QFA) model that integrates quantum finite automata…

Quantum Physics · Physics 2021-12-09 Ligang Xiao , Daowen Qiu

Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…

Quantum Physics · Physics 2019-09-09 Pablo Arrighi

We find bases for naturally defined lattices over certain rings of integers in the SU(2)-TQFT-theory modules of surfaces. We consider the TQFT where the Kauffman's A variable is a root of unity of order four times an odd prime. As an…

Geometric Topology · Mathematics 2011-07-12 Khaled Qazaqzeh

Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which…

Quantum Physics · Physics 2008-02-03 David A. Meyer

Multi-letter {\it quantum finite automata} (QFAs) were a quantum variant of classical {\it one-way multi-head finite automata} (J. Hromkovi\v{c}, Acta Informatica 19 (1983) 377-384), and it has been shown that this new one-way QFAs…

Formal Languages and Automata Theory · Computer Science 2010-11-01 Daowen Qiu , Xiangfu Zou , Lvzhou Li , Paulo Mateus

Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations are done in terms of Feynman diagrams, which are…

Quantum Physics · Physics 2016-01-27 David A. Meyer , Asif Shakeel

Symmetry Breaking is used as an "underlying principle", bringing different features of QFT to the foreground. However, the understanding of Symmetry Breaking that is used here is quite different from what is done in the mainstream: Symmetry…

High Energy Physics - Theory · Physics 2009-04-16 D. D. Ferrante

Dynamical quantum field theories (QFTs), such as those in which spacetimes are equipped with a metric and/or a field in the form of a smooth map to a target manifold, can be formulated axiomatically using the language of…

High Energy Physics - Theory · Physics 2024-05-16 Ben Gripaios , Oscar Randal-Williams , Joseph Tooby-Smith

In this paper we propose a naive construction of 2-dimensional extended topological quantum field theories (TQFTs), which can be further generalized to the higher-dimension extended TQFTs.

Quantum Algebra · Mathematics 2007-05-23 Vishvajit V. S. Gautam

In many cases the symmetry structure of quantum field theories can be neatly encoded into their associated symmetry topological field theory (SymTFT), a topological field theory in one dimension higher. For geometrically engineered QFTs in…

High Energy Physics - Theory · Physics 2024-12-12 Iñaki García Etxebarria , Saghar S. Hosseini

We introduce 2-way finite automata with quantum and classical states (2qcfa's). This is a variant on the 2-way quantum finite automata (2qfa) model which may be simpler to implement than unrestricted 2qfa's; the internal state of a 2qcfa…

Computational Complexity · Computer Science 2007-05-23 Andris Ambainis , John Watrous

We discuss topological quantum field theories that compute topological invariants which depend on additional structures (or decorations) on three-manifolds. The $q$-series invariant $\hat{Z}(q)$ proposed by Gukov, Pei, Putrov and Vafa is an…

High Energy Physics - Theory · Physics 2022-07-01 Mrunmay Jagadale

In this paper, we focus on determining the equivalence for {\it 1-way quantum finite automata with control language} (CL-1QFAs) defined by Bertoni et al and {\it measure-many 1-way quantum finite automata} (MM-1QFAs) introduced by Kondacs…

Quantum Physics · Physics 2007-05-23 Lvzhou Li , Daowen Qiu

We give an overview over several constructions of TQFT's over finite fields and cyclotomic integers and their applications to characterizing 3-manifolds and their fundamental groups.

Geometric Topology · Mathematics 2007-05-23 Thomas Kerler

Several abstract machines that operate on symbolic input alphabets have been proposed in the last decade, for example, symbolic automata or lattice automata. Applications of these types of automata include software security analysis and…

Formal Languages and Automata Theory · Computer Science 2019-10-18 Andreas Stahlbauer

Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…

Formal Languages and Automata Theory · Computer Science 2025-04-16 Verónica Becher , Simon Lew Deveali , Ignacio Mollo Cunningham

A topological defect separating a pair of two-dimensional CFTs is a codimension one interface along which all components of the stress-energy tensor glue continuously. We study topological defects of the bosonic, (0,1)- and…

High Energy Physics - Theory · Physics 2010-10-01 Anton Kapustin , Kevin Setter

A common framework of particle physics consists of two sectors of particles, such as the Standard Model and a dark sector, with some interaction between them. In this work, we initiate the study of a qualitatively different setup in which…

High Energy Physics - Phenomenology · Physics 2024-02-07 T. Daniel Brennan , Sungwoo Hong , Lian-Tao Wang

Topological orders are a prominent paradigm for describing quantum many-body systems without symmetry-breaking orders. We present a topological quantum field theoretical (TQFT) study on topological orders in five-dimensional spacetime…

High Energy Physics - Theory · Physics 2022-04-25 Zhi-Feng Zhang , Peng Ye

We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are omega-automata with a Muller acceptance condition symbolically expressed as a Boolean formula. The richer acceptance condition…

Formal Languages and Automata Theory · Computer Science 2017-09-08 David Müller , Salomon Sickert