Cycle discrete-time quantum walks on a noisy quantum computer

The rapid development of quantum computing has led to increasing interest in quantum algorithms for a variety of different applications. Quantum walks have also experienced a surge in interest due to their potential use in quantum algorithms. Using the qiskit software package, we test how accurately the current generation of quantum computers provided by IBM can simulate a cycle discrete-time quantum walk. Implementing an 8-node, 8-step walk and a simpler 4-node, 4-step discrete-time quantum walk on an IBM quantum device known as ibmq_quito, the results for each step of the respective walks are presented. A custom noise model is developed in order to estimate that noise levels in the ibmq_santiago quantum device would need to be reduced by at least 94% in order to execute a 16-node, 16-step cycle discrete-time quantum walk to a reasonable level of fidelity.

[1]  Maxine T. Khumalo,et al.  An investigation of IBM Quantum Computing device performance on Combinatorial Optimisation Problems , 2021, Neural Computing and Applications.

[2]  Salvador Elías Venegas-Andraca,et al.  Quantum walks: a comprehensive review , 2012, Quantum Information Processing.

[3]  Jay M. Gambetta,et al.  Characterizing Quantum Gates via Randomized Benchmarking , 2011, 1109.6887.

[4]  Christino Tamon,et al.  Perfect State Transfer in Quantum Walks on Graphs , 2011 .

[5]  Joseph Emerson,et al.  Scalable and robust randomized benchmarking of quantum processes. , 2010, Physical review letters.

[6]  J. B. Wang,et al.  Efficient quantum circuit implementation of quantum walks , 2007, 0706.0304.

[7]  Viv Kendon,et al.  Quantum walks on general graphs , 2003, quant-ph/0306140.

[8]  K. Birgitta Whaley,et al.  Quantum random-walk search algorithm , 2002, quant-ph/0210064.

[9]  Andris Ambainis,et al.  One-dimensional quantum walks , 2001, STOC '01.

[10]  Andris Ambainis,et al.  Quantum walks on graphs , 2000, STOC '01.

[11]  R. Feynman.  Simulating physics with computers , 1999 .

[12]  E. Farhi,et al.  Quantum computation and decision trees , 1997, quant-ph/9706062.

[13]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[14]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[15]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[16]  Aharonov,et al.  Quantum random walks. , 1993, Physical review. A, Atomic, molecular, and optical physics.

[17]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[18]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[19]  S. Gudder.  Quantum probability and operational statistics , 1990 .

[20]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[21]  H. S. Allen.  The Quantum Theory , 1928, Nature.

[22]  R. Gutman.  Providers? , 1992, JAMA.

[23]  I. Miyazaki,et al.  AND T , 2022 .