scientific article; zbMATH DE number 5485493

<a class="pub-badge pub-badge--grey" href="https://zbmath.org/1232.68053" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q3549657" rel="nofollow">MaRDI QID Q3549657</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q3549657" rel="nofollow">FDO</a>

Authors Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha

Publication date 5 January 2009

zbMATH Keywords

Markov chainquantum walkquantum search algorithmsquantum phase estimationapproximate reflection operatormarked elements

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cited in

(29)

• Claw finding algorithms using quantum walk
• Discrete-time quantum walks in random artificial gauge fields
• Spectral quantization of discrete random walks on half-line and orthogonal polynomials on the unit circle
• On the relationship between continuous- and discrete-time quantum walk
• On the hitting times of quantum versus random walks
• Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence
• Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
• Quantum property testing for bounded-degree graphs
• The hitting time of quantum walk on 2D lattice
• Quantum Random Walks – New Method for Designing Quantum Algorithms
• Quantum walks in artificial electric and gravitational fields
• Localization of a multi-dimensional quantum walk with one defect
• Supersymmetry for chiral symmetric quantum walks
• The Witten index for 1D supersymmetric quantum walks with anisotropic coins
• The quantum walk search algorithm: factors affecting efficiency
• Landau levels for discrete-time quantum walks in artificial magnetic fields
• Quantum speed-up for unsupervised learning
• Practical Implementation of a Quantum Backtracking Algorithm
• Quantum Walk Based Search Algorithms
• A note on the search for \(k\) elements via quantum walk
• A remark on zeta functions of finite graphs via quantum walks
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• Periodicity of the discrete-time quantum walk on a finite graph
• On the equivalence between quantum and random walks on finite graphs
• Quantum walks: a comprehensive review
• Quantum walks can find a marked element on any graph
• The Quantum Complexity of Markov Chain Monte Carlo
• Localization for a one-dimensional split-step quantum walk with bound states robust against perturbations
• Generator of an abstract quantum walk

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549657)