The development of quantum walks in the context of quantum computation, as generalisations of random walk techniques, led rapidly to several new quantum algorithms. These all follow unitary quantum evolution, apart from the final measurement. Since logical qubits in a quantum computer must be protected from decoherence by error correction, there is no need to consider decoherence at the level of algorithms. Nonetheless, enlarging the range of quantum dynamics to include non-unitary evolution provides a wider range of possibilities for tuning the properties of quantum walks. For example, small amounts of decoherence in a quantum walk on the line can produce more uniform spreading (a top-hat distribution), without losing the quantum speed up....
Graduation date: 2012One of the newer and rapidly developing approaches in quantum computing is base...
The common perception is that strong coupling to the environment will always render the evolution of...
AbstractQuantum versions of random walks on the line and the cycle show a quadratic improvement over...
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classic...
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreadi...
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreadi...
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for...
The development of quantum algorithms based on quantum versions of random walks is placed in the con...
Quantum walks are dynamic systems with a wide range of applications in quantum computation and quant...
A number of recent studies have investigated the introduction of decoherence in quantum walks and th...
We have studied how decoherence affects a quantum walk on the line. As expected, it is highly sensit...
The quantum random walk has been much studied recently, largely due to its highly nonclassical behav...
We discuss decoherence in discrete-time quantum walks in terms of a phenomenological model that dist...
Random walks are a powerful tool for the efficient implementation of algorithms in clas-sical comput...
We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In p...
Graduation date: 2012One of the newer and rapidly developing approaches in quantum computing is base...
The common perception is that strong coupling to the environment will always render the evolution of...
AbstractQuantum versions of random walks on the line and the cycle show a quadratic improvement over...
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classic...
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreadi...
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreadi...
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for...
The development of quantum algorithms based on quantum versions of random walks is placed in the con...
Quantum walks are dynamic systems with a wide range of applications in quantum computation and quant...
A number of recent studies have investigated the introduction of decoherence in quantum walks and th...
We have studied how decoherence affects a quantum walk on the line. As expected, it is highly sensit...
The quantum random walk has been much studied recently, largely due to its highly nonclassical behav...
We discuss decoherence in discrete-time quantum walks in terms of a phenomenological model that dist...
Random walks are a powerful tool for the efficient implementation of algorithms in clas-sical comput...
We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In p...
Graduation date: 2012One of the newer and rapidly developing approaches in quantum computing is base...
The common perception is that strong coupling to the environment will always render the evolution of...
AbstractQuantum versions of random walks on the line and the cycle show a quadratic improvement over...