Related papers: Quantum Walk-based Generation of Entanglement Betw…
We investigate how arbitrary number of entangled qubits affects properties of quantum walk. We consider variance, positions with non-zero probability density and entropy as criteria to determine the optimal number of entangled qubits in…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
We consider two independent quantum walks on separate lines augmented by partial or full swapping of coins after each step. For classical random walks, swapping or not swapping coins makes little difference to the random walk…
Quantum walk research has mainly focused on evolutions due to repeated applications of time-independent unitary coin operators. However, the idea of controlling the single particle evolution using time-dependent unitary coins has still been…
Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks…
Entanglement with single-particle states is advantageous in quantum technology because of their ability to encode and process information more securely than their multi-particle analogs. Threeway and nonlocal two-way entangled…
Quantum walk (QW), which is considered as the quantum counterpart of the classical random walk (CRW), is actually the quantum extension of CRW from the single-coin interpretation. The sequential unitary evolution engenders correlation…
Discrete-time quantum walks provide a natural framework for quantum transport on complex networks. On regular structures, coin-walker entanglement has been widely used to characterize quantum transport and to support quantum algorithmic…
We analyze the application of the history state formalism to quantum walks. The formalism allows one to describe the whole walk through a pure quantum history state, which can be derived from a timeless eigenvalue equation. It naturally…
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
In recent times, hybrid-entanglement (HE) between a qubit and a coherent state has demonstrated superior performance in various quantum information processing tasks, particularly in quantum key distribution. Despite its theoretical…
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
We show that the entanglement between the internal (spin) and external (position) degrees of freedom of a qubit in a random (dynamically disordered) one-dimensional discrete time quantum random walk (QRW) achieves its maximal possible value…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
We implement the discrete-time quantum walk model using the continuous-time evolution of the Hamiltonian that includes both the shift and the coin generators. Based on the Trotter-Suzuki first-order approximation, we consider an…
This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer. We demonstrate that the quantum walk paradigm offers a natural and more efficient approach to simulating parton showers on quantum…
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the…