Quantum Oracles in Terms of Universal Gate Set
Yuji Tanaka, Tsubasa Ichikawa, Masahito Tada-Umezaki, Yukihiro Ota,, Mikio Nakahara
TL;DR
This paper develops a systematic method for constructing quantum circuits for Grover's algorithm with arbitrary targets, introduces a new operator for target marking, and analyzes conditions for reduced circuit complexity.
Contribution
It introduces a new operator for quantum search, providing a systematic construction method and complexity analysis for arbitrary targets in Grover's algorithm.
Findings
New operator for flipping target signs
Conditions for reduced circuit complexity
Systematic construction method for arbitrary targets
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.