Expand description
Quantum Walk Algorithms
This module implements various quantum walk algorithms, including:
- Discrete-time quantum walks on graphs
- Continuous-time quantum walks
- Szegedy quantum walks
Quantum walks are the quantum analog of classical random walks and form the basis for many quantum algorithms.
Structs§
- Continuous
Quantum Walk - Continuous-time quantum walk
- Decoherent
Quantum Walk - Quantum walk with environmental decoherence
- Discrete
Quantum Walk - Discrete-time quantum walk
- Graph
- Graph representation for quantum walks
- Multi
Walker Quantum Walk - Multi-walker quantum walk for studying entanglement and correlations
- Quantum
Walk Search - Search algorithm using quantum walks
- Search
Oracle - Search oracle for quantum walk search
- Szegedy
Quantum Walk - Szegedy quantum walk for arbitrary graphs This provides better mixing properties on irregular graphs
Enums§
- Coin
Operator - Coin operators for discrete quantum walks
- Graph
Type - Types of graphs for quantum walks
Functions§
- quantum_
walk_ line_ example - Example: Quantum walk on a line
- quantum_
walk_ search_ example - Example: Search on a complete graph