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

Communications in computer and information science

Abstract Quantum Automata as Formal Models of Quantum Information Processing Systems

Mizal H. Alobaidi, Andriy Batyiv, Grygoriy Zholtkevych

Published Jan 1, 2013• 0 citations
Publisher
DOI
10.1007/978-3-642-35737-4_2

Related papers

Quantum cellular automata for quantum information processing

Robert Raussendorf, Yiyang Gong

Bulletin of the American Physical Society•Mar 24, 2005•0 citations

Finite automata models of quantized systems: conceptual status and outlook

Karl Svozil

Since Edward Moore, finite automata theory has been inspired by physics, in particular by quantum complementarity. We review automaton complementarity, reversible automata and the connections to generalized urn models. Recent developments in quantum information theory may have appropriate formalizations in the automaton context.

arXiv:quant-ph/0209089•Sep 15, 2002•2 citations

Some formal tools for analyzing quantum automata

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano

Theoretical Computer Science•Mar 1, 2006•24 citations

Quantum State Collapse as a Cellular Automaton Algorithm

Jincheng Zhang

Quantum state collapse is a fundamental process in quantum mechanics, representing the irreversible loss of information upon measurement. This paper explores the potential of utilizing a cellular automata (CA) framework to model and simulate this collapse, offering a novel approach to understanding and potentially manipulating quantum evolution. We formalize collapse as a dynamic process governed by specific rules and feedback loops, enabling the simulation of complex quantum patterns. We propose a CA-based model that incorporates the probabilistic nature of quantum mechanics, allowing for a more intuitive and potentially controllable simulation of quantum phenomena. The core mechanism focuses on systematically evolving the system's state space, mirroring the collapse process and highlighting the interplay between initial conditions and emergent behavior. This work provides a foundational step in exploring the application of CA algorithms to complex quantum systems, opening avenues for future research in quantum simulation and understanding.

•Sep 6, 2026•0 citations

Quantum finite automata using quantum logic

Jismy Joseph, K. S. Dersanambika

Malaya Journal of Matematik•Jan 31, 2019•1 citation

Quantum Computers and Quantum Automata

Rūsiņš Freivalds

Springer eBooks•Jan 1, 2000•1 citation
Quantum state collapse is a fundamental process in quantum mechanics, representing the irreversible loss of information upon measurement. This paper explores the potential of utilizing a cellular automata (CA) framework to model and simulate this collapse, offering a novel approach to understanding and potentially manipulating quantum evolution. We formalize collapse as a dynamic process governed by specific rules and feedback loops, enabling the simulation of complex quantum patterns. We propose a CA-based model that incorporates the probabilistic nature of quantum mechanics, allowing for a more intuitive and potentially controllable simulation of quantum phenomena. The core mechanism focuses on systematically evolving the system's state space, mirroring the collapse process and highlighting the interplay between initial conditions and emergent behavior. This work provides a foundational step in exploring the application of CA algorithms to complex quantum systems, opening avenues for future research in quantum simulation and understanding.