Now showing items 1-2 of 2

    • Lower Bounds on Quantum Query and Learning Graph Complexities 

      Rosmanis, Ansis (University of Waterloo, 2014-07-22)
      In this thesis we study the power of quantum query algorithms and learning graphs; the latter essentially being very specialized quantum query algorithms themselves. We almost exclusively focus on proving lower bounds for ...
    • Quantum Snake Walk on Graphs 

      Rosmanis, Ansis (University of Waterloo, 2010-01-13)
      Quantum walks on graphs have been proven to be a useful tool in quantum algorithm construction for various problems. In this thesis we introduce a new type of continuous-time quantum walk on graphs called the quantum snake ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages