arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.07597cs.FLcs.LGmath.AGquant-ph
收藏

Quantum Finite Automata and Quiver Algebras

Boston University(波士顿大学)

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 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 metric that can be optimized by gradient descent.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