The average search probabilities of discrete-time quantum walks
From MaRDI portal
Publication:2104770
Recommendations
- Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices
- Szegedy's quantum walk with queries
- Quantum walks can find a marked element on any graph
- Upperbounds on the probability of finding marked connected components using quantum walks
- Quantum walks on regular graphs and eigenvalues
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- A characterization of classical and semiclassical orthogonal polynomials from their dual polynomials
- A new perspective on the average mixing matrix
- Discrete-time quantum walk search on Johnson graphs
- Discrete-time quantum walks and graph structures
- Distance-regular graphs
- Quantum walk search on Johnson graphs
- Quantum walks on graphs
- Spatial search on Johnson graphs by continuous-time quantum walk
- The vertex-connectivity of a distance-regular graph
- Unperturbed: spectral analysis beyond Davis-Kahan
Cited in
(2)
This page was built for publication: The average search probabilities of discrete-time quantum walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104770)