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)
Context of citations to this paper: More
...process from a quantum one by performing a measurement at a given time or a distribution of times. Several recent articles [AAKV01, ABN 01, NV00] have answered this question in the affirmative, showing, for example, that a quantum walk on the n cycle mixes in time...
Cited by: More
Exponential Algorithmic Speedup by a Quantum Walk - Andrew Childs Richard (Correct)
Quantum Computing Classical Physics - Meyer (2001) (Correct)
Quantum Walks on the Hypercube - Moore, Russell (2002) (Correct)
Similar documents (at the sentence level):
43.4%: One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (Correct)
6.1%: Quantum Random Walks and the Analysis of Discrete Quantum.. - Ambainis, Bach, Watrous (2000) (Correct)
Active bibliography (related documents): More All
0.3: Parrondo Games As Lattice Gas Automata - Meyer, Blumer (2001) (Correct)
0.3: Quantum Walk on the Line (Extended Abstract) - Nayak, al. (Correct)
0.2: Spectral Bounds on General Hard Core Predicates (Extended.. - Goldmann, Russell (Correct)
Similar documents based on text: More All
0.3: Quantum Walks On Graphs - Aharonov, Ambainis, Kempe, Vazirani (2000) (Correct)
0.2: Random Walks On Boundary For Solving Pdes - Sabelfeld, Simonov (1994) (Correct)
0.2: Dense Quantum Coding and a Lower Bound for 1-way.. - Ambainis, Nayak.. (1999) (Correct)
Related documents from co-citation: More All
4: Quantum computation and decision trees (context) - Farhi, Gutmann - 1998
4: Quantum walks on graphs - Aharonov, Ambainis et al. - 2001
3: Algorithms for quantum computation: Discrete logarithms and factoring - Shor - 1994
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
11 Faster mixing via average conductance - Lov, Kannan - 1999
9 On asymptotics of Jacobi polynomials (context) - Chen, Ismall - 1991
9 volume 11 of Lecture Notes-Monograph Series (context) - Diaconis, in et al. - 1988
7 Quantum walks on graphs - Aharonov, Ambainis et al. - 2001
7 Modern Nonlinear Equations (context) - Saaty - 1981
7 Quantum simulations of classical random walks and undirected.. - Watrous - 2001
7 Quantum computation and decision trees (context) - Faxhi, Gutmann - 1998
5 and the time complexity of maze problems (context) - Aleliunas, Karp et al. - 1979
4 volume 14 of Probability and Mathematical Statistics (context) - Dym, McKean et al. - 1972
4 Quantum walk on the line (context) - Nayak, Vishwanath
2 Lo Alamo Preprint Archive may be found URL httparXv (context) - method, telescoping et al. - 1991
2 An example of the difference between quantum and classical r.. (context) - Childs, Faxhi et al.
1 The Maxkov chain Monte Caxlo method: An approach to approxim.. (context) - Jetrum, Sinclair - 1996
1 The brownian motion: a neglected tool for the complexity ana.. (context) - Louchaxd - 1983
1 Orthogonal Polynomials (context) - SzegS - 1975
1 From quantum cellulax automata to quantum lattice gases (context) - Meyer - 1996
1 A probabilistic analysis of multidimensional bin packing pro.. (context) - Kaxp, Luby et al. - 1984
1 SAT and constraint satisfaction problems (context) - SchSning, algorithm et al. - 1999
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