Digital Repository

Discrete-Time Quantum Walks with Lazy and Chaotic Coins

Show simple item record

dc.contributor.advisor SANTHANAM, M. S. en_US
dc.contributor.author NAREDI, PRANAY en_US
dc.date.accessioned 2022-05-13T06:05:13Z
dc.date.available 2022-05-13T06:05:13Z
dc.date.issued 2022-05
dc.identifier.citation 65 en_US
dc.identifier.uri http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/6896
dc.description.abstract We review and study quantum walks and their properties. We highlight the contrasts between quantum and classical walks by comparing the walker’s probability distribution and hitting times on different types of graphs. We focus on discrete-time quantum walks. We see that the quantum walks do not always give an advantage over the classical random walks. As in the case of Lackadaisical quantum walks for a specific range of parameter values, the classical walker has lower hitting times as compared to the quantum walker. We study the lackadaisical quantum walk search algorithm and its limitations in finding adjacent marked nodes on a graph. We develop a modified algorithm to find any type of marked node at the cost of increased algorithm running time. We carry out the search on a binary tree and a hypercube and build a quantum circuit to search for a marked node on the 3−dimensional hypercube. Finally, we study the quantum-chaotic walks by coupling a quantum kicked rotor as a coin to the quantum walker. The kicked rotor affects the walker’s probability distribution, and it seems that the quantum walker gets localized with high probability for a short time interval. This behavior occurs for low ℏ and kick strengths, K ≲2 (for the kicking time period T = 1), accompanied by the rapid growth of von Neumann entropy which is used to measure coin-walker entanglement. en_US
dc.language.iso en en_US
dc.subject Quantum Walks en_US
dc.subject Discrete-time quantum walks en_US
dc.subject DTQW en_US
dc.subject Lackadaisical quantum walks en_US
dc.subject LQW en_US
dc.subject Hitting time en_US
dc.subject Classical random walks en_US
dc.subject Quantum walk search algorithm en_US
dc.subject Search marked node en_US
dc.subject Chaotic coin en_US
dc.subject kicked rotor en_US
dc.title Discrete-Time Quantum Walks with Lazy and Chaotic Coins en_US
dc.type Thesis en_US
dc.type.degree BS-MS en_US
dc.contributor.department Dept. of Physics en_US
dc.contributor.registration 20171175 en_US


Files in this item

This item appears in the following Collection(s)

  • MS THESES [1705]
    Thesis submitted to IISER Pune in partial fulfilment of the requirements for the BS-MS Dual Degree Programme/MSc. Programme/MS-Exit Programme

Show simple item record

Search Repository


Advanced Search

Browse

My Account