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 20 of 70 for “"quantum walks"”.

  1. Quantum Walks on Oriented Graphs

    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 integer ∆. We find an infinite family of orientations of the complete graph that are …

    waterloo Repository record for Quantum Walks on Oriented Graphs (opens in a new tab)

  2. Sampling Using Controlled Quantum Walks

    We give a new quantum algorithm to sample from probability distributions over graph vertices quadratically faster than the optimal classical algorithm, which uses random walks with stopping rules. Efficient sampling is an important computational task used in simulations based on stochastic …

    calgary Repository record for Sampling Using Controlled Quantum Walks (opens in a new tab)

  3. Quantum walks and quantum computation

    The field of quantum information applies the concepts of quantum physics to problems in computer science, and shows great potential for allowing efficient computation. In this thesis I concentrate on a particular quantum information theoretic tool known as the quantum walk. There are two widely …

    whiterose Download PDF for Quantum walks and quantum computation (opens in a new tab)

  4. Absorption phenomena in quantum walks

    The quantum walk is a unitary analogue to the discrete random walk, and its properties have been increasingly studied since the turn of the millennium. In comparison with the classical random walk, the quantum walk exhibits linear spreading and initial condition dependent asymmetries. As noted …

    bu Repository record for Absorption phenomena in quantum walks (opens in a new tab)

  5. Quantum Walks on Strongly Regular Graphs

    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 quantum walk, distinguishes strongly regular graphs. We begin by finding the …

    waterloo Repository record for Quantum Walks on Strongly Regular Graphs (opens in a new tab)

  6. Bipartite Quantum Walks and the Hamiltonian

    We study a discrete quantum walk model called bipartite walks via a spectral approach. A bipartite walk is determined by a unitary matrix U, i.e., the transition matrix of the walk. For every transition matrix U, there is a Hamiltonian H such that U = exp(iH). If there is a real skew-symmetric …

    waterloo Repository record for Bipartite Quantum Walks and the Hamiltonian (opens in a new tab)

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

  8. Simple Stationary Steps in Quantum Walks

    … of type An−1 is given as a sum over a set of quantum walks in the quantum Bruhat graph, QBG(An−1). We establish bounds on the number of quantum steps and simple stationary steps in these quantum walks. By a result of Kato, we map this formula to the equivariant quantum K-theory of partial flag …

    vt Repository record for Simple Stationary Steps in Quantum Walks (opens in a new tab)

  9. Discrete Quantum Walks on Graphs and Digraphs

    This thesis studies various models of discrete quantum walks on graphs and digraphs via a spectral approach. A discrete quantum walk on a digraph $X$ is determined by a unitary matrix $U$, which acts on complex functions of the arcs of $X$. Generally speaking, $U$ is a product of two sparse unitary …

    waterloo Repository record for Discrete Quantum Walks on Graphs and Digraphs (opens in a new tab)

  10. Efficient Composition of Discrete Time Quantum Walks

    … 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 search algorithms generally incurs an extra logarithmic factor in query and time complexity, due to the …

    waterloo Repository record for Efficient Composition of Discrete Time Quantum Walks (opens in a new tab)

  11. 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)

  12. Discrete quantum walks and quantum image processing

    … thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image Processing. Our work is a contribution within the field of quantum computation from the perspective of a computer scientist. With the purpose of finding new techniques to develop quantum algorithms, there has been an …

    oxford Repository record for Discrete quantum walks and quantum image processing (opens in a new tab)

  13. Efficient Framework for Quantum Walks and Beyond

    … The total query complexity is given by the quantum hitting time of the resulting operator, which we show that it is of the same order as the quantum hitting time of the original algorithm. As a major application of our framework, we show that for any reversible walk $P$ and a single marked …

    calgary Repository record for Efficient Framework for Quantum Walks and Beyond (opens in a new tab)

  14. Quantum Walks and Application to Quantum Money

    This thesis explores the foundations of quantum computation, focusing on quantum walks and their application to quantum money. Quantum walks, particularly continuous-time quantum walks based on group actions, serve as a powerful computational tool with applications in search algorithms and …

    mcmaster Repository record for Quantum Walks and Application to Quantum Money (opens in a new tab)

  15. Uniform Mixing of Quantum Walks and Association Schemes

    In recent years quantum algorithms have become a popular area of mathematical research. Farhi and Gutmann introduced the concept of a quantum walk in 1998. In this thesis we investigate mixing properties of continuous-time quantum walks from a mathematical perspective. We focus on the connections …

    waterloo Repository record for Uniform Mixing of Quantum Walks and Association Schemes (opens in a new tab)

  16. Parity-Time Symmetry in Non-Hermitian Quantum Walks

    … been developed and intensively investigated in quantum physics. The theory stipulates that a non-Hermitian Hamiltonian can also represents a physical system as long as its energy spectra can be purely real in certain regime depending on the parameters of the Hamiltonian. It was demonstrated that …

    iupui Repository record for Parity-Time Symmetry in Non-Hermitian Quantum Walks (opens in a new tab)

  17. 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)

  18. Quantum Walks on Arc-Transitive Graphs with Self-Loops

    The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. The lackadaisical quantum walk has been studied on cycles, n-dimensional tori, hypercubes, Johnson graphs, and other classes of vertex-transitive graphs. The …

    calgary Repository record for Quantum Walks on Arc-Transitive Graphs with Self-Loops (opens in a new tab)

  19. Quantum Walks and Structured Searches on Free Groups and Networks

    Quantum walks have been utilized by many quantum algorithms which provide improved performance over their classical counterparts. Quantum search algorithms, the quantum analogues of spatial search algorithms, have been studied on a wide variety of structures. We study quantum walks and searches on …

    temple Repository record for Quantum Walks and Structured Searches on Free Groups and Networks (opens in a new tab)

  20. Application of quantum walks on graph structures to quantum computing

    Quantum computation is a new computational paradigm which can provide fundamentally faster computation than in the classical regime. This is dependent on finding efficient quantum algorithms for problems of practical interest. One of the most successful tools in developing new quantum algorithms is …

    whiterose Download PDF for Application of quantum walks on graph structures to quantum computing (opens in a new tab)

Page 1 of 4