On quantum algorithms

, , , &
Complexity 4 (1):33-42 (1998)
  Copy   BIBTEX

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 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.

Categories

Keywords

Reprint years

DOI

10.1002/(sici)1099-0526(199809/10)4:1<33::aid-cplx10>3.0.co;2-u

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Quantum hypercomputation—hype or computation?Amit Hagar & Alex Korolev - 2007 - Philosophy of Science 74 (3):347-363.
The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction.Amit Hagar - 2010 - Morgan & Claypool Publishers.
Quantum algorithms: Philosophical lessons.Amit Hagar - 2007 - Minds and Machines 17 (2):233-247.
Quaternionic Quantum Dynamics on Complex Hilbert Spaces.Matthew A. Graydon - 2013 - Foundations of Physics 43 (5):656-664.
Quantum computing.Amit Hagar & Michael Cuffaro - 2019 - Stanford Encyclopedia of Philosophy.
The physics of quantum information: Quantum cryptography, quantum teleportation, quantum computation - D. bouwmeester, A. Ekert and A. Zeilinger (eds.); Germany, 2000, 314pp, US$ 54, ISBN 3-540-66778-. [REVIEW]A. Duwell - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 34 (2):331-334.
It is not evolution, but a better game would need a better agent.Christian Huyck & Ian Mitchell - 2005 - Behavioral and Brain Sciences 28 (4):499-500.
Selected papers on design of algorithms.Donald Ervin Knuth - 2010 - Stanford, Calif.: Center for the Study of Language and Information.
On logic of complex algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.
On the convergence of a factorized distribution algorithm with truncation selection.Qingfu Zhang - 2004 - Complexity 9 (4):17-23.
Algorithms, Abstraction and Implementation.C. Foster - 1990 - Academic Press.
When are two algorithms the same?Andreas Blass, Nachum Dershowitz & Yuri Gurevich - 2009 - Bulletin of Symbolic Logic 15 (2):145-168.
A probabilistic approach to quantum mechanics based on tomograms.Michele Caponigro, Stefano Mancini & Vladimir I. Man'ko - unknown

Analytics

Added to PP
2013-11-21

Downloads
19 (#750,145)

6 months
1 (#1,444,594)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references