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

The European Physical Journal Plus

High-dimensional Grover multi-target search algorithm on Cirq

Erdi Acar, Sabri Gündüz, Güven Akpınar, İhsan Yılmaz

Published Feb 1, 2022• 6 citations
Publisher
DOI
10.1140/epjp/s13360-022-02460-w

Related papers

Dynamical analysis of Grover’s search algorithm in arbitrarily high-dimensional search spaces

Wenliang Jin

Quantum Information Processing•Oct 30, 2015•9 citations

Grover Search and its Applications

Byung-Soo Choi

•Jun 1, 2011•0 citations

Improved quantum multi-object search algorithm

Wei-Yun Ma

Grover’s quantum mechanical search algorithm solves the unsorted database search with quadratic speed-up over the classical algorithms.But Grover’s algorithm will be inefficient when the number of matching is close to 2n/2.This paper presents a quantum algorithm which can get a target item with certainty by a single query when the number of the target items is more than a quarter.

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

Grover’s quantum search algorithm

Samuel J. Lomonaco

Proceedings of symposia in applied mathematics•Jan 1, 2002•6 citations

Dimension Reduction for Efficient Pattern Recognition in High Spatial Resolution Data Using Quantum Algorithms

Naveed Mahmud, Esam El‐Araby

With the promising advancement in quantum computing technology in the last decade, there is a strong motivation to find suitable applications for quantum algorithms and quantum computers. Domains such as High Energy Physics (HEP) have an enormous readout count of high-resolution data. Performing pattern recognition on this readout is computationally challenging and time-consuming because of the multi-dimensionality of the data. In this paper, we propose a methodology that employs quantum algorithms such as Quantum Wavelet Transform and Grover's search algorithm for timeefficient pattern recognition in data sets that are characterized by high spatial resolution and high dimensionality. The motivation behind using quantum algorithms is the potential speedup relative to classical methods, when performed by a quantum computer. In our proposed methodology, Quantum Wavelet Transform is performed on the high spatial resolution data to reduce its dimensionality while quantum Grover's search algorithm is employed to search for target patterns in the reduced data set. Performing the search operation on data with reduced spatial resolution, minimizes processing overheads and computation times. Moreover, use of quantum techniques yield faster results, compared to classical dimension reduction and search methods. We demonstrate the feasibility of the proposed methodology by emulating the quantum algorithms on classical hardware based on field programmable gate arrays (FPGAs). A high performance reconfigurable computer (HPRC) was used for the experimental evaluation. The obtained results are favorable towards our proposed approach.

IEEE International System-on-Chip Conference (SOCC)•Sep 1, 2019•3 citations

Quantum multi-programming for Grover’s search

Gilchan Park, Kun Zhang, Kwangmin Yu +1 more

arXiv:2207.14464•Quantum Information Processing•Jan 18, 2023•34 citations
With the promising advancement in quantum computing technology in the last decade, there is a strong motivation to find suitable applications for quantum algorithms and quantum computers. Domains such as High Energy Physics (HEP) have an enormous readout count of high-resolution data. Performing pattern recognition on this readout is computationally challenging and time-consuming because of the multi-dimensionality of the data. In this paper, we propose a methodology that employs quantum algorithms such as Quantum Wavelet Transform and Grover's search algorithm for timeefficient pattern recognition in data sets that are characterized by high spatial resolution and high dimensionality. The motivation behind using quantum algorithms is the potential speedup relative to classical methods, when performed by a quantum computer. In our proposed methodology, Quantum Wavelet Transform is performed on the high spatial resolution data to reduce its dimensionality while quantum Grover's search algorithm is employed to search for target patterns in the reduced data set. Performing the search operation on data with reduced spatial resolution, minimizes processing overheads and computation times. Moreover, use of quantum techniques yield faster results, compared to classical dimension reduction and search methods. We demonstrate the feasibility of the proposed methodology by emulating the quantum algorithms on classical hardware based on field programmable gate arrays (FPGAs). A high performance reconfigurable computer (HPRC) was used for the experimental evaluation. The obtained results are favorable towards our proposed approach.