Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 10 of 10 for “"Continuous time quantum walk"”.

  1. Implementing Quantum Gates With Length-3 Dynamic Graphs

    The continuous-time quantum walk is a quantum version of a random walk that evolves by Schrodinger's equation. With the Hamiltonian equal to the adjacency matrix of a sequence of graphs, called a dynamic graph, continuous-time quantum walks have been shown to implement quantum gates, including the …

    creighton Repository record for Implementing Quantum Gates With Length-3 Dynamic Graphs (opens in a new tab)

  2. Some Upper and Lower Bounds regarding Query Complexity

    … It plays an important role in demonstrating the quantum advantage, that quantum computing is faster than classical computation in solving some problems. Kempe showed that a discrete time quantum walk on hypercube hits the antipodal point with exponentially fewer queries than a simple random walk …

    waterloo Repository record for Some Upper and Lower Bounds regarding Query Complexity (opens in a new tab)

  3. Quantum stochastic walks : a model for coherent and incoherent transport on networks

    … processes on networks that combines both the continuous-time random walk (CTRW) and the continuous-time quantum walk (CTQW) as limiting cases. This model is known as the quantum stochastic walk (QSW), but has received little attention up till now. It is based on the Lindblad master equation …

    freiburg-diss Repository record for Quantum stochastic walks : a model for coherent and incoherent transport on networks (opens in a new tab)

  4. Quantum Walks: Theory, Application, And Implementation

    The quantum walk is a method for conceptualizing and designing quantum computing algorithms and it comes in two forms: the continuous-time and discrete-time quantum walk. The thesis is organized into three parts, each of which looks to develop the concept and uses of the quantum walk. The first part …

    nodak Repository record for Quantum Walks: Theory, Application, And Implementation (opens in a new tab)

  5. General methods and properties for evaluation of continuum limits of discrete time quantum walks in one and two dimensions

    Models of quantum walks which admit continuous time and continuous spacetime limits have recently led to quantum simulation schemes for simulating fermions in relativistic and non relativistic regimes (Di Molfetta and Arrighi, 2020). This work continues the study of relationships between discrete …

    bu Repository record for General methods and properties for evaluation of continuum limits of discrete time quantum walks in one and two dimensions (opens in a new tab)

  6. Quantum Snake Walk on Graphs

    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 walk, the basis states of which are fixed-length paths (snakes) in the …

    waterloo Repository record for Quantum Snake Walk on Graphs (opens in a new tab)

  7. Algebraic Aspects of Multi-Particle Quantum Walks

    A continuous time quantum walk consists of a particle moving among the vertices of a graph G. Its movement is governed by the structure of the graph. More formally, the adjacency matrix A is the Hamiltonian that determines the movement of our particle. Quantum walks have found a number of …

    waterloo Repository record for Algebraic Aspects of Multi-Particle Quantum Walks (opens in a new tab)

  8. Quantum State Transfer in Graphs

    … 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 walk in X. We say that X admits perfect state transfer from a vertex u to a vertex v if there is a time t such that | exp(i t A)_(u,v) | = 1. The main …

    waterloo Repository record for Quantum State Transfer in Graphs (opens in a new tab)

  9. Quantum Walks and Pretty Good State transfer on Paths

    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 construct a quantum computer is the transmission of information from one part …

    waterloo Repository record for Quantum Walks and Pretty Good State transfer on Paths (opens in a new tab)

  10. Understanding classical and quantum information at large scales

    … theories, and applications of classical and quantum information in various large-scale systems. The dissertation is structured in two parts: The first half is concerned with classical systems: First, we study a basic-yet-never-fully-appreciated property of many real-world complex …

    bu Repository record for Understanding classical and quantum information at large scales (opens in a new tab)