Grover-algorithm-like operator using only single-qubit gates

Journal Article · Thu Sep 15 00:00:00 EDT 2005 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.72.032319· OSTI ID:20718505

Kato, G ^[1]

---

1. NTT Communication Science Laboratories, NTT Corporation, 3-1, Morinosato Wakamiya, Atsugi-shi, Kanagawa Pref., 243-0198 (Japan)

We propose a 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 multiparticle operators, such as controlled-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{sup n/2})

• OSTI ID: 20718505
• Journal Information: Physical Review. A, Journal Name: Physical Review. A Journal Issue: 3 Vol. 72; ISSN 1050-2947; ISSN PLRAAN
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
ALGORITHMS
GATING CIRCUITS
HAMILTONIANS
INFORMATION THEORY
QUANTUM COMPUTERS
QUBITS