Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2203.07597 · International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering (MaxEnt)

Quantum Finite Automata and Quiver Algebras

George Jeffreys, Siu-Cheong Lau

Published Dec 14, 2022• 0 citations
arXivHTMLPDF

Abstract

We find an application in quantum finite automata for the ideas and results of [JL21] and [JL22]. We reformulate quantum finite automata with multiple-time measurements using the algebraic notion of a near-ring. This gives a unified understanding towards quantum computing and deep learning. When the near-ring comes from a quiver, we have a nice moduli space of computing machines with a metric that can be optimized by gradient descent.

DOI
10.3390/psf2022005032

Related papers

Quantum Cellular Automata: The Group, the Space, and the Spectrum

Mattie Ji, Bowen Yang

Over an arbitrary commutative ring $R$, we develop a theory of quantum cellular automata. We then use algebraic K-theory to construct a space $\mathbf{Q}(X)$ of quantum cellular automata (QCA) on a given metric space $X$. In most cases of interest, $π_0 \mathbf{Q}(X)$ classifies QCA up to quantum circuits and stabilization. Notably, the QCA spaces are related by homotopy equivalences $\mathbf{Q}(*) \simeq Ω^n \mathbf{Q}(\mathbb{Z}^n)$ for all $n$, which shows that the classification of QCA on Euclidean lattices is given by an $Ω$-spectrum indexed by the dimension $n$. As a corollary, we also obtain a non-connective delooping of the K-theory of Azumaya $R$-algebras, which may be of independent interest. We also include a section leading to the $Ω$-spectrum for QCA over $C^*$-algebras with unitary circuits.

math.ATCross-listedarXiv:2602.16572•Feb 19, 2026

Learning quantum finite automata with queries

Daowen Qiu

Abstract Learning finite automata (termed as model learning) has become an important field in machine learning and has been useful realistic applications. Quantum finite automata (QFA) are simple models of quantum computers with finite memory. Due to their simplicity, QFA have well physical realizability, but one-way QFA still have essential advantages over classical finite automata with regard to state complexity (two-way QFA are more powerful than classical finite automata in computation ability as well). As a different problem in quantum learning theory and quantum machine learning, in this paper, our purpose is to initiate the study of learning QFA with queries (naturally it may be termed as quantum model learning), and the main results are regarding learning two basic one-way QFA (1QFA): (1) we propose a learning algorithm for measure-once 1QFA (MO-1QFA) with query complexity of polynomial time and (2) we propose a learning algorithm for measure-many 1QFA (MM-1QFA) with query complexity of polynomial time, as well.

arXiv:2111.14041•Mathematical Structures in Computer Science•Nov 30, 2023•2 citations

Applications of algebraic automata theory to quantum finite automata

Mark Mercer

The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38, 44]) with some variations in definition. The objective of this thesis is to understand what class of languages can be recognized by these different variations, and how many states are required. We begin by showing that we can use algebraic automata theory to characterize the language recognition power of QFAs. Algebraic automata theory associates to each language a canonical syntactic monoid, and the algebraic structure of this monoid becomes a meaningful parameter in describing language classes. We show that the class of languages recognized by Latvian QFAs [3] corresponds exactly to boolean combinations of languages recognized by Brodsky and Pippenger's QFA model [20], which correspond exactly to those languages whose syntactic monoid is in the class BG. Known results give us a decision procedure for testing membership in this language class. We also use algebraic automata theory to give nearly tight upper and lower bounds on the class of languages recognized by Brodsky and Pippenger's QFAs. We then extend a number of lower bound techniques known for Kondacs and Watrous' 1-way QFA model to Nayak's Generalized QFA. Both of these models are related in that they are permitted to halt before reading the entire input, allowing them to recognize certain languages whose syntactic monoid lies outside of BG. Finally, we investigate the question of QFA succinctness. It is known that QFAs can recognize some languages using exponentially fewer states compared to deterministic finite automata. We extend results from [16] to show that the word problem over abelian groups has this property. We also give example of interesting noncommutative languages with this property.

•Jan 1, 2007•3 citations

A Universal Training Algorithm for Quantum Deep Learning

Guillaume Verdon, Jason Pye, Michael Broughton

