A random walk approach to quantum algorithms
From MaRDI portal
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
(39)- Quantum walk, entanglement and thermodynamic laws
- A generalization of Schur functions: applications to Nevanlinna functions, orthogonal polynomials, random walks and unitary and open quantum walks
- A novel algorithm of quantum random walk in server traffic control and task scheduling
- Quantum walks: a comprehensive review
- Applied quantum physics for novel quantum computation approaches: an update
- Some limit laws for quantum walks with applications to a version of the Parrondo paradox
- Faster search of clustered marked states with lackadaisical quantum walks
- The energy cost of quantum information losses
- Quantum stochastic walk models for quantum state discrimination
- Anyonic quantum walks
- Quantum walks for the determination of commutativity of finite dimensional algebras
- Quantum walk and its application domains: a systematic review
- Discrete-time quantum walk algorithm for ranking nodes on a network
- A quantum dynamical approach to matrix Khrushchev's formulas
- Two-particle coined-quantum walk with long-range interaction
- A study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D lattice
- scientific article; zbMATH DE number 7453153 (Why is no real title available?)
- The Walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks
- Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
- Directional correlations in quantum walks with two particles
- Understanding and controlling N-dimensional quantum walks via dispersion relations: application to the two-dimensional and three-dimensional Grover walks -- diabolical points and more
- Green's function approach for quantum graphs: an overview
- Quantum Walks
- Decoherence in quantum walks – a review
- Quantum walks in an array of quantum dots
- Quantum Random Walks – New Method for Designing Quantum Algorithms
- Gate imperfection in the quantum random-walk search algorithm
- Quantum Markov chains
- Quantum walks and search algorithms
- Quantum algorithm for smoothed particle hydrodynamics
- Experimental quantum state transfer of an arbitrary single-qubit state on a cycle with four vertices using a coined quantum random walk
- Optimizing the walk coin in the quantum random walk search algorithm
- Unitary coined discrete-time quantum walks on directed multigraphs
- Quantum computation: algorithms and applications
- High-dimensional graphs convolution for quantum walks photonic applications
- Complex quantum networks: a topical review
- Spectral quantization of discrete random walks on half-line and orthogonal polynomials on the unit circle
- Quantum walks and perfect state transfer on the corona graphs P_n C_m
- Transition effect matrices and quantum Markov chains
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)
