Quantum computing approach for shortest route finding
Електронного архіву Харківського національного університету радіоелектроніки (Open Access Repository of KHNURE)
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Quantum computing approach for shortest route finding
|
|
| Creator |
Hahanov, V. I.
Miz, V. |
|
| Subject |
quantum computing approach
shortest route finding |
|
| Description |
In this paper shortest path finding approach is proposed. This approach is based on graph theory and uses main idea of the quantum computing. Quantum computing approach allows making parallel computations faster. Using this approach in shortest route fining problem helps to find several ways simultaneously and give several alternative solutions which can be chosen according to special metrics and parameters.
|
|
| Date |
2016-09-02T11:08:11Z
2016-09-02T11:08:11Z 2013 |
|
| Type |
Article
|
|
| Identifier |
Volodymyr Hahanov Quantum computing approach for shortest route finding/Volodymyr Hahanov, Volodymyr Miz//Proceedings of IEEE East-West Design & Test Symposium (EWDTS’2013)
http://openarchive.nure.ua/handle/document/2004 |
|
| Language |
en
|
|
| Publisher |
EWDTS
|
|