Quantum Oracles in Terms of Universal Gate Set

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.

19 pages, 7 figures. To appear in Int. J. Quant. Info

References in corpus (6)

• Experimental One-Way Quantum Computing
• Quantum Circuits for General Multiqubit Gates
• Implementation of Grover's Quantum Search Algorithm in a Scalable System
• Quantum circuits with uniformly controlled one-qubit gates
• Implementing Grover's Quantum Search on a Para-Hydrogen based Pure State NMR Quantum Computer
• Strength and Weakness in Grover's Quantum Search Algorithm

Cited by in corpus (3)

• A quantum genetic algorithm with quantum crossover and mutation operations
• Quantum Computing by Cooling
• High-Capacity Quantum Associative Memories