User:Keystonescience/Weak value

Quantum Computation
Weak values have been implemented into quantum computing to get a giant speed up in time complexity. In a paper, Arun Kumar Pati describes a new kind of quantum computer using weak value amplification and post-selection (WVAP), and implements search algorithm which (given a successful post selection) can find the target state in a single run with time complexity $$O(\log N)$$, beating out the well know Grover's algorithm.