Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Browse subjects
  3. Statistics and Probability
  4. Probability theory and stochastic processes
  5. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

3002 results in Probability theory and stochastic processes

Page 8 of 151

  • 4 - Averaging

  • Chris Godsil, University of Waterloo, Ontario, Hanmeng Zhan, Simon Fraser University, British Columbia
  • Book:
    Discrete Quantum Walks on Graphs and Digraphs
    Published online:
    23 December 2022
    Print publication:
    12 January 2023, pp 41-58

  • Summary

    The axioms of quantum physics imply that in general it makes no sense to speak of the long-term behaviour of a quantum walk. In this chapter we introduce a process that allows us to develop a meaningful substitute for a simple average.

  • 5 - Covers and Embeddings

  • Chris Godsil, University of Waterloo, Ontario, Hanmeng Zhan, Simon Fraser University, British Columbia
  • Book:
    Discrete Quantum Walks on Graphs and Digraphs
    Published online:
    23 December 2022
    Print publication:
    12 January 2023, pp 59-76

  • Summary

    To specify a discrete quantum walk on a graph, we need more than just the graph. In general we need some kind of ordering on the edges on each vertex, and this extra structure is closely related to machinery used to describe embeddings of graph in surfaces. in this chapter we explain this connection.

  • 7 - Shunts

  • Chris Godsil, University of Waterloo, Ontario, Hanmeng Zhan, Simon Fraser University, British Columbia
  • Book:
    Discrete Quantum Walks on Graphs and Digraphs
    Published online:
    23 December 2022
    Print publication:
    12 January 2023, pp 98-120

  • Summary

    Aharonov et al. introduced class of quantum walks where the transition matrix is not (in general) a product of two reflections. (We call these shunt-decomposition walks.) In consequence, analysis of these walks is more difficult than the walks met with in earlier chapters. However the state space of walks is still the space of complex functions on the arcs of a graph. We give a description of these walks in graph theoretic terms, and study their behaviour.

  • 1 - Grover Search

  • Chris Godsil, University of Waterloo, Ontario, Hanmeng Zhan, Simon Fraser University, British Columbia
  • Book:
    Discrete Quantum Walks on Graphs and Digraphs
    Published online:
    23 December 2022
    Print publication:
    12 January 2023, pp 1-10
    • Chapter
      • You have access
    • PDF
    • Export citation

  • Summary

    1. Grover Search: We introduce the basics of discrete quantum walks, describing some of the underlying physics. One of the most important algorithms in quantum computing is Grover’s search algorithm, we show how one can implement this algorithm using a discrete walk on the arcs of a graph.

  • 2 - Two Reflections

  • Chris Godsil, University of Waterloo, Ontario, Hanmeng Zhan, Simon Fraser University, British Columbia
  • Book:
    Discrete Quantum Walks on Graphs and Digraphs
    Published online:
    23 December 2022
    Print publication:
    12 January 2023, pp 11-19

  • Summary

    To analyse a discrete walk we need to compute the eigenvalues and eigenvectors of unitary matrix. The matrices that arise in practice are products of two reflections. We develop machinery that takes advantage of this structure to complete the specrtal information we need.

Discrete Quantum Walks on Graphs and Digraphs
  • Chris Godsil, Hanmeng Zhan
  • Published online:
    23 December 2022
    Print publication:
    12 January 2023
  • Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.

  • 1 - Introduction

  • Alejandro D. de Acosta, Case Western Reserve University, Ohio
  • Book:
    Large Deviations for Markov Chains
    Published online:
    03 August 2022
    Print publication:
    27 October 2022, pp 1-13
    • Chapter
      • You have access
    • PDF
    • Export citation

  • Summary

    We present the outlook and some of the main contents of the book, including some basic definitions.

Page 8 of 151