Published June 18, 2007
| Version v1
Journal article
Phase matching in Grover's algorithm
Creators
- 1. Department of Control Science and Engineering, Harbin Institute of Technology, Harbin 150001 (China) and Department of Computer Science and Engineering, Daqing Petroleum Institute, Daqing 163318 (China)
- 2. Department of Control Science and Engineering, Harbin Institute of Technology, Harbin 150001 (China)
Description
When the Grover's algorithm is applied to search an unordered database, the probability of getting correct results usually decreases with the increase of marked items. The reason for this phenomenon is analyzed in this Letter, the Grover iteration is studied, and a new phase matching is proposed. With application of the new phase matching, when the fraction of marked items is greater than 1/3, the probability of getting correct results is greater than 25/27 with only one Grover iteration. The validity of the new phase matching is verified by a search example
Additional details
Identifiers
- DOI
- 10.1016/j.physleta.2007.02.029;
- PII
- S0375-9601(07)00201-0;
Publishing Information
- Journal Title
- Physics Letters. A
- Journal Volume
- 366
- Journal Issue
- 1-2
- Journal Page Range
- p. 42-46
- ISSN
- 0375-9601
- CODEN
- PYLAAG
INIS
- Country of Publication
- Netherlands
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 39014072
- Subject category
- S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
- Descriptors DEI
- ALGORITHMS; PROBABILITY; QUANTUM COMPUTERS; QUANTUM INFORMATION; QUANTUM MECHANICS
- Descriptors DEC
- COMPUTERS; INFORMATION; MATHEMATICAL LOGIC; MECHANICS
Optional Information
- Copyright
- Copyright (c) 2007 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.