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

Lecture notes in computer science

Algebraic Results on Quantum Automata

Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Ķikusts, Mark Mercer, Denis Thérien

Published Jan 1, 2004• 12 citations
Publisher
DOI
10.1007/978-3-540-24749-4_9

Related papers

Algebraic Results on Quantum Automata

Andris Ambainis, Martin Beaudry, Marats Golovkins +3 more

Theory of Computing Systems•Nov 29, 2005•73 citations

Quantum automata and algebraic groups

Harm Derksen, Emmanuel Jeandel, Pascal Koiran

Journal of Symbolic Computation•Feb 17, 2005•71 citations

Algebraic Characterizations of Unitary Linear Quantum Cellular Automata

Pablo J. Arrighi

Lecture notes in computer science•Jan 1, 2006•9 citations

Some algebraic properties of measure-once two-way quantum finite automata

Zhengjun Xi, Xin Wang, Yongming Li

Quantum Information Processing•Sep 15, 2008•1 citation

On Quantum Cellural Automata

Alexander Yu. Vlasov

In recent work [quant-ph/0405174] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellural automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about quantum CA derived from more general, standard model of classical CA. In present work is considered an approach to definition of a scheme with "history", valid for quantization both irreversible and reversible classical CA directly using local transition rules. It is used language of vectors in Hilbert spaces instead of C*-algebras, but results may be compared in some cases. Finally, the quantum lattice gases, quantum walk and "bots" are also discussed briefly.

•Jun 17, 2004•0 citations

Quantum Finite Automata and Quiver Algebras

George Jeffreys, Siu-Cheong Lau

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.

arXiv:2203.07597•International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering (MaxEnt)•Dec 14, 2022•0 citations
In recent work [quant-ph/0405174] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellural automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about quantum CA derived from more general, standard model of classical CA. In present work is considered an approach to definition of a scheme with "history", valid for quantization both irreversible and reversible classical CA directly using local transition rules. It is used language of vectors in Hilbert spaces instead of C*-algebras, but results may be compared in some cases. Finally, the quantum lattice gases, quantum walk and "bots" are also discussed briefly.