Phase Matching in Quantum Searching and the Improved Grover Algorithm

LONG  Gui-lu; LI  Yan-song; XIAO Li; TU Chang-cun; SUN Yang

doi:10.11804/NuclPhysRev.21.02.114

PDF
Cite
Share
facebook

twitter

google

linkedin

Volume 21 Issue 2

Turn off MathJax

Article Contents

Article Navigation > Nuclear Physics Review > 2004 > 21(2): 114-116

LONG Gui-lu, LI Yan-song, XIAO Li, TU Chang-cun, SUN Yang. Phase Matching in Quantum Searching and the Improved Grover Algorithm[J]. Nuclear Physics Review, 2004, 21(2): 114-116. doi: 10.11804/NuclPhysRev.21.02.114

Citation:

LONG Gui-lu, LI Yan-song, XIAO Li, TU Chang-cun, SUN Yang. Phase Matching in Quantum Searching and the Improved Grover Algorithm[J]. Nuclear Physics Review, 2004, 21(2): 114-116. doi: 10.11804/NuclPhysRev.21.02.114

Phase Matching in Quantum Searching and the Improved Grover Algorithm

doi: 10.11804/NuclPhysRev.21.02.114

Department of Physics, Tsinghua University, Beijing 100084, China)( Key Laboratory For Quantum Information and Measurements, MOE, Beijing 100084, China

Received Date: 1900-01-01
Rev Recd Date: 1900-01-01
Publish Date: 2004-06-20

Abstract

We briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. The Grover algorithm is not 100% in success rate, an improved Grover algorithm with zerofailure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned.
- quantum searching,
- phase matching,
- grover algorithm,
- quantum computing
References
Proportional views

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

Get Citation

PDF

XML

Article Metrics

Article views(2909) PDF downloads(831) Cited by()

Proportional views

Phase Matching in Quantum Searching and the Improved Grover Algorithm

doi: 10.11804/NuclPhysRev.21.02.114

Department of Physics, Tsinghua University, Beijing 100084, China)( Key Laboratory For Quantum Information and Measurements, MOE, Beijing 100084, China

Received Date: 1900-01-01
Rev Recd Date: 1900-01-01
Publish Date: 2004-06-20

Key words:

Abstract: We briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. The Grover algorithm is not 100% in success rate, an improved Grover algorithm with zerofailure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned.