NON-COMPUTABILITY. “As we will see the argument also goes in the other direction: If the universal quantum computer produces greater than polynomial complexity in exponential time, then certain hard problems (PSPACE-complete) cannot be solved in polynomial time by a quantum computer.”
https://lnkd.in/dByfCJV
linkedin post 2022-06-29 05:12:48
Nigel Fleming
September 21, 2022