A Polynomial Time Bounded-Error Quantum Algorithm for Boolean Satisfiability

Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by Xcelerate on Thursday July 30, 2015 @05:14AM (#9973855)

> which have so far failed to explain the appearance of non-linear processes in quantum mechanics satisfactorily.

There's a famous theorem that any non-linearity in quantum mechanics (however small) would permit FTL information transfer. Could you link me one paper (either from a reputable journal or a highly cited article on the arXiv) that demonstrates non-linearity other than the exception of instantaneous collapse via measurement?

[ Parent | on HN ]

Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by Certhas on Monday August 03, 2015 @09:27AM (#9995581)

I wasn't talking about non-linearity other than the one you mention. That should be abundantly obvious from what I posted.

You can't have quantum computation without measurement, and thus without non-linearity. Quantum computation is not simply "doing the computation in each possible world", it also is some trick to extract (collapse) the information into one particular world, and I don't think we currently understand fully what that means, but it's certainly non-linear. After all the information is often in the amplitude.

Conversely there are measurement based models for quantum computation that rely purely on the non-linear process.

[ Parent | on HN ]