Journal title
Complexity
Volume
4
Last updated
2025-02-18T08:04:15.6+00:00
Page
33
Abstract
Quantum computers use the quantum interference of different computational
paths to enhance correct outcomes and suppress erroneous outcomes of
computations. In effect, they follow the same logical paradigm as
(multi-particle) interferometers. We show how most known quantum algorithms,
including quantum algorithms for factorising and counting, may be cast in this
manner. Quantum searching is described as inducing a desired relative phase
between two eigenvectors to yield constructive interference on the sought
elements and destructive interference on the remaining terms.
paths to enhance correct outcomes and suppress erroneous outcomes of
computations. In effect, they follow the same logical paradigm as
(multi-particle) interferometers. We show how most known quantum algorithms,
including quantum algorithms for factorising and counting, may be cast in this
manner. Quantum searching is described as inducing a desired relative phase
between two eigenvectors to yield constructive interference on the sought
elements and destructive interference on the remaining terms.
Symplectic ID
313216
Download URL
http://arxiv.org/abs/quant-ph/9903061v1
Submitted to ORA
Off
Favourite
Off
Publication type
Journal Article
Publication date
17 Mar 1999