Grover like Operator Using Only Single-Qubit Gates

Abstract

We propose a new quantum circuit for the quantum search problem. The quantum circuit is superior to Grover's algorithm in some realistic cases. The reasons for the superiority are in short as follows: In the quantum circuit proposed in this paper, all the operators except for the oracle can be written as direct products of single-qubit gates. Such separable operators can be executed much faster than multi-particle operators, such as c-NOT gates and Toffoli gates, in many realistic systems. The idea of this quantum circuit is inspired by the Hamiltonian used in the adiabatic quantum computer. In addition, the scaling of the number of oracle calls for this circuit is the same as that for Grover's algorithm, i.e. $O(2^{n/2})$.

9 pages, 1 figure: to appear in Phys. Rev. A

Cited by in corpus (9)

• Depth optimization of quantum search algorithms beyond Grover's algorithm
• Implementation of efficient quantum search algorithms on NISQ computers
• General framework for quantum search algorithms
• Generalized Grover's algorithm for multiple phase inversion states
• Quantum search on noisy intermediate-scale quantum devices
• Faster quantum searching with almost arbitrary operators
• Hardware Efficient Quantum Search Algorithm
• Postprocessing can speed up general quantum search algorithms
• Quantum search algorithm tailored to clause satisfaction problems