One-dimensional discrete-time quantum walks on random environments
N Konno - Quantum Information Processing, 2009 - Springer
Quantum Information Processing, 2009•Springer
… Abstract We consider discrete-time nearest-neighbor quantum walks on random
environments in one dimension. Using the method based on a path counting, we present
both quenched and annealed weak limit theorems for the … Here we consider a discrete-time
nearest-neighbor quantum walk in a random environment (QWRE) on Z. We present weak
limit theorems for the QWRE, both quenched (ie, conditional upon the environment) and
annealed (ie, averaged over the environment), by counting …
environments in one dimension. Using the method based on a path counting, we present
both quenched and annealed weak limit theorems for the … Here we consider a discrete-time
nearest-neighbor quantum walk in a random environment (QWRE) on Z. We present weak
limit theorems for the QWRE, both quenched (ie, conditional upon the environment) and
annealed (ie, averaged over the environment), by counting …
Abstract
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果