Vivek Wadhia vivek.wadhia@durham.ac.uk
PGR Student Master of Science
Cycle discrete-time quantum walks on a noisy quantum computer
Wadhia, Vivek; Chancellor, Nicholas; Kendon, Viv
Authors
Dr Nicholas Chancellor nicholas.chancellor@durham.ac.uk
Teaching Fellow QO
Dr Vivien Kendon viv.kendon@durham.ac.uk
Academic Visitor
Abstract
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. Graphic abstract:
Citation
Wadhia, V., Chancellor, N., & Kendon, V. (2024). Cycle discrete-time quantum walks on a noisy quantum computer. The European Physical Journal D, 78(3), Article 29. https://doi.org/10.1140/epjd/s10053-023-00795-2
Journal Article Type | Article |
---|---|
Acceptance Date | Dec 23, 2023 |
Online Publication Date | Mar 25, 2024 |
Publication Date | Mar 1, 2024 |
Deposit Date | May 16, 2024 |
Publicly Available Date | May 16, 2024 |
Journal | The European Physical Journal D |
Print ISSN | 1434-6060 |
Electronic ISSN | 1434-6079 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Volume | 78 |
Issue | 3 |
Article Number | 29 |
DOI | https://doi.org/10.1140/epjd/s10053-023-00795-2 |
Public URL | https://durham-repository.worktribe.com/output/2367006 |
Files
Published Journal Article
(1.3 Mb)
PDF
Licence
http://creativecommons.org/licenses/by/4.0/
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
You might also like
Graphical structures for design and verification of quantum error correction
(2023)
Journal Article
Using copies can improve precision in continuous-time quantum computing
(2023)
Journal Article
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
(2023)
Journal Article
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
(2023)
Journal Article
Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms
(2022)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search