We introduce the Backwards Quantum Propagation of Phase errors (Baqprop) principle, a central theme upon which we construct multiple universal optimization heuristics for training both parametrized quantum circuits and classical deep neural networks on a quantum computer. Baqprop encodes error information in relative phases of a quantum wavefunction defined over the space of network parameters; it can be thought of as the unification of the phase kickback principle of quantum computation and of the backpropagation algorithm from classical deep learning. We propose two core heuristics which leverage Baqprop for quantum-enhanced optimization of network parameters: Quantum Dynamical Descent (QDD) and Momentum Measurement Gradient Descent (MoMGrad). QDD uses simulated quantum coherent dynamics for parameter optimization, allowing for quantum tunneling through the hypothesis space landscape. MoMGrad leverages Baqprop to estimate gradients and thereby perform gradient descent on the parameter landscape; it can be thought of as the quantum-classical analogue of QDD. In addition to these core optimization strategies, we propose various methods for parallelization, regularization, and meta-learning as augmentations to MoMGrad and QDD. We introduce several quantum-coherent adaptations of canonical classical feedforward neural networks, and study how Baqprop can be used to optimize such networks. We develop multiple applications of parametric circuit learning for quantum data, and show how to perform Baqprop in each case. One such application allows for the training of hybrid quantum-classical neural-circuit networks, via the seamless integration of Baqprop with classical backpropagation. Finally, for a representative subset of these proposed applications, we demonstrate the training of these networks via numerical simulations of implementations of QDD and MoMGrad.

arXiv:1806.09729•Jun 25, 2018•142 citations

QUANTUM FINITE AUTOMATA

Jozef Gruska, Roland Vollmar

Various quantum versions of the most basic models of the classical finite automata have already been introduced and various modes of their computations have already started to be investigated. In this paper we overview basic models, approaches, techniques and results in this promising area of quantum automata that is expected to play an important role also in theoretical computer science. We also summarize some open problems and research directions to pursue in this area.

International Colloquium on Words, Languages and Combinatorics•Jul 1, 2003•0 citations

Quantum-Enhanced Gradient Descent (QED)

Jincheng Zhang

Quantum-Enhanced Gradient Descent (QED) is a novel approach to machine learning that integrates quantum computing principles with gradient descent algorithms. The core idea is to leverage the unique capabilities of quantum mechanics, specifically quantum entanglement and superposition, to accelerate the training process of machine learning models, particularly deep neural networks. This paper explores the potential of QED by investigating how quantum-enhanced gradient descent can significantly reduce training time and improve model parameter accuracy compared to classical gradient descent. We present a detailed theoretical framework and preliminary experimental results demonstrating the efficacy of QED in optimizing specific machine learning models. The paper also discusses the challenges and future directions of this research.

