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

Journal of Optimization Theory and Applications

Implementing Pure Adaptive Search with Grover's Quantum Algorithm

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

Published Mar 1, 2003• 77 citations
Publisher
DOI
10.1023/a:1023061218864

Related papers

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

Trimming Grover's Quantum Search Algorithm

Grant Eberle, Gonzalo E. Ordonez

Bulletin of the American Physical Society•Mar 2, 2020•0 citations

Deterministic application of Grover's quantum search algorithm

治 渡辺, OSAMU WATANABE

•Jan 1, 2000•0 citations

Speed-up and entanglement in quantum searching

Samuel L. Braunstein, Arun Kumar Pati

We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `charged for' then in existing machines speed-up without entanglement is not possible.

arXiv:quant-ph/0008018•Aug 3, 2000•2 citations

A review on quantum search algorithms

Pulak Ranjan Giri, V. E. Korepin

arXiv:1602.02730•Quantum Information Processing•Nov 13, 2017•82 citations

Speed-up and entanglement in quantum Searching

Samuel L. Braunstein, Arun Kumar Pati

We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `charged for' then in existing machines speed-up without entanglement is not possible.

Quantum Information and Computation•Aug 1, 2002•14 citations
We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `charged for' then in existing machines speed-up without entanglement is not possible.
We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `charged for' then in existing machines speed-up without entanglement is not possible.