Quantum Physics

    

Development of a Quantum Algorithm That Uses Quantum Parallelism for Finding the Shortest Path in a Graph

Authors: Cesar B. Pronin, Andrey V. Ostroukh, Boris V. Pronin

The following research highlights the development of a quantum algorithm designed to use quantum parallelism for performing parallel quantum calculations. This concept was used to make a quantum algorithm for finding the shortest path in a graph. For developing quantum algorithms within 16 qubits, the Quirk quantum circuit emulator was chosen, which has an advanced set of sensors, that allow to visualize the transformations performed in quantum circuits, and a large number of complex quantum gates, which greatly simplifies the construction of new quantum circuits.

Comments: 13 Pages.

Download: PDF

Submission history

[v1] 2020-04-30 18:52:52

Unique-IP document downloads: 162 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus