quantum-implementation-of-the-modified-dijkstra-s-routing-algorithm
This repository provides the quantum implementation of the Modified Dijkstra's Routing Algorithm (https://users.utcluj.ro/~atn/papers/ATN_3_2010_14.pdf) in Qiskit.
https://github.com/robertbotez/quantum-implementation-of-the-modified-dijkstra-s-routing-algorithm
Science Score: 28.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
○codemeta.json file
-
○.zenodo.json file
-
○DOI references
-
✓Academic publication links
Links to: arxiv.org -
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (8.6%) to scientific vocabulary
Keywords
Repository
This repository provides the quantum implementation of the Modified Dijkstra's Routing Algorithm (https://users.utcluj.ro/~atn/papers/ATN_3_2010_14.pdf) in Qiskit.
Basic Info
Statistics
- Stars: 3
- Watchers: 1
- Forks: 2
- Open Issues: 0
- Releases: 0
Topics
Metadata Files
README.md
Quantum-Implementation-of-the-Modified-Dijkstra-s-Routing-Algorithm
This repository provides the quantum implementation of the Modified Dijkstra's Routing Algorithm (https://users.utcluj.ro/~atn/papers/ATN32010_14.pdf) in Qiskit.
Prerequisites
In order to run quantum processes, we used Qiskit which is an open-source SDK for working with OpenQASM and the IBM Q quantum processors.
Both the Qiskit and IBM Q Experience are free to use; to use IBM Q Experience you need to login on their webpage using an IBMid or a third-party account such as Google, GitHub, LinkedIn or Twitter.
If you want to use Qiskit, you should have on your computer Python 3.6 or later. The official documentation recommends installing Anaconda which has Jupyter included. The installation steps can be found on the following link: https://qiskit.org/documentation/install.html.
Short Description of the Work
We intended to do a quantum implementation of our previous work, namely Modified Dijkstra's Algorithm (https://users.utcluj.ro/~atn/papers/ATN32010_14.pdf). For this, we particularized the Travelling Salesman Problem, obtaining the possible routes from a given source to a destination with a certain probability using a Phase Estimation Quantum Circuit.
After obtaining the routes, we used an optimized version of the Grover quantum search algorithm (https://arxiv.org/ftp/arxiv/papers/1908/1908.07943.pdf) to compute the shortest path between the source and the destination.
Authors
Copyright © Robert BOTEZ, Iustin IVANCIU, Marian IURIAN, Virgil DOBROTA: Robert.Botez@com.utcluj.ro, Iustin.Ivanciu@com.utcluj.ro, Marian.Iurian@com.utcluj.ro, Virgil.Dobrota@com.utcluj.ro
Owner
- Login: robertbotez
- Kind: user
- Repositories: 2
- Profile: https://github.com/robertbotez
Citation (CITATION)
When using this repository please refer to the accompanying article: Botez, Robert, et al. "QUANTUM IMPLEMENTATION OF THE MODIFIED DIJKSTRA’S ROUTING ALGORITHM." PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE 22.1 (2021): 91-98. https://acad.ro/sectii2002/proceedings/doc2021-1/11-Dobrota.pdf
GitHub Events
Total
- Watch event: 2
Last Year
- Watch event: 2