Efficient quantum computing with weak measurements

Lund, A. P. (2011) Efficient quantum computing with weak measurements. New Journal of Physics, 13 5: . doi:10.1088/1367-2630/13/5/053024

Author Lund, A. P.
Title Efficient quantum computing with weak measurements
Journal name New Journal of Physics   Check publisher's open access policy
ISSN 1367-2630
Publication date 2011-05-16
Year available 2011
Sub-type Article (original research)
DOI 10.1088/1367-2630/13/5/053024
Open Access Status DOI
Volume 13
Issue 5
Total pages 16
Place of publication Bristol, United Kingdom
Publisher Institute of Physics Publishing
Language eng
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.
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Non-UQ

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Mathematics and Physics
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 05 Feb 2016, 19:01:33 EST by System User on behalf of Learning and Research Services (UQ Library)