Grover's quantum algorithm applied to global optimisation (2004)
Type of ContentDiscussion / Working Papers
PublisherUniversity of Canterbury. Dept. of Mathematics and Statistics
- Engineering: Reports 
Grover's quantum computational search procedure can provide the basis for implementing adaptive global optimisation algorithms. A brief overview of the procedure is given and a framework called Grover Adaptive Search is set up. A method of Dürr and Høyer and one introduced by the authors fit into this framework and are compared.
Keywordsdiscrete optimisation; global optimisation; Grover iterations; Markov chains; quantum computers; random search
ANZSRC Fields of Research49 - Mathematical sciences::4903 - Numerical and computational mathematics::490304 - Optimisation
08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity
RightsAll Rights Reserved
Showing items related by title, author, creator and subject.
Nakagawa, Y.; James, R.J.W.; Rego, C.; Edirisinghe, C. (University of Canterbury. Management, Marketing, and Entrepreneurship, 2014)This paper develops a new way to help solve difficult linear and nonlinear discrete-optimization decision models more efficiently by introducing a problem-difficulty metric that uses the concept of entropy from information ...
Oo, C. H. (University of Canterbury. Computer Science, 1978)The Dantzig-Wolfe decomposition (linear programming) principle published in 1960 involves the solving of large-scale mathematical programming problems of particular structure. Large practical problems of this type typically ...
Robertson BL; Price C; Reale M (2017)