Pages that link to "Item:Q2429358"
From MaRDI portal
The following pages link to On the hitting times of quantum versus random walks (Q2429358):
Displaying 32 items.
- Quantum walks can find a marked element on any graph (Q262276) (← links)
- Dynamical localization of quantum walks in random environments (Q643714) (← links)
- Random time-dependent quantum walks (Q644753) (← links)
- Exceptional quantum walk search on the cycle (Q1679371) (← links)
- Localization of a multi-dimensional quantum walk with one defect (Q1700014) (← links)
- Equivalence of Szegedy's and coined quantum walks (Q1700352) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Faster search by lackadaisical quantum walk (Q1746914) (← links)
- Quantum walks: a comprehensive review (Q1757875) (← links)
- Spatial search using the discrete time quantum walk (Q1761706) (← links)
- Hitting time of quantum walks with perturbation (Q1937291) (← links)
- On the probability of finding marked connected components using quantum walks (Q1992115) (← links)
- Hitting times of quantum and classical random walks in potential spaces (Q2088229) (← links)
- Efficient quantum circuits for Szegedy quantum walks (Q2362658) (← links)
- Passage times, exit times and Dirichlet problems for open quantum walks (Q2409994) (← links)
- Evolutionary algorithms for quantum computers (Q2441596) (← links)
- Decoherence in quantum Markov chains (Q2454219) (← links)
- Discrete quantum walks hit exponentially faster (Q2571012) (← links)
- Quantum walk and its application domains: a systematic review (Q2668386) (← links)
- Supersymmetry for chiral symmetric quantum walks (Q2677513) (← links)
- The Witten index for 1D supersymmetric quantum walks with anisotropic coins (Q2677534) (← links)
- Quantum renewal equation for the first detection time of a quantum walk (Q2965816) (← links)
- QUANTUM HITTING TIME ON THE COMPLETE GRAPH (Q3057851) (← links)
- Localization for a one-dimensional split-step quantum walk with bound states robust against perturbations (Q4586495) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- Efficient quantum walk on the grid with multiple marked elements (Q4636641) (← links)
- Periodicity of the Discrete-time Quantum Walk on a Finite Graph (Q5147817) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900946) (← links)
- Improvement of quantum walks search algorithm in single-marked vertex graph (Q6096899) (← links)
- Controlling the spread of infectious diseases by using random walk method to remove many important links (Q6144148) (← links)
- Evaluating the convergence of tabu enhanced hybrid quantum optimization (Q6159265) (← links)
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants (Q6637328) (← links)