scientific article
From MaRDI portal
Publication:3549657
zbMath1232.68053MaRDI QIDQ3549657
Miklos Santha, Ashwin Nayak, Frédéric Magniez, Jérémie Roland
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markov chainquantum walkquantum search algorithmsquantum phase estimationapproximate reflection operatormarked elements
Quantum computation (81P68) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (25)
Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence ⋮ Landau levels for discrete-time quantum walks in artificial magnetic fields ⋮ Generator of an abstract quantum walk ⋮ Discrete-time quantum walks in random artificial gauge fields ⋮ A note on the search for \(k\) elements via quantum walk ⋮ Localization for a one-dimensional split-step quantum walk with bound states robust against perturbations ⋮ A remark on zeta functions of finite graphs via quantum walks ⋮ Supersymmetry for chiral symmetric quantum walks ⋮ The Witten index for 1D supersymmetric quantum walks with anisotropic coins ⋮ Quantum Walk Based Search Algorithms ⋮ The Quantum Complexity of Markov Chain Monte Carlo ⋮ On the relationship between continuous- and discrete-time quantum walk ⋮ On the equivalence between quantum and random walks on finite graphs ⋮ On the hitting times of quantum versus random walks ⋮ Quantum speed-up for unsupervised learning ⋮ Localization of a multi-dimensional quantum walk with one defect ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Practical Implementation of a Quantum Backtracking Algorithm ⋮ Periodicity of the Discrete-time Quantum Walk on a Finite Graph ⋮ Quantum walks: a comprehensive review ⋮ Quantum walks in artificial electric and gravitational fields ⋮ Quantum Random Walks – New Method for Designing Quantum Algorithms ⋮ Quantum Property Testing for Bounded-Degree Graphs ⋮ Claw finding algorithms using quantum walk ⋮ Quantum walks can find a marked element on any graph
This page was built for publication:
