Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in computer and information science

Optimization with Quantum Algorithm that is Based on Grover’s Method

Sh. A. Toirov, Ilhom Boynazarov, Sh. A. Abatov, B. M. Mirsaidov, Zulfiya Ruziyeva

Published Jan 1, 2023• 1 citation
Publisher
DOI
10.1007/978-3-031-31353-0_7

Related papers

Calculating Optimal Searching Times of Grover Algorithm

Atr Key

To obtain the target with the probability of more than0.5,Grover quantum search algorithm need access the unsorted database o(N√)times,and this search algorithm tells people nothing about the optimal searching times.To solve these two problems ,this paper presents an algorithm calculating the optimal searching times.With this searching times Grover Algorithm will obtain the target with almost full probability.Simulation result shows that this calculating method is effective.

Computer Engineering and Applications Journal•Jan 1, 2004•0 citations

Quantum Optimization Techniques and It’s Comparison with Classical Optimization

Pooja P. Kadam, Sachin Kadam

Lecture notes in networks and systems•Jan 1, 2023•1 citation

Depth optimization of quantum search algorithms beyond Grover's algorithm

Kun Zhang, V. E. Korepin

Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum computers. We propose a depth optimization method for the quantum search algorithm. We show that Grover's algorithm is not optimal in depth. We propose a quantum search algorithm, which can be divided into several stages. Each stage has a new initialization, which is a rescaling of the database. This decreases errors. The multistage design is natural for parallel running of the quantum search algorithm.

arXiv:1908.04171•Physical Review A•Mar 26, 2020•55 citations

Using modifications to Grover’s Search algorithm for quantum global optimization

Yipeng Liu, Gary J. Kœhler

European Journal of Operational Research•Jun 17, 2010•23 citations

A review on Quantum Approximate Optimization Algorithm and its variants

Kostas Blekos, Dean Brand, Andrea Ceschini +4 more

arXiv:2306.09198•Physics Reports•Mar 16, 2024•421 citations

Grover's Quantum Algorithm Applied to Global Optimization

W. P. Baritompa, David W. Bulger, Graham R. Wood

Grover's quantum computational search procedure can provide the basis for implementing adaptive global optimization 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 Hoyer and one introduced by the authors fit into this framework and are compared.

SIAM Journal on Optimization•Jan 1, 2005•107 citations
Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum computers. We propose a depth optimization method for the quantum search algorithm. We show that Grover's algorithm is not optimal in depth. We propose a quantum search algorithm, which can be divided into several stages. Each stage has a new initialization, which is a rescaling of the database. This decreases errors. The multistage design is natural for parallel running of the quantum search algorithm.