Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
From MaRDI portal
Abstract: We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. We do this in two flavours: a weak one which requires an infinite but periodic initial configuration and a strong one which needs only a finite initial configuration. KEYWORDS: Quantum cellular automata, Intrinsic universality, Quantum computation.
Recommendations
- A simple n-dimensional intrinsically universal quantum cellular automaton
- Intrinsically universal \(n\)-dimensional quantum cellular automata
- Partitioned quantum cellular automata are intrinsically universal
- A physically universal quantum cellular automaton
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
Cited in
(7)- Intrinsically universal \(n\)-dimensional quantum cellular automata
- Partitioned quantum cellular automata are intrinsically universal
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
- A simple n-dimensional intrinsically universal quantum cellular automaton
- On dissipative two-state quantum cells and cellular networks
- A physically universal quantum cellular automaton
- An overview of quantum cellular automata
This page was built for publication: Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633998)
