Efficient Quantum Computing with weak Measurements

File Size Format
72872_1.pdf 662Kb Adobe PDF View
Title Efficient Quantum Computing with weak Measurements
Author Lund, Austin
Journal Name New Journal of Physics
Year Published 2011
Place of publication United Kingdom
Publisher Institute of Physics Publishing Ltd
Abstract Projective measurements with high quantum efficiency are often assumed to be required for efficient circuit-based quantum computing. We argue that this is not the case and show that the fact that they are not required was actually known previously but was not deeply explored. We examine this issue by giving an example of how to perform the quantum-ordering-finding algorithm efficiently using non-local weak measurements considering that the measurements used are of bounded weakness and some fixed but arbitrary probability of success less than unity is required. We also show that it is possible to perform the same computation with only local weak measurements, but this must necessarily introduce an exponential overhead.
Peer Reviewed Yes
Published Yes
Alternative URI http://dx.doi.org/10.1088/1367-2630/13/5/053024
Copyright Statement Copyright 2011 Institute of Physics Publishing. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.
Volume 13
Page from 1
Page to 16
ISSN 1367-2630
Date Accessioned 2011-08-05
Language en_AU
Faculty Faculty of Science, Environment, Engineering and Technology
Subject Quantum Information, Computation and Communication
URI http://hdl.handle.net/10072/40883
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1

Show simple item record

Griffith University copyright notice