Analysis of absorbing times of quantum walks
- 2 July 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 68 (1) , 012302
Abstract
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and symmetric walks on the hypercube from the viewpoint of absorbing probability and time.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- An Example of the Difference Between Quantum and Classical Random WalksQuantum Information Processing, 2002
- Quantum Simulations of Classical Random Walks and Undirected Graph ConnectivityJournal of Computer and System Sciences, 2001
- Quantum computation and decision treesPhysical Review A, 1998
- From quantum cellular automata to quantum lattice gasesJournal of Statistical Physics, 1996
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Approximating the PermanentSIAM Journal on Computing, 1989