Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
From MaRDI portal
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.
Recommendations
- A decision procedure for unitary linear quantum cellular automata
- Fermionic quantum cellular automata and generalized matrix-product unitaries
- Intrinsically universal \(n\)-dimensional quantum cellular automata
- STACS 2004
- Algebraic results on quantum automata
- A decision procedure for well-formed linear quantum cellular automata
- A decision procedure for well-formed linear quantum cellular automata
- Classification of quantum cellular automata
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
- scientific article; zbMATH DE number 4080919
Cited in
(9)- On the absence of homogeneous scalar unitary cellular automata.
- The Chamber Ansatz for quantum unipotent cells
- A decision procedure for unitary linear quantum cellular automata
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
- Remarks on the structure of Clifford quantum cellular automata
- A decision procedure for well-formed linear quantum cellular automata
- A decision procedure for well-formed linear quantum cellular automata
- When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)?
- Unitarity plus causality implies localizability
This page was built for publication: Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756662)