Evaluation of Resource optimization based on quantum search

Authors

  • Sara El Gaily

DOI:

https://doi.org/10.33927/hjic-2019-03

Keywords:

quantum computing, quantum existence testing, finding extreme values in an unsorted database, resource management distribution, exhaustive algorithm, heuristic algorithm, computational complexity

Abstract

Quantum computing and communications try to identify more efficient solutions to the most challenging classical problems such as optimization, secure information transfer, etc. This paper will describe a new quantum method for the distribution of resources in computing platforms that consist of a large number of computing units. Furthermore, a simulation environment was developed and the performance of the new method compared to a classical reference strategy will be demonstrated. Moreover, it will be proven that the proposed solution tackles the problems of computational complexity, computing units that are time-consuming and slow to process, as well as the accuracy in determining the optimum result.

Author Biography

Sara El Gaily

Department of Networked Systems and Services, Budapest University of Technology and Economics, Műegyetem rkp. 3-9, Budapest, 1111, HUNGARY

Downloads

Published

2018-12-07

How to Cite

Gaily, S. E. (2018). Evaluation of Resource optimization based on quantum search. Hungarian Journal of Industry and Chemistry, 47(1), 11–16. https://doi.org/10.33927/hjic-2019-03