Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous  Home/Search
Context Related
| wisc.edu/areas/theory...quantumwalks.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisc.edu/areas/theory/Seminar (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze a quantum analog of the symmetric random walk, which we call the Hadamard walk. Several striking differences between the quantum and classical cases are observed. For example, when unrestricted in either direction, the Hadamard walk has position that is nearly uniformly distributed in the range [-t/x/,t/x/] after t steps, which is in sharp contrast to the classical random... (Update)
Similar documents based on text: More All
3.1: One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (Correct)
1.0: Quantum Random Walks and the Analysis of Discrete Quantum.. - Ambainis, Bach, Watrous (2000) (Correct)
0.7: Quantum Walk on the Line (Extended Abstract) - Nayak, al. (Correct)
BibTeX entry: (Update)
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, and John Watrous. Onedimensional quantum walks. In ACM [ACM01]. http://citeseer.ist.psu.edu/514019.html More
@inproceedings{ ambainis01onedimensional,
author = "Andris Ambainis and Eric Bach and Ashwin Nayak and Ashvin Vishwanath and John Watrous",
title = "One-dimensional quantum walks",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "37-49",
year = "2001",
url = "citeseer.ist.psu.edu/514019.html" }
Citations (may not include all citations):1120 Handbook of Mathematical Functions (context) - Abramowitz, Stegun - 1965
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
442 Concrete Mathematics (context) - Graham, Knuth et al. - 1994
276 Finite Markov Chains (context) - Kemeny, Snell - 1983
248 Oxford University Press (context) - Titchmaxsh, of - 1979
210 A fast quantum mechanical algorithm for database seaxch - Grover - 1996
142 Advanced Mathematical Methods for Scientists and Engineers (context) - Bender, Orszag - 1978
115 Approximating the permanent (context) - Jetrum, Sinclair - 1989
98 A random polynomial-time algorithm for approximating the vol.. - Dyer, Frieze et al. - 1991
64 Decision procedure for indefinite hypergeometric summation (context) - Gosper - 1978
61 Quantum Mechanics and Path Integrals (context) - Feynman, Hibbs - 1965
59 On selecting a satisfying truth assignment (context) - Papadimitriou - 1991
55 Asymptotic Expansions of Integrals (context) - Bleistein, Handelsman - 1975
29 A polynomial-time approximation algorithm for the permanent .. - Jetrum, Sinclair et al. - 2001
17 Probabilistic Analysis of Packing and Partitioning Algorithm.. (context) - Coffman, Lueker - 1991
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.wisc.edu/areas/theory/Seminar): More
On the Quantum Black-Box Complexity of Majority - Hayes, Kutin, van Melkebeek (Correct)
The Problem of Context Sensitive String Matching - Chakaravarthy, Krishnamurthy (Correct)
Time-Space Lower Bounds for Satisfiability - van Melkebeek (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC