Algebraic characterizations of unitary linear quantum cellular automata

Authors:
Pablo Arrighi
Affiliations:
IMAG Laboratories & University of Grenoble, Grenoble Cedex, France
Venue:
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Year:
2006

Citing 7
Cited 5

On the computing power of one-way cellular arrays

14th International Colloquium on Automata, languages and programming
A decision procedure for well-formed linear quantum cellular automata

Proceedings of the workshop on Randomized algorithms and computation
Quantum computation and quantum information

Quantum computation and quantum information
A Decision Procedure for Unitary Linear Quantum Cellular Automata

SIAM Journal on Computing
Efficient exhaustive listings of reversible one dimensional cellular automata

Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Irreversibility and heat generation in the computing process

IBM Journal of Research and Development
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Journal of Computer and System Sciences

One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations

Language and Automata Theory and Applications
Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours

Fundamenta Informaticae - Machines, Computations and Universality, Part II
Unitarity plus causality implies localizability

Journal of Computer and System Sciences
A simple n-dimensional intrinsically universal quantum cellular automaton

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours

Fundamenta Informaticae - Machines, Computations and Universality, Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do not change the quantum cellular automata's computational power. The configurations we consider have finite but unbounded size.