Quantum Database Search by a Single Query

Authors:
Dong Pyo Chi;Jinsoo Kim
Affiliations:
-;-
Venue:
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Year:
1998

Citing 3
Cited 4

Strengths and Weaknesses of Quantum Computing

SIAM Journal on Computing
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Tight bounds on quantum searching

Tight bounds on quantum searching

Improved algorithms for quantum identification of boolean oracles

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A hybrid method for quantum global optimization

Journal of Global Optimization
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems

Quantum Information & Computation
Topological Structure of Quantum Algorithms

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give a quantum mechanical algorithm that can search a database by a single query when the number of solutions is more than a quarter. It utilizes the generalized Grover operator of arbitrary phase.