Discrete quantum walks hit exponentially faster
From MaRDI portal
Recommendations
Cited in
(34)- Graph matching using the interference of continuous-time quantum walks
- Analytical expression for variance of homogeneous-position quantum walk with decoherent position
- Concentric network symmetry
- Quantum walks: a comprehensive review
- Enhancing the spreading of quantum walks on star graphs by additional bonds
- Asymptotic distributions of quantum walks on the line with two entangled coins
- One-dimensional quantum walks with absorbing boundaries
- Hitting time of quantum walks with perturbation
- The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
- Coined quantum walks lift the cospectrality of graphs and trees
- One-dimensional continuous-time quantum walks
- On the hitting times of quantum versus random walks
- Discrete quantum walks hit exponentially faster
- Searching for antipodal vertices in a symmetric Cayley graph of the group of the Boolean cube
- Quantum Walk Based Search Algorithms
- Discrete-time interacting quantum walks and quantum hash schemes
- Differential topology of adiabatically controlled quantum processes
- Exponential algorithmic speedup by a quantum walk
- Maximal entanglement from quantum random walks
- Bose-Mesner algebra on finite \(G/H\) coset graphs and its application on continuous time quantum walks
- The quantum walk search algorithm: factors affecting efficiency
- On the hitting times of quantum versus random walks
- Quantum Walks
- The continuous-time quantum walk on some graphs based on the view of quantum probability
- Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
- Strong dispersion property for the quantum walk on the hypercube
- Quantum circuits for discrete-time quantum walks with position-dependent coin operator
- An investigation of continuous-time quantum walk on hypercube in view of Cartesian product structure
- Tree search and quantum computation
- Quantum hitting time according to a given distribution
- The QWalk simulator of quantum walks
- Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix
- Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
This page was built for publication: Discrete quantum walks hit exponentially faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900946)
