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. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 17 February 2019

Entanglement, computation and quantum measurements

Entanglement, computation and quantum measurements

Chapter:
(p.146) 12 Entanglement, computation and quantum measurements
Source:
Introduction to Quantum Information Science
Author(s):

Vlatko Vedral

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199215706.003.00012

This chapter introduces a method that combines the concepts of quantum entanglement with those of quantum algorithms. In particular, some bounds are placed on the efficiency (speedup) of quantum computations by using the fact that there is a limit to how quickly entanglement can be generated with some operations. This method will truly exploit the “many-worlds” nature of quantum superpositions. By solving one problem using a superposition of qubits as well as solving a superposition of problems, the efficiency of some quantum tasks can be evaluated. This chapter demonstrates that a quantum search cannot be performed faster than the square root of the time of the corresponding classical search (winch is still very much faster). The use of entanglement to optimise quantum searches is discussed, along with a model for quantum measurement, similarity between quantum computation and a quantum measurement as described by von Neumann, correlations and quantum measurement, and the Bekenstein bound as an example of the ultimate limits of quantum computation.

Keywords:   quantum entanglement, quantum measurement, quantum algorithms, quantum computation, quantum superpositions, qubits, quantum search, Bekenstein bound

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 .