Quantum oracles in terms of universal gate set
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(10)- A quantum genetic algorithm with quantum crossover and mutation operations
- Quantum search for scaled hash function preimages
- Quantum circuits for OR and AND of ORs.
- Universal Sets of Quantum Information Processing Primitives and their optimal use
- Quantum functional oracles
- Oracles with costs
- A realization scheme for quantum multi-object search
- Phase shift and multi-controlled \(Z\)-type gates
- On the role of Hadamard gates in quantum circuits
- Quantum circuit oracles for abstract machine computations
This page was built for publication: Quantum oracles in terms of universal gate set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111218)