2021/08/05 by Ellinor Wanzambi, Wanzambi, Ellinor, Stina Andersson +1 · 5 citations
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Advancements in Semiconductor Devices and Circuit Design #Algorithm #Artificial intelligence #Computer science #Discrete mathematics #FOS: Physical sciences #Hitting time #IBM #Mathematics #Node (physics) #Noise (video) #Physics #Quadratic equation #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum algorithm #Quantum circuit #Quantum computer #Quantum error correction #Quantum mechanics #Quantum walk #Theoretical computer science #quant-ph
paper · pdf · doi:10.48550/arxiv.2108.02723
published in arXiv (Cornell University) (Cornell University) · Master's thesis
arxiv created 2021/08/05 · openalex publication_date 2021/08/05 · arxiv updated 2021/08/06 · openalex created_date 2021/08/16 · openalex updated_date 2026/07/28
In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS algorithm, which finds a marked node in a graph with a quantum walk, and use it to find a hitting time for the marked nodes in the walk. We do this by implementing the circuit on IBM quantum simulators and show that the execution on a noise-free simulator results in hitting times that agree with the theoretical expectations. We also run the algorithm on a mock backend that simulates the noise of the IBM Melbourne computer. As expected, the noise has an extensive impact on the output, resulting in outcomes far from the noise-free simulation.