Connecting the discrete- and continuous-time quantum walks

By Frederick W. Strauch. 2006

164 citations recorded by the source corpus.

Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time quantum walk. Though the properties of these two walks have shown similarities, it has remained an open problem to find the exact relation between the two. The precise connection of these two processes, both quantally and classically, is presented. Extension to higher dimensions is also discussed.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/e398a2d47d18096dbb0b16c14d44492bfa9f9817

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Salvador Elías Venegas-Andraca
  2. Andrew M. Childs
  3. Nathan Wiebe
  4. Guang Hao Low
  5. Isaac L. Chuang
  6. Robin Kothari
  7. Andris Ambainis
  8. Dominic W. Berry

In Computational Theory and Mathematics

  1. Salvador Elías Venegas-Andraca
  2. Andrew M. Childs
  3. Guang Hao Low
  4. Andris Ambainis
  5. Nathan Wiebe
  6. Robin Kothari
  7. Isaac L. Chuang
  8. Yazhen Wang

Citations in the corpus