Search
Search results
-
Turing machine
... each step of T is only a polynomial rather than exponential, function of the length of $\ d[T] \$ . In short, if $\ U \$ ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Basic concepts in quantum computation
...
Wiki article - Anonymous (not verified) - 04/01/2016 - 11:49 - 0 comments
-
Grover's search algorithm
...
Wiki article - Anonymous (not verified) - 03/11/2015 - 06:20 - 0 comments
-
Geometric (holonomic) gates
...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments