Share Email Print
cover

Proceedings Paper

NP problems, post-selection and weak measurements
Author(s): Jeff Tollaksen; Debabrata Ghoshal
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

If operations in a quantum computer were conditioned on the results of a subsequent post-selection measurement, then NP-complete problems could be solved in polynomial time. Using the natural connection between post-selection and NP, we show that this result is un-physical by considering constraints on new kinds of measurements which depend on the future post-selection in a non-trivial way. We review practical quantum information advantages of post-selection.

Paper Details

Date Published: 12 May 2006
PDF: 11 pages
Proc. SPIE 6244, Quantum Information and Computation IV, 62440S (12 May 2006); doi: 10.1117/12.666423
Show Author Affiliations
Jeff Tollaksen, George Mason Univ. (United States)
Debabrata Ghoshal, George Mason Univ. (United States)


Published in SPIE Proceedings Vol. 6244:
Quantum Information and Computation IV
Eric J. Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)

© SPIE. Terms of Use
Back to Top