Facta universitatis - series Electronics and Energetics

Multiple quantum walkers on the line using hybrid coins: A possible tool for quantum search

Ioannis G. Karafyllidis, Paul Isaac Hagouel

Published Jan 1, 2014• 4 citations

Abstract

In this paper discrete quantum walks with different coins used for odd and even time steps are studied. These coins are called hybrid. The calculation results are compared with the most frequently used coin, the Hadamard transform. Furthermore, quantum walks on the line which involve two or more quantum walkers with hybrid coins are studied. Quantum walks with entangled walkers and hybrid coins are also studied. The results of these calculations show that the proposed types of quantum walks can be used for quantum search, because the walker can be directed towards preferred directions and can also be confined in certain segments of the line.

DOI: 10.2298/fuee1401103k

Related papers

Quantum Walk-based Generation of Entanglement Between Two Walkers

Salvador Elías Venegas-Andraca, Sougato Bose

Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outcome, the entanglement ratio (entanglement generated/highest value of entanglement possible, for each step) tends to converge, and the actual convergence value depends on the coin initial state and on the coin measurement outcome. Furthermore, our numerical simulations show that, for the quantum walks used in our algorithm, the value towards which entanglement ratio converges also depends on the position probability distribution symmetry of a quantum walk computed with one single walker and the same coin initial state employed in the corresponding quantum walk with two walkers.

arXiv:0901.3946Jan 26, 200912 citations

Quantum walks

Steven Anatolievich Duplij, Raimund Vogl

We investigate quantum walks which play an important role in the modelling of many phenomena. The detailed and thorough description is given to the discrete quantum walks on a line, where the total quantum state consists of quantum states of the walker and the coin. In addition to the standard walker probability distribution, we introduce the coin probability distribution which gives more complete quantum walk description and novel visualization in terms of the so called polyanders (analogs of trianders in DNA visualization). The methods of final states computation and the Fourier transform are presented for the Hadamard quantum walk.

Institute of Physics eBooksNov 1, 20230 citations

Polyander visualization of quantum walks

Steven Anatolievich Duplij, Raimund Vogl

arXiv:2311.00409Nov 1, 20230 citations

Alternating Quantum Walks

Jenia Rousseva

Quantum walks are a powerful tool for developing efficient algorithms in quantum computing. This research explores two discrete-time one-dimensional quantum walks where the coin operator varies along even and odd positions on the line. We find closed-form expressions for the coefficients of the wave function for both walks and also arrive at a formula for the probability distribution for one of the walks. A significant discovery is a way to model the well-known Hadamard walk using two alternating coins.

Jan 1, 20160 citations

One-dimensional discrete-time quantum walks with general coin

Mahesh N. Jayakody, Chandrakala Meena, Priodyuti Pradhan

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 one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study conducted on general coin operator also includes the popular coins -- Hadamard, Grover, and Fourier coins.

arXiv:2102.07207Feb 14, 20211 citation

Revisiting one-dimensional discrete-time quantum walks with general coin

Mahesh N. Jayakody, Chandrakala Meena, Priodyuti Pradhan

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 one-dimensional discrete-time QW and discuss basic steps in detail by incorporating the most general coin operator, constant in both space and time, and a localized initial state using numerical modeling. We investigate the impact of each parameter of the general coin operator on the probability distribution of the quantum walker. We show that by tuning the parameters of the general coin, one can regulate the probability distribution of the walker. We provide an algorithm for the one-dimensional quantum walk driven by the general coin operator. The study on general coin operators also includes the popular coins – Hadamard, Grover, and Fourier.

Physics OpenNov 10, 20239 citations