Now showing items 2043-2062 of 2758

    • 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 ...
    • Quantum Speed-ups for Boolean Satisfiability and Derivative-Free Optimization 

      Arunachalam, Srinivasan (University of Waterloo, 2014-04-21)
      In this thesis, we have considered two important problems, Boolean satisfiability (SAT) and derivative free optimization in the context of large scale quantum computers. In the first part, we survey well known classical ...
    • Quantum State Local Distinguishability via Convex Optimization 

      Cosentino, Alessandro (University of Waterloo, 2015-08-24)
      Entanglement and nonlocality play a fundamental role in quantum computing. To understand the interplay between these phenomena, researchers have considered the model of local operations and classical communication, or LOCC ...
    • Quantum state purification 

      Fu, Honghao (University of Waterloo, 2016-08-29)
      Quantum state purification is a process in which decoherence is partially reversed by using multiple copies of the input states that have been subject to the same decoherence effect. This thesis focuses on purifying the ...
    • Quantum State Transfer in Graphs 

      Coutinho, Gabriel (University of Waterloo, 2014-08-13)
      Let X be a graph, A its adjacency matrix, and t a non-negative real number. The matrix exp(i t A) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantum ...
    • Quantum Strategies and Local Operations 

      Gutoski, Gustav (University of Waterloo, 2010-01-06)
      This thesis is divided into two parts. In Part I we introduce a new formalism for quantum strategies, which specify the actions of one party in any multi-party interaction involving the exchange of multiple quantum messages ...
    • Quantum Turing Machines and Quantum Prover-Verifier Interactions 

      Molina Prieto, Abel (University of Waterloo, 2020-07-31)
      We present results on quantum Turing machines and on prover-verifier interactions. In our work on quantum Turing machines, we continue the line of research opened by Yao (1993), who proved that quantum Turing machines ...
    • Quantum Walks and Pretty Good State transfer on Paths 

      van Bommel, Christopher Martin (University of Waterloo, 2019-08-23)
      Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges that needs to be resolved in order to ...
    • Quantum Walks on Oriented Graphs 

      Lato, Sabrina (University of Waterloo, 2019-01-11)
      This thesis extends results about periodicity and perfect state transfer to oriented graphs. We prove that if a vertex a is periodic, then elements of the eigenvalue support lie in Z √∆ for some squarefree negative ...
    • Quantum Walks on Strongly Regular Graphs 

      Guo, Krystal (University of Waterloo, 2010-08-30)
      This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on the amplitudes of walks in the ...
    • Quasi-Hopf Symmetry in Loop Quantum Gravity with Cosmological constant and Spinfoams with timelike surfaces 

      Rennert, Julian (University of Waterloo, 2018-09-20)
      In this thesis we study two separate problems concerning improvements to the Loop quantum gravity and spinfoam approach to quantum gravity. In the first part we address the question about the origin of quantum group ...
    • Quasi-Static Approximation for Numerical Computation of Plasmon Eigenfrequencies in Nanoparticles 

      Alsisi, Abdulhamed (University of Waterloo, 2014-08-28)
      General physical properties of electrostatic (plasmon) resonances in nanoparticles are presented. Direct calculation of the resonance values of the permittivity of nanoparticles, and subsequently their resonance frequencies, ...
    • Quaternion Algebras and Quadratic Forms 

      Zi Yang, Sham (University of Waterloo, 2008-05-12)
      The main goal of this Masters' thesis is to explore isomorphism types of quaternion algebras using the theory of quadratic forms, number theory and algebra. I would also present ways to characterize quaternion algebras, ...
    • Query Answering over Functional Dependency Repairs 

      Galiullin, Artur (University of Waterloo, 2013-09-23)
      Inconsistency often arises in real-world databases and, as a result, critical queries over dirty data may lead users to make ill-informed decisions. Functional dependencies (FDs) can be used to specify intended semantics ...
    • Query Evaluation in the Presence of Fine-grained Access Control 

      Zhang, Huaxin (University of Waterloo, 2008-05-20)
      Access controls are mechanisms to enhance security by protecting data from unauthorized accesses. In contrast to traditional access controls that grant access rights at the granularity of the whole tables or views, ...
    • Query Interactions in Database Systems 

      Ahmad, Mumtaz (University of Waterloo, 2013-01-08)
      The typical workload in a database system consists of a mix of multiple queries of different types, running concurrently and interacting with each other. The same query may have different performance in different mixes. ...
    • Query Optimization for On-Demand Information Extraction Tasks over Text Databases 

      Farid, Mina H. (University of Waterloo, 2012-03-27)
      Many modern applications involve analyzing large amounts of data that comes from unstructured text documents. In its original format, data contains information that, if extracted, can give more insight and help in the ...
    • Query Optimization in Dynamic Environments 

      El-Helw, Amr (University of Waterloo, 2012-05-08)
      Most modern applications deal with very large amounts of data. Having to deal with such huge amounts of data is in itself a challenge. This challenge is complicated even more by the fact that, in many cases, this data is ...
    • Query Similarity for Community Question Answering System Based on Recurrent Encoder Decoder 

      Ye, Borui (University of Waterloo, 2017-01-18)
      The measurement of sentence similarity is a fundamental task in natural language processing. Traditionally, it is measured either from word-level or sentence-level (such as paraphrasing), which requires many lexical and ...
    • A Query-Based Approach for the Analysis of Aspect-Oriented Systems 

      Barrenechea, Eduardo (University of Waterloo, 2007-01-29)
      In recent years, many aspect-oriented languages and methods have been proposed in the literature to support separation of concerns that can be spread throughout a software system and its components and to facilitate ...

      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