Search

Search results

  1. 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

  2. Basic concepts in quantum computation

    ...

    Wiki article - Anonymous (not verified) - 04/01/2016 - 11:49 - 0 comments

  3. Grover's search algorithm

    ...

    Wiki article - Anonymous (not verified) - 03/11/2015 - 06:20 - 0 comments

  4. Geometric (holonomic) gates

    ...

    Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments