Abstract
We investigate the entwined roles played by information and quantum algorithms in reducing the complexity of the global optimization problem (GOP). We show that: (i) a modest amount of additional information is sufficient to map the general continuous GOP into the (discrete) Grover problem; (ii) while this additional information is actually available in some classes of GOPs, it cannot be taken advantage of within classical optimization algorithms; (iii) on the contrary, quantum algorithms offer a natural framework for the efficient use of this information, resulting in a speed-up of the solution of the GOP.Key wordsGlobal optimizationsearchGrover's quantum algorithm
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
