Paper
12 May 2006 NP problems, post-selection and weak measurements
Jeff Tollaksen, Debabrata Ghoshal
Author Affiliations +
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.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jeff Tollaksen and Debabrata Ghoshal "NP problems, post-selection and weak measurements", Proc. SPIE 6244, Quantum Information and Computation IV, 62440S (12 May 2006); https://doi.org/10.1117/12.666423
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Particles

Quantum communications

Quantum information

Quantum computing

Mendelevium

Superposition

Measurement devices

RELATED CONTENT

Diagrammatic quantum mechanics
Proceedings of SPIE (May 21 2015)
Quantum teleportation and survey technology
Proceedings of SPIE (October 22 2010)
Quantum models of Parrondo's games
Proceedings of SPIE (November 13 2002)

Back to Top