2020/05/05 by Iyed Ben Slimen, Slimen, Iyed Ben, Amor Gueddana +3
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum and electron transport phenomena #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2005.02447
openalex publication_date 2020/05/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate the counterparts of random walk in universal quantum computing and their implementation using standard quantum circuits. Quantum walk have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1-D graph, namely a circle, and show how to implement discrete circular quantum walk in quantum circuits built with universal CNOT and single quit gates. We review elementary quantum gates and circuit decomposition and propose a a generalized version of the all CNOT based quantum discrete circular walk. We simulated these circuits on an IBM quantum supercomputer London IBM-Q with 5 qubits. This quantum computer has non perfect gates based on superconducting qubits, therefore we analyze the impact of errors on the fidelity of the Walker circuit.