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

Jisuanji gongcheng

Mining web data with quantum Grover search algorithm

MU Wan-jun, Zhisheng You

Published Jan 1, 2005• 1 citation
OpenAlex

Abstract

A kind of method of web data mining on association rule,authoritative Web pages and Weblog items with quantum Grover search algorithm and probability were given in this paper,and then the algorithm to be optimal in mining a large volumes of unsorted and unstructured Web data was dicussed.

Related papers

Quantum Algorithm for Mining Frequent Patterns for Association Rule Mining

Abdirahman Alasow, Marek A. Perkowski

Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting correlations, frequent patterns, associations, or causal structures between items hidden in a large database. By exploiting quantum computing, we propose an efficient quantum search algorithm design to discover the maximum frequent patterns. We modified Grover’s search algorithm so that a subspace of arbitrary symmetric states is used instead of the whole search space. We presented a novel quantum oracle design that employs a quantum counter to count the maximum frequent items and a quantum comparator to check with a minimum support threshold. The proposed derived algorithm increases the rate of the correct solutions since the search is only in a subspace. Furthermore, our algorithm significantly scales and optimizes the required number of qubits in design, which directly reflected positively on the performance. Our proposed design can accommodate more transactions and items and still have a good performance with a small number of qubits.

Journal of Quantum Information Science•Jan 1, 2023•3 citations

Quantum search on relevant words

MU Wan-jun, Zhisheng You

The paper discusses quantum search algorithm based on quantum parallelism and superposition state,and gives a computing way according to Grover's search algorithm and probability to search relevant words from a large volumes of unstructured data,and then describes the algorithm to be optimal(comparing with any classical algorithm).

Chinese journal of atomic and molecular physics•Jan 1, 2005•0 citations

Quantum searching algorithm based on the weighting marked items

Xin Li, Kaoping Song, Ning Sun +1 more

The current Grover quantum searching algorithm can not identify the difference in importance of the marked items when it is applied to an unsorted quantum database, and the probability for each marked item is equal. To solve the problem, a Grover searching algorithm based on the weighted marked items is proposed. Firstly, each marked item is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the marked items are represented as a quantum superposition state. Secondly, the novel Grover searching algorithm based on the quantum superposition of the weighting marked items is constructed. Using this algorithm the probability of getting each marked item can be approximated to the corresponding weight coefficient, which the flexibility of this algorithm is shown. Finally, the validity of the algorithm is validated by a simple searching example.

Chinese Control Conference (CCC)•Jul 26, 2013•0 citations

Grover Algorithm: Enhancing the Search Mechanism

Jagriti Malhotra, Omkar Chavan, Pallavi Thakur

Grover’s algorithm is a quantum search algorithm that makes a huge difference in finding an element of interest from unsorted and unstructured data. In the case of a classical search algorithm, testing O(N) elements within a dataset of size N is a significant number. Grover’s algorithm reduces this number to $O(\sqrt N )$ so the gain is obvious. This paper covers applied aspects of Grover’s algorithm, namely quantum circuit layout, efficiency of gates, fidelity of qubits, and the optimization of resources for searching unstructured data. Focus has been placed on quantum error correction: namely, planar surface code; resource costs involved have been quantified. The paper discusses the implications of quantum computing on data retrieval and how algorithms in quantum computing are crucial for solving issues presented by a changing environment of computation.

OPJU International Technology Conference on Smart Computing for Innovation and Advancement in Industry (OTCON)•Apr 9, 2025•2 citations

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

Data Search Algorithms based on Quantum Walk

Masataka Fujisaki, Hiromi Miyajima, Noritaka Shigei

For searching any item in an unsorted database with N items, a classical computer takes O(N) steps but Grover’s quantum searching algorithm takes only O( √ N) steps. However, it is also known that Grover’s algorithm is effective only in the case where the initial amplitude distribution of dataset is uniform, but is not always effective in the nonuniform case. In this paper, we propose some quantum search algorithms. First, we propose an algorithm in analog time based on quantum walk by solving the schrodinger equation. The proposed algorithm shows best performance in optimum time. Next, we will apply the result to Grover search algorithm. It is shown that the proposed algorithm shows better performance than the conventional one. Further, we propose the improved algorithm by introducing the idea of the phase rotation. The algorithm shows best performance compared with the conventional ones.

Lecture notes in computer science•Jan 1, 2012•2 citations
Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting correlations, frequent patterns, associations, or causal structures between items hidden in a large database. By exploiting quantum computing, we propose an efficient quantum search algorithm design to discover the maximum frequent patterns. We modified Grover’s search algorithm so that a subspace of arbitrary symmetric states is used instead of the whole search space. We presented a novel quantum oracle design that employs a quantum counter to count the maximum frequent items and a quantum comparator to check with a minimum support threshold. The proposed derived algorithm increases the rate of the correct solutions since the search is only in a subspace. Furthermore, our algorithm significantly scales and optimizes the required number of qubits in design, which directly reflected positively on the performance. Our proposed design can accommodate more transactions and items and still have a good performance with a small number of qubits.
The current Grover quantum searching algorithm can not identify the difference in importance of the marked items when it is applied to an unsorted quantum database, and the probability for each marked item is equal. To solve the problem, a Grover searching algorithm based on the weighted marked items is proposed. Firstly, each marked item is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the marked items are represented as a quantum superposition state. Secondly, the novel Grover searching algorithm based on the quantum superposition of the weighting marked items is constructed. Using this algorithm the probability of getting each marked item can be approximated to the corresponding weight coefficient, which the flexibility of this algorithm is shown. Finally, the validity of the algorithm is validated by a simple searching example.
Grover’s algorithm is a quantum search algorithm that makes a huge difference in finding an element of interest from unsorted and unstructured data. In the case of a classical search algorithm, testing O(N) elements within a dataset of size N is a significant number. Grover’s algorithm reduces this number to O(N)O(\sqrt N )O(N​) so the gain is obvious. This paper covers applied aspects of Grover’s algorithm, namely quantum circuit layout, efficiency of gates, fidelity of qubits, and the optimization of resources for searching unstructured data. Focus has been placed on quantum error correction: namely, planar surface code; resource costs involved have been quantified. The paper discusses the implications of quantum computing on data retrieval and how algorithms in quantum computing are crucial for solving issues presented by a changing environment of computation.
For searching any item in an unsorted database with N items, a classical computer takes O(N) steps but Grover’s quantum searching algorithm takes only O( √ N) steps. However, it is also known that Grover’s algorithm is effective only in the case where the initial amplitude distribution of dataset is uniform, but is not always effective in the nonuniform case. In this paper, we propose some quantum search algorithms. First, we propose an algorithm in analog time based on quantum walk by solving the schrodinger equation. The proposed algorithm shows best performance in optimum time. Next, we will apply the result to Grover search algorithm. It is shown that the proposed algorithm shows better performance than the conventional one. Further, we propose the improved algorithm by introducing the idea of the phase rotation. The algorithm shows best performance compared with the conventional ones.