The average search probabilities of discrete-time quantum walks
From MaRDI portal
Publication:2104770
DOI10.1007/S11128-022-03681-9OpenAlexW3196006293MaRDI QIDQ2104770FDOQ2104770
Authors: Hanmeng Zhan 
Publication date: 7 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.09818
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
Association schemes, strongly regular graphs (05E30) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete-time quantum walks and graph structures
- Title not available (Why is that?)
- Quantum walks on graphs
- Distance-regular graphs
- A characterization of classical and semiclassical orthogonal polynomials from their dual polynomials
- The vertex-connectivity of a distance-regular graph
- Spatial search on Johnson graphs by continuous-time quantum walk
- Quantum walk search on Johnson graphs
- Discrete-time quantum walk search on Johnson graphs
- A new perspective on the average mixing matrix
- 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)
