The following pages link to (Q2921783):
Displaying 13 items.
- On the relationship between continuous- and discrete-time quantum walk (Q625458) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- The quantum query complexity of the determinant (Q976107) (← links)
- A note on the search for \(k\) elements via quantum walk (Q1675772) (← links)
- Quantum walks with memory on cycles (Q1782644) (← links)
- Line ordering of reversible circuits for linear nearest neighbor realization (Q2443892) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- Search on vertex-transitive graphs by lackadaisical quantum walk (Q2681709) (← links)
- The quantum walk search algorithm: factors affecting efficiency (Q4623131) (← links)
- Quantum mixing of Markov chains for special distributions (Q5144028) (← links)
- Quantum Walks (Q5302305) (← links)
- Quantum walk mixing is faster than classical on periodic lattices (Q6085295) (← links)
