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

Frontiers of Computer Science in China

An overview of quantum computation models: quantum automata

Daowen Qiu, Lvzhou Li

Published Jun 1, 2008• 25 citations
Publisher
DOI
10.1007/s11704-008-0022-y

Related papers

Quantum Automata: An Overview

Stanley Gudder

International Journal of Theoretical Physics•Sep 1, 1999•20 citations

An overview of quantum cellular automata

Pablo J. Arrighi

Natural Computing•Sep 20, 2019•133 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

An overview of Quantum Cellular Automata

Pablo J. Arrighi

Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates information at a bounded speed) and translation-invariant (it acts everywhere the same). Quantum cellular automata provide a model/architecture for distributed quantum computation. More generally, they encompass most of discrete-space discrete-time quantum theory. We give an overview of their theory, with particular focus on structure results; computability and universality results; and quantum simulation results.

arXiv:1904.12956•Apr 29, 2019•35 citations

Quantum Computers and Quantum Automata

Rūsiņš Freivalds

Springer eBooks•Jan 1, 2000•1 citation

Quantum Computation: Overview

Mahn‐Soo Choi

Springer eBooks•Jan 1, 2022•0 citations
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates information at a bounded speed) and translation-invariant (it acts everywhere the same). Quantum cellular automata provide a model/architecture for distributed quantum computation. More generally, they encompass most of discrete-space discrete-time quantum theory. We give an overview of their theory, with particular focus on structure results; computability and universality results; and quantum simulation results.