Публікація: Quantum computing approach for shortest route finding
Завантаження...
Дата
2013
Автори
Назва журналу
ISSN журналу
Назва тома
Видавництво
EWDTS
Анотація
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.
Опис
Ключові слова
quantum computing approach, shortest route finding
Бібліографічний опис
Volodymyr Hahanov Quantum computing approach for shortest route finding/Volodymyr Hahanov, Volodymyr Miz//Proceedings of IEEE East-West Design & Test Symposium (EWDTS’2013)