Quantum computing approach for shortest route finding

Публікація:
Quantum computing approach for shortest route finding

dc.contributor.author	Hahanov, V. I.
dc.contributor.author	Miz, V.
dc.date.accessioned	2016-09-02T11:08:11Z
dc.date.available	2016-09-02T11:08:11Z
dc.date.issued	2013
dc.description.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.	uk_UA
dc.identifier.citation	Volodymyr Hahanov Quantum computing approach for shortest route finding/Volodymyr Hahanov, Volodymyr Miz//Proceedings of IEEE East-West Design & Test Symposium (EWDTS’2013)	uk_UA
dc.identifier.uri	http://openarchive.nure.ua/handle/document/2004
dc.language.iso	en	uk_UA
dc.publisher	EWDTS	uk_UA
dc.subject	quantum computing approach	uk_UA
dc.subject	shortest route finding	uk_UA
dc.title	Quantum computing approach for shortest route finding	uk_UA
dc.type	Article	uk_UA
dspace.entity.type	Publication