Quantum Walks via Quantum Cellular Automata
classification
🪐 quant-ph
cond-mat.quant-gasnlin.CGphysics.comp-ph
keywords
quantumautomatacellularmodelswalksalgorithmsamountclassical
read the original abstract
Very much as its classical counterpart, quantum cellular automata are expected to be a great tool for simulating complex quantum systems. Here we introduce a partitioned model of quantum cellular automata and show how it can simulate, with the same amount of resources (in terms of effective Hilbert space dimension), various models of quantum walks. All the algorithms developed within quantum walk models are thus directly inherited by the quantum cellular automata. The latter, however, has its structure based on local interactions between qubits, and as such it can be more suitable for present (and future) experimental implementations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.