相关论文: Lower bounds on the size of semi-quantum finite au…

We explain a hierarchy of Friedel sum rule like formulas that help us understand response of mesoscopic systems to applied electric and magnetic fields. The formulas can be derived fully quantum mechanically and then there is a mathematical…

To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free…

In this paper we introduce a new type of approximate state reductions where the behaviors of the reduced and the original automaton do not have to be identical, but they must match on all words of length less than or equal to some given…

We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to handle continuous gate parameters and report a collection…

We argue that the success of DFT can be understood in terms of a semiclassical expansion around a very specific limit. This limit was identified long ago by Lieb and Simon for the total electronic energy of a system. This is a universal…

Reversibility of a one-dimensional finite cellular automaton (CA) is dependent on lattice size. A finite CA can be reversible for a set of lattice sizes. On the other hand, reversibility of an infinite CA, which is decided by exploring the…

Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…

We study the problem of constructing approximations to a weighted automaton. Weighted finite automata (WFA) are closely related to the theory of rational series. A rational series is a function from strings to real numbers that can be…

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,…

Given a Probabilistic Finite Automata (PFA), a set of states S, and an error threshold e > 0, our algorithm approximates the infimum probability (quantifying over all infinite words) that the automata reaches S. Our result contrasts with…

Semiclassical approximations for quantum dynamic simulations in complex chemical systems range from rigorously accurate methods that are computationally expensive to methods that exhibit near-classical scaling with system size but are…

Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of…

Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and finite automata, etc. While communication complexity as a technique has been applied to study finite automata, it seems it has not…

For the last few decades, classical machine learning has allowed us to improve the lives of many through automation, natural language processing, predictive analytics and much more. However, a major concern is the fact that we're fast…

We investigate the mean dimension of a cellular automaton (CA for short) with a compact non-discrete space of states. A formula for the mean dimension is established for (near) strongly permutative, permutative algebraic and unit…

In this paper, we introduce classically time-controlled quantum automata or CTQA, which is a reasonable modification of Moore-Crutchfield quantum finite automata that uses time-dependent evolution and a "scheduler" defining how long each…

We present a correspondence and bisimulation between variants of parametrically polymorphic type systems and variants of finite control automata, such as FSA, PDA, tree automata and Turing machine. Within this correspondence we show that…

Quantum computers hold great promise to enhance machine learning, but their current qubit counts restrict the realisation of this promise. In an attempt to placate this limitation techniques can be applied for evaluating a quantum circuit…

This paper is concerned with a detailed comparison of two different abstraction techniques for the construction of finite state symbolic models for controller synthesis of hybrid systems. Namely, we compare quotient based abstractions…