Please use this identifier to cite or link to this item: http://openarchive.nure.ua/handle/document/2004
Title: Quantum computing approach for shortest route finding
Authors: Hahanov, Volodymyr
Miz, Volodymyr
Keywords: quantum computing approach
shortest route finding
Issue Date: 2013
Publisher: EWDTS
Citation: Volodymyr Hahanov Quantum computing approach for shortest route finding/Volodymyr Hahanov, Volodymyr Miz//Proceedings of IEEE East-West Design & Test Symposium (EWDTS’2013)
Abstract: 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.
URI: http://openarchive.nure.ua/handle/document/2004
Appears in Collections:Кафедра автоматизації проектування обчислювальної техніки (АПОТ)

Files in This Item:
File Description SizeFormat 
Хаханов_2_EWDTS_2013.pdf2.64 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.