Published July 20, 2009
| Version v1
Journal article
The quadratic speedup in Grover's search algorithm from the entanglement perspective
Creators
- 1. Physics Department, Poornaprajna Institute of Scientific Research, Devanahalli, Bangalore 562110 (India)
Description
We show that Grover's algorithm can be described as an iterative change of the bipartite entanglement, which leads to a necessary and sufficient condition for quadratic speedup. This allows us to reestablish, from the entanglement perspective, that Grover's search algorithm is the only optimal pure state search algorithm.
Availability note (English)
Available from http://dx.doi.org/10.1016/j.physleta.2009.05.064Additional details
Identifiers
- DOI
- 10.1016/j.physleta.2009.05.064;
- PII
- S0375-9601(09)00675-6;
Publishing Information
- Journal Title
- Physics Letters. A
- Journal Volume
- 373
- Journal Issue
- 31
- Journal Page Range
- p. 2652-2659
- ISSN
- 0375-9601
- CODEN
- PYLAAG
INIS
- Country of Publication
- Netherlands
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 41077521
- Subject category
- S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
- Descriptors DEI
- ALGORITHMS; ITERATIVE METHODS; QUANTUM ENTANGLEMENT
- Descriptors DEC
- CALCULATION METHODS; MATHEMATICAL LOGIC
Optional Information
- Copyright
- Copyright (c) 2009 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.