scientific article; zbMATH DE number 5485493
From MaRDI portal
Publication:3549657
zbMATH Open1232.68053MaRDI QIDQ3549657FDOQ3549657
Authors: Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha 
Publication date: 5 January 2009
Title of this publication is not available (Why is that?)
Markov chainquantum walkquantum search algorithmsquantum phase estimationapproximate reflection operatormarked elements
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)
- Quantum walks can find a marked element on any graph
- On the relationship between continuous- and discrete-time quantum walk
- Supersymmetry for chiral symmetric quantum walks
- The Witten index for 1D supersymmetric quantum walks with anisotropic coins
- Periodicity of the Discrete-time Quantum Walk on a Finite Graph
- A remark on zeta functions of finite graphs via quantum walks
- Practical Implementation of a Quantum Backtracking Algorithm
- Quantum Random Walks – New Method for Designing Quantum Algorithms
- Generator of an abstract quantum walk
- On the equivalence between quantum and random walks on finite graphs
- Quantum walks: a comprehensive review
- The Quantum Complexity of Markov Chain Monte Carlo
- Localization of a multi-dimensional quantum walk with one defect
- Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence
- On the hitting times of quantum versus random walks
- The quantum walk search algorithm: factors affecting efficiency
- Claw finding algorithms using quantum walk
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
- A note on the search for \(k\) elements via quantum walk
- Discrete-time quantum walks in random artificial gauge fields
- The hitting time of quantum walk on 2D lattice
- Spectral quantization of discrete random walks on half-line and orthogonal polynomials on the unit circle
- Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
- Quantum Walk Based Search Algorithms
- Quantum walks in artificial electric and gravitational fields
- Quantum property testing for bounded-degree graphs
- Landau levels for discrete-time quantum walks in artificial magnetic fields
- Quantum speed-up for unsupervised learning
- Localization for a one-dimensional split-step quantum walk with bound states robust against perturbations
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)
