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