•Sep 3, 2026•0 citations
We find an application in quantum finite automata for the ideas and results of [JL21] and [JL22]. We reformulate quantum finite automata with multiple-time measurements using the algebraic notion of a near-ring. This gives a unified understanding towards quantum computing and deep learning. When the near-ring comes from a quiver, we have a nice moduli space of computing machines with a metric that can be optimized by gradient descent.
Over an arbitrary commutative ring RRR, we develop a theory of quantum cellular automata. We then use algebraic K-theory to construct a space Q(X)\mathbf{Q}(X)Q(X) of quantum cellular automata (QCA) on a given metric space XXX. In most cases of interest, π0Q(X)π_0 \mathbf{Q}(X)π0​Q(X) classifies QCA up to quantum circuits and stabilization. Notably, the QCA spaces are related by homotopy equivalences Q(∗)≃ΩnQ(Zn)\mathbf{Q}(*) \simeq Ω^n \mathbf{Q}(\mathbb{Z}^n)Q(∗)≃ΩnQ(Zn) for all nnn, which shows that the classification of QCA on Euclidean lattices is given by an ΩΩΩ-spectrum indexed by the dimension nnn. As a corollary, we also obtain a non-connective delooping of the K-theory of Azumaya RRR-algebras, which may be of independent interest. We also include a section leading to the ΩΩΩ-spectrum for QCA over C∗C^*C∗-algebras with unitary circuits.
Abstract Learning finite automata (termed as model learning) has become an important field in machine learning and has been useful realistic applications. Quantum finite automata (QFA) are simple models of quantum computers with finite memory. Due to their simplicity, QFA have well physical realizability, but one-way QFA still have essential advantages over classical finite automata with regard to state complexity (two-way QFA are more powerful than classical finite automata in computation ability as well). As a different problem in quantum learning theory and quantum machine learning, in this paper, our purpose is to initiate the study of learning QFA with queries (naturally it may be termed as quantum model learning), and the main results are regarding learning two basic one-way QFA (1QFA): (1) we propose a learning algorithm for measure-once 1QFA (MO-1QFA) with query complexity of polynomial time and (2) we propose a learning algorithm for measure-many 1QFA (MM-1QFA) with query complexity of polynomial time, as well.
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38, 44]) with some variations in definition. The objective of this thesis is to understand what class of languages can be recognized by these different variations, and how many states are required. We begin by showing that we can use algebraic automata theory to characterize the language recognition power of QFAs. Algebraic automata theory associates to each language a canonical syntactic monoid, and the algebraic structure of this monoid becomes a meaningful parameter in describing language classes. We show that the class of languages recognized by Latvian QFAs [3] corresponds exactly to boolean combinations of languages recognized by Brodsky and Pippenger's QFA model [20], which correspond exactly to those languages whose syntactic monoid is in the class BG. Known results give us a decision procedure for testing membership in this language class. We also use algebraic automata theory to give nearly tight upper and lower bounds on the class of languages recognized by Brodsky and Pippenger's QFAs. We then extend a number of lower bound techniques known for Kondacs and Watrous' 1-way QFA model to Nayak's Generalized QFA. Both of these models are related in that they are permitted to halt before reading the entire input, allowing them to recognize certain languages whose syntactic monoid lies outside of BG. Finally, we investigate the question of QFA succinctness. It is known that QFAs can recognize some languages using exponentially fewer states compared to deterministic finite automata. We extend results from [16] to show that the word problem over abelian groups has this property. We also give example of interesting noncommutative languages with this property.
We introduce the Backwards Quantum Propagation of Phase errors (Baqprop) principle, a central theme upon which we construct multiple universal optimization heuristics for training both parametrized quantum circuits and classical deep neural networks on a quantum computer. Baqprop encodes error information in relative phases of a quantum wavefunction defined over the space of network parameters; it can be thought of as the unification of the phase kickback principle of quantum computation and of the backpropagation algorithm from classical deep learning. We propose two core heuristics which leverage Baqprop for quantum-enhanced optimization of network parameters: Quantum Dynamical Descent (QDD) and Momentum Measurement Gradient Descent (MoMGrad). QDD uses simulated quantum coherent dynamics for parameter optimization, allowing for quantum tunneling through the hypothesis space landscape. MoMGrad leverages Baqprop to estimate gradients and thereby perform gradient descent on the parameter landscape; it can be thought of as the quantum-classical analogue of QDD. In addition to these core optimization strategies, we propose various methods for parallelization, regularization, and meta-learning as augmentations to MoMGrad and QDD. We introduce several quantum-coherent adaptations of canonical classical feedforward neural networks, and study how Baqprop can be used to optimize such networks. We develop multiple applications of parametric circuit learning for quantum data, and show how to perform Baqprop in each case. One such application allows for the training of hybrid quantum-classical neural-circuit networks, via the seamless integration of Baqprop with classical backpropagation. Finally, for a representative subset of these proposed applications, we demonstrate the training of these networks via numerical simulations of implementations of QDD and MoMGrad.
Quantum-Enhanced Gradient Descent (QED) is a novel approach to machine learning that integrates quantum computing principles with gradient descent algorithms. The core idea is to leverage the unique capabilities of quantum mechanics, specifically quantum entanglement and superposition, to accelerate the training process of machine learning models, particularly deep neural networks. This paper explores the potential of QED by investigating how quantum-enhanced gradient descent can significantly reduce training time and improve model parameter accuracy compared to classical gradient descent. We present a detailed theoretical framework and preliminary experimental results demonstrating the efficacy of QED in optimizing specific machine learning models. The paper also discusses the challenges and future directions of this research.