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

Bulletin of the American Physical Society

Implement quantum search and quantum counting algorithms by geometric quantum computation

Qinghua Zhang, Gui‐Lu Long, Zidan Wang

Published Mar 8, 2007• 0 citations
OpenAlex

Related papers

Deterministic Search on Complete Bipartite Graphs by Continuous-Time Quantum Walk

Honghong Lin, Yun Shang

Abstract How to design deterministic spatial search algorithms is a difficult but important problem. This paper presents a deterministic search algorithm on complete bipartite graphs with optimal runtime scaling. Our algorithm adopts the simple form of alternating iterations of an oracle and a continuous-time quantum walk operator, which is a generalization of Grover's search algorithm. To address the case of the number of marked vertices being unknown, we construct a quantum counting algorithm based on the spectrum structure of the search operator. This is a non-trivial example of quantum counting for spatial search. To implement the continuous-time quantum walk operator, we perform Hamiltonian simulation in the quantum circuit model and simulate it on the IBM quantum computing platform Qiskit.

arXiv:2404.01640•Quantum Information and Computation•Oct 1, 2024•2 citations

Quantum computing and quantum search algorithms

Zijian Diao, Goong Chen

•Jan 1, 2001•0 citations

Approximate Quantum Counting on an NMR Ensemble Quantum Computer

Jonathan A. Jones, Michele Mosca

We demonstrate the implementation of a quantum algorithm for estimating the number of matching items in a search operation using a two qubit nuclear magnetic resonance (NMR) quantum computer.

arXiv:quant-ph/9808056•Physical Review Letters•Aug 2, 1999•65 citations

Geometric Quantum Computing

Eduardo Jose Bayro-Corrochano

Springer eBooks•Jan 1, 2024•0 citations

Implementation of a quantum search algorithm on a quantum computer

Jonathan A. Jones, Michele Mosca, Rasmus H. Hansen

arXiv:quant-ph/9805069•Nature•May 1, 1998•556 citations

QUANTUM COMPUTING, GROVER'S SEARCH ALGORITHM AND ITS APPLICATIONS IN BIOINFORMATICS

Keng Wah Choo

This article reviews quantum computing and quantum algorithms. Some insights into its potential in speeding up computations are covered, with emphasis on the use of Grover's Search. In the last section, we discuss applications of quantum algorithm to bioinformatics. In particular, the extension of quantum counting algorithm to protein mass spectra counting is proposed.

COSMOS•May 1, 2006•6 citations
Abstract How to design deterministic spatial search algorithms is a difficult but important problem. This paper presents a deterministic search algorithm on complete bipartite graphs with optimal runtime scaling. Our algorithm adopts the simple form of alternating iterations of an oracle and a continuous-time quantum walk operator, which is a generalization of Grover's search algorithm. To address the case of the number of marked vertices being unknown, we construct a quantum counting algorithm based on the spectrum structure of the search operator. This is a non-trivial example of quantum counting for spatial search. To implement the continuous-time quantum walk operator, we perform Hamiltonian simulation in the quantum circuit model and simulate it on the IBM quantum computing platform Qiskit.