Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity

@article{Watrous2001QuantumSO,
  title={Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity},
  author={J. Watrous},
  journal={J. Comput. Syst. Sci.},
  year={2001},
  volume={62},
  pages={376-391}
}
  • J. Watrous
  • Published 2001
  • Computer Science, Physics, Mathematics
  • J. Comput. Syst. Sci.
There are a number of questions in quantum complexity that have been resolved in the time-bounded setting, but remain open in the space-bounded setting. For example, it is not currently known if space-bounded probabilistic computations can be simulated by space-bounded quantum machines without allowing measurements during the computation, while it is known that an analogous statement holds in the time-bounded case. A more general question asks if measurements during a quantum computation can… Expand
Quantum Walks on the Hypercube
A unified framework for quantum random walk algorithms on general graphs
Application of quantum walks on graph structures to quantum computing
Discrete Quantum Walks on Graphs and Digraphs
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Space-bounded quantum computation
Space-Bounded Quantum Complexity
  • J. Watrous
  • Computer Science
  • J. Comput. Syst. Sci.
  • 1999
Quantum complexity theory
Random walks, universal traversal sequences, and the complexity of maze problems
Quantum circuits with mixed states
A fast quantum mechanical algorithm for database search
Strengths and Weaknesses of Quantum Computing
...
1
2
3
...