Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity
- 1 March 2001
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 62 (2) , 376-391
- https://doi.org/10.1006/jcss.2000.1732
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Symmetric space-bounded computationPublished by Elsevier ,2002
- Quantum circuits with mixed statesPublished by Association for Computing Machinery (ACM) ,1998
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Quantum Complexity TheorySIAM Journal on Computing, 1997
- Quantum ComputationPublished by Springer Nature ,1997
- A fast quantum mechanical algorithm for database searchPublished by Association for Computing Machinery (ACM) ,1996
- Mixing of random walks and other diffusions on a graphPublished by Cambridge University Press (CUP) ,1995
- Symmetric Logspace is Closed Under ComplementBRICS Report Series, 1994
- The thermodynamics of computation—a reviewInternational Journal of Theoretical Physics, 1982
- Irreversibility and Heat Generation in the Computing ProcessIBM Journal of Research and Development, 1961