A random walk approach to quantum algorithms
From MaRDI portal
Publication:5301913
Abstract: The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e., when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk, due to interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point on average than a classical walker, and this forms the basis of a quantum speed up that can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, with even a small quantum computer available, development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.
Recommendations
Cites work
Cited in
(38)- Quantum Markov chains
- Faster search of clustered marked states with lackadaisical quantum walks
- Some limit laws for quantum walks with applications to a version of the Parrondo paradox
- Complex quantum networks: a topical review
- Quantum Walks
- Quantum walk and its application domains: a systematic review
- Quantum walks in an array of quantum dots
- Transition effect matrices and quantum Markov chains
- Quantum walks and search algorithms
- Quantum walk, entanglement and thermodynamic laws
- Quantum computation: algorithms and applications
- Understanding and controlling \(N\)-dimensional quantum walks via dispersion relations: application to the two-dimensional and three-dimensional Grover walks -- diabolical points and more
- Two-particle coined-quantum walk with long-range interaction
- Quantum Random Walks – New Method for Designing Quantum Algorithms
- A study and analysis of a discrete quantum walk-based hybrid clustering approach using \(d\)-regular bipartite graph and 1D lattice
- Decoherence in quantum walks – a review
- Quantum walks: a comprehensive review
- The energy cost of quantum information losses
- The Walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks
- Anyonic quantum walks
- Discrete-time quantum walk algorithm for ranking nodes on a network
- Gate imperfection in the quantum random-walk search algorithm
- Applied quantum physics for novel quantum computation approaches: an update
- Quantum algorithm for smoothed particle hydrodynamics
- Directional correlations in quantum walks with two particles
- scientific article; zbMATH DE number 7453153 (Why is no real title available?)
- Optimizing the walk coin in the quantum random walk search algorithm
- Experimental quantum state transfer of an arbitrary single-qubit state on a cycle with four vertices using a coined quantum random walk
- Quantum stochastic walk models for quantum state discrimination
- A generalization of Schur functions: applications to Nevanlinna functions, orthogonal polynomials, random walks and unitary and open quantum walks
- Spectral quantization of discrete random walks on half-line and orthogonal polynomials on the unit circle
- A quantum dynamical approach to matrix Khrushchev's formulas
- Quantum walks for the determination of commutativity of finite dimensional algebras
- Unitary coined discrete-time quantum walks on directed multigraphs
- Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
- Green's function approach for quantum graphs: an overview
- High-dimensional graphs convolution for quantum walks photonic applications
- A novel algorithm of quantum random walk in server traffic control and task scheduling
This page was built for publication: A random walk approach to quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301913)
