Now showing items 1-5 of 5

    • Efficient Composition of Discrete Time Quantum Walks 

      Lou, Xingliang (University of Waterloo, 2017-01-20)
      It is well known that certain search problems are efficiently solved by quantum walk algorithms. Of particular interest are those problems whose efficient solutions involve nesting of search algorithms. The nesting of ...
    • Learning Quantum States Without Entangled Measurements 

      Lowe, Angus (University of Waterloo, 2021-10-22)
      How many samples of a quantum state are required to learn a complete description of it? As we will see in this thesis, the fine-grained answer depends on the measurements available to the learner, but in general it is at ...
    • Noisy Interactive Quantum Communication 

      Shayeghi, Ala (University of Waterloo, 2020-08-25)
      We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n ...
    • Quantum Compression and Quantum Learning via Information Theory 

      Bab Hadiashar, Shima (University of Waterloo, 2020-12-21)
      This thesis consists of two parts: quantum compression and quantum learning theory. A common theme between these problems is that we study them through the lens of information theory. We first study the task of visible ...
    • Some Upper and Lower Bounds regarding Query Complexity 

      Liu, Rui Peng (University of Waterloo, 2017-08-29)
      Query complexity is one of the several notions of complexity de ned to measure the cost of algorithms. It plays an important role in demonstrating the quantum advantage, that quantum computing is faster than classical ...

      UWSpace

      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