Dynamic Grover search: applications in recommendation systems and optimization problems

DOI10.1007/S11128-017-1600-4MaRDI QIDQ1679370zbMATH OpenOpenAlexFDO

Authors Indranil Chakrabarty, Shahzor Khan, Vanshdeep Singh

Publication date 9 November 2017

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.00895

zbMATH Keywords

dynamic Grover searchdynamic oraclequantum probability searchingquantum recommendation system

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Abstract: In the recent years, we have seen that Grover search algorithm (Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212-219, 1996) by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparisons to classical systems. In this work, we explore the idea of extending Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with a dynamic selection function in contrast to the static selection function used in the original work (Grover in Proceedings, 28th annual ACM symposium on the theory of computing, pp. 212-219, 1996). We show that this alteration facilitates us to extend the application of Grover search to the field of randomized search algorithms. Further, we use the dynamic Grover search algorithm to define the goals for a recommendation system based on which we propose a recommendation algorithm which uses binomial similarity distribution space giving us a quadratic speedup over traditional classical unstructured recommendation systems. Finally, we see how dynamic Grover search can be used to tackle a wide range of optimization problems where we improve complexity over existing optimization algorithms.

Recommendations

• A new hybrid classical-quantum algorithm for continuous global optimization problems
• Combining a local search and Grover's algorithm in black-box global optimization
• A hybrid method for quantum global optimization
• Grover's Quantum Algorithm Applied to Global Optimization
• Quantum distributed computing applied to Grover's search algorithm

Cites work

• A hybrid recommender system for the selective dissemination of research resources in a technology transfer office
• Algorithmics for hard problems.
• Fixed-point quantum search
• Geometric pictures for quantum search algorithms
• Global best harmony search algorithm with control parameters co-evolution based on PSO and its application to constrained optimal problems
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5320203 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1775388 (Why is no real title available?)
• Phase matching in quantum searching.
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters
• Rapid solution of problems by quantum computation

Cited in

(5)

• Performance of Grover's search algorithm with diagonalizable collective noises
• Non-Boolean quantum amplitude amplification and quantum mean estimation
• Resource-efficient quantum data representation based on Grover's algorithm
• Quantum key distribution in multiparty computation for data sorting by entanglement
• Using quantum switches to mitigate noise in Grover's search algorithm

This page was built for publication: Dynamic Grover search: applications in recommendation systems and optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679370)