Efficient quantum computing with weak measurements

Details Efficient quantum computing with weak measurements Efficient quantum computing with weak measurements

2011-01-24

arxiv.org/abs/1101.4510v1

Physics

Quantum Physics

Scientific paper

Projective measurements with high quantum efficiency is often assumed to be required for efficient circuit based quantum computing. We argue that this is not the case and show that this fact has actually be known previously though 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 given 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.

Affiliated with

Also associated with

No associations

Rating

Efficient quantum computing with weak measurements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient quantum computing with weak measurements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient quantum computing with weak measurements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637008