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

Chapman & Hall/CRC applied mathematics and nonlinear science series

A Realization Scheme for Quantum Multi-Object Search

Zijian Diao, Peter J.-S. Shiue, Goong Chen

Published Sep 19, 2007• 0 citations
Publisher
DOI
10.1201/9781584889007.ch2

Related papers

Quantum multi-object search algorithm

Wan‐Su Bao

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

Distributed Multi-objective Quantum Search Algorithm

Hao Li, Daowen Qiu

Lecture notes in computer science•Jan 1, 2025•3 citations

Multi-object quantum traveling ballot scheme

李渊 Yuan Li, 曾贵华. Guihua Zeng

Based on quantum mechanics, a traveling ballot scheme with anonymity and secrecy is introduced to realize voting.By searching the objects in large amount of data bases, every voter may cast votes to his desired candidates.Therefore, the proposed scheme may be applied to voting with a great deal of candidates, such as network voting and so on.The security analysis of the present scheme is also performed.

Chinese Optics Letters•Jan 1, 2009•3 citations

A framework for structured quantum search

Tad Hogg

arXiv:quant-ph/9701013•Physica D Nonlinear Phenomena•Sep 1, 1998•23 citations

A Realization Scheme for Quantum Multi-Object Search

Zijian Diao, Goong Chen, Peter J.-S. Shiue

Abstract We study the quantum circuit design using 1-bit and 2-bit unitary gates for the iterations of the multi-object quantum search algorithm. The oracle block is designed in order to efficiently implement any sign-flipping operations. A chief ingredient in the design is the permutation operator which maps a set of search targets to another set on which the sign-flipping operation can be easily done. Such a proposed algorithmic approach implicates a minimal symmetric group generation problem: how to generate elements of a symmetric group using the smallest number of concatenations with a set of given generators. For the general case, this is an open problem. We indicate how the complexity issues depend on the solution of this problem through simple examples.

Chapman & Hall/CRC eBooks•Sep 19, 2007•0 citations

An alternate algorithm for directed quantum search

Tathagat Tulsi, Lov K. Grover, Apoorva D. Patel

•May 2, 2005•0 citations
Abstract We study the quantum circuit design using 1-bit and 2-bit unitary gates for the iterations of the multi-object quantum search algorithm. The oracle block is designed in order to efficiently implement any sign-flipping operations. A chief ingredient in the design is the permutation operator which maps a set of search targets to another set on which the sign-flipping operation can be easily done. Such a proposed algorithmic approach implicates a minimal symmetric group generation problem: how to generate elements of a symmetric group using the smallest number of concatenations with a set of given generators. For the general case, this is an open problem. We indicate how the complexity issues depend on the solution of this problem through simple examples.