Quantum Oracles in Terms of Universal Gate Set
Quantum Physics
2011-10-31 v2
Abstract
We present a systematic construction of quantum circuits implementing Grover's database search algorithm for arbitrary number of targets. We introduce a new operator which flips the sign of the targets and evaluate its circuit complexity. We find the condition under which the circuit complexity of the database search algorithm based on this operator is less than that of the conventional one.
Cite
@article{arxiv.1008.4643,
title = {Quantum Oracles in Terms of Universal Gate Set},
author = {Yuji Tanaka and Tsubasa Ichikawa and Masahito Tada-Umezaki and Yukihiro Ota and Mikio Nakahara},
journal= {arXiv preprint arXiv:1008.4643},
year = {2011}
}
Comments
19 pages, 7 figures. To appear in Int. J. Quant. Info