Jump to ContentJump to Main Navigation
Introduction to Quantum Information Science$
Users without a subscription are not able to see the full content.

Vlatko Vedral

Print publication date: 2006

Print ISBN-13: 9780199215706

Published to Oxford Scholarship Online: January 2010

DOI: 10.1093/acprof:oso/9780199215706.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 16 October 2019

Quantum algorithms

Quantum algorithms

(p.131) 11 Quantum algorithms
Introduction to Quantum Information Science

Vlatko Vedral

Oxford University Press

As computers get faster and faster, the size of the circuitry imprinted onto silicon chips decreases. The size of the circuitry becomes so small that its behavior is governed by the laws of quantum mechanics. Such a computer, whose computations would be fully quantum mechanical, is called a quantum computer. Any computational task such as addition, multiplication, displaying graphics, or updating databases is performed by a computer according to an algorithm — an abstract set of instructions. Quantum computers would accomplish tasks by performing quantum algorithms. A quantum algorithm is a sequence of unitary evolutions carried out on a quantum string made up of qubits, which can exist as a superposition of classical strings. This chapter discusses the computational complexity of a quantum algorithm, Deutsch's algorithm and its efficiency as quantified by the Holevo bound, Oracles, Grover's search algorithm, quantum factorisation, quantum Fourier transform, and phase estimation.

Keywords:   computational complexity, quantum algorithms, Deutsch's algorithm, Holevo bound, Oracles, Grover's search algorithm, quantum factorisation, quantum Fourier transform, phase estimation, quantum computers

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .