We present a mathematical formalism for the description of unrestricted quantum walks with entangled coins and one walker. Furthermore, we examine the numerical behaviour of such walks using Bell states as initial coin states, two different coin operators, two different shift operators, and one walker. We compare and contrast the performance of these quantum walks with that of a classical random walk consisting of one walker and two maximally correlated coins. We find the behavior of our walk with entangled coins can be very different in comparison to the usual quantum walk with a single coin. We also find that simply by changing the shift operator, we can generate widely different distributions
Quantum walks and random walks bear similarities and divergences. One of the most remarkable dispari...
Abstract Quantum Walk (QW) has very different transport properties to its classical counterpart due ...
Περίληψη: Quantization and asymptotic behaviour of a variant of discrete random walk on integers are...
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimension...
Quantum walks are a powerful tool for developing efficient algorithms in quantum computing. This res...
In this thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image Processing. O...
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum ...
We present a discrete-time, one-dimensional quantum walk based on the entanglement between the momen...
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for...
Classical randomized algorithms use a coin toss instruction to explore different evolutionary branch...
Recently, a new model of quantum walk, utilizing recycled coins, was introduced; however little is y...
One of the unique features of discrete-time quantum walks is called trapping, meaning the inability ...
In this paper discrete quantum walks with different coins used for odd and even time steps are studi...
In this paper, we present a study of discrete time quantum walks whose underlying graph is a d-dimen...
In this article, we undertake a detailed study of the limiting behavior of a three-state discrete-ti...
Quantum walks and random walks bear similarities and divergences. One of the most remarkable dispari...
Abstract Quantum Walk (QW) has very different transport properties to its classical counterpart due ...
Περίληψη: Quantization and asymptotic behaviour of a variant of discrete random walk on integers are...
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimension...
Quantum walks are a powerful tool for developing efficient algorithms in quantum computing. This res...
In this thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image Processing. O...
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum ...
We present a discrete-time, one-dimensional quantum walk based on the entanglement between the momen...
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for...
Classical randomized algorithms use a coin toss instruction to explore different evolutionary branch...
Recently, a new model of quantum walk, utilizing recycled coins, was introduced; however little is y...
One of the unique features of discrete-time quantum walks is called trapping, meaning the inability ...
In this paper discrete quantum walks with different coins used for odd and even time steps are studi...
In this paper, we present a study of discrete time quantum walks whose underlying graph is a d-dimen...
In this article, we undertake a detailed study of the limiting behavior of a three-state discrete-ti...
Quantum walks and random walks bear similarities and divergences. One of the most remarkable dispari...
Abstract Quantum Walk (QW) has very different transport properties to its classical counterpart due ...
Περίληψη: Quantization and asymptotic behaviour of a variant of discrete random walk on integers are...