ﻻ يوجد ملخص باللغة العربية
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal set of quantum gates on two- and three-qubit systems. The idea is to utilize the effective Hilbert space of the single qubit and the position space on which it evolves in order to realize multi-qubit states and universal set of quantum gates on them. Realization of many non-trivial gates and engineering arbitrary states is simpler in the proposed quantum walk model when compared to the circuit based model of computation. We will also discuss the scalability of the model and some propositions for using lesser number of qubits in realizing larger qubit systems.
The unique features of quantum walk, such as the possibility of the walker to be in superposition ofthe position space and get entangled with the position space, provides inherent advantages that canbe captured to design highly secure quantum communi
We study the quantum walk search algorithm of Shenvi, Kempe and Whaley [PRA 67 052307 (2003)] on data structures of one to two spatial dimensions, on which the algorithm is thought to be less efficient than in three or more spatial dimensions. Our ai
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme
Here we present neutrino oscillation in the frame-work of quantum walks. Starting from a one spatial dimensional discrete-time quantum walk we present a scheme of evolutions that will simulate neutrino oscillation. The set of quantum walk parameters
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson localisation.