An example of the difference between quantum and classical random walks
From MaRDI portal
Abstract: In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case.
Recommendations
Cited in
(90)- Graph matching using the interference of continuous-time quantum walks
- Continuous-time quantum walks on star graphs
- Quantum decomposition of random walk on Cayley graph of finite group
- Improving quantum state transfer efficiency and entanglement distribution in binary tree spin network through incomplete collapsing measurements
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- The excitonic qubit coupled with a phonon bath on a star graph: anomalous decoherence and coherence revivals
- Localization of a multi-dimensional quantum walk with one defect
- A graph with fractional revival
- Quantum algorithm design: techniques and applications
- Qswalk: a \textit {Mathematica} package for quantum stochastic walks on arbitrary graphs
- Two quantum coins sharing a walker
- Quantum walks: a comprehensive review
- One-dimensional quantum walks with absorbing boundaries
- Construction of distinct discrete time scattering quantum walk formulations on the honeycomb lattice
- The excitonic qubit on a star graph: dephasing-limited coherent motion
- Quantum walk with a general coin: exact solution and asymptotic properties
- Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices
- The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
- Fast quantum search of multiple vertices based on electric circuits
- Periodicity of lively quantum walks on cycles with generalized Grover coin
- Analysis and applications of quantum walks
- Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation
- Coined quantum walks lift the cospectrality of graphs and trees
- One-dimensional continuous-time quantum walks
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- Quantum random walk polynomial and quantum random walk measure
- Entangled Markov chains
- Discrete quantum walks hit exponentially faster
- Quantum walk and its application domains: a systematic review
- Quantum walks of three interacting bosons on one-dimensional optical lattices
- Entanglement transfer via chiral and continuous-time quantum walks on a triangular chain
- Why and how to add direction to a quantum walk
- Quantum extensive-form games
- General condition of quantum teleportation by one-dimensional quantum walks
- Transport properties in directed quantum walks on the line
- Generator of an abstract quantum walk
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Symmetry and quantum transport on networks
- On the von Neumann entropy of certain quantum walks subject to decoherence
- Quantum walk on a toral phase space
- Spin chains, graphs and state revival
- One-dimensional three-state quantum walk with single-point phase defects
- CONTINUOUS-TIME QUANTUM WALKS ON ULTRAMETRIC SPACES
- Infinite dimensional entangled Markov chains
- The Quantum Complexity of Markov Chain Monte Carlo
- INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM
- Relativistic effects and rigorous limits for discrete- and continuous-time quantum walks
- Quantum tunneling on graphs
- On the efficiency of quantum algorithms for Hamiltonian simulation
- Open quantum random walks
- Dephasing assisted transport on a biomimetic ring structure
- Limiting properties of stochastic quantum walks on directed graphs
- A study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D lattice
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Quantum walk on a comb with infinite teeth
- Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
- A Markov-Dobrushin inequality for quantum channels
- Universally optimal noisy quantum walks on complex networks
- Green's function approach for quantum graphs: an overview
- Quantum Walks
- Birth and death processes and quantum spin chains
- When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)?
- Quantum walks, Ihara zeta functions and cospectrality in regular graphs
- CONTINUOUS-TIME QUANTUM WALKS ON TREES IN QUANTUM PROBABILITY THEORY
- QUANTUM MAPS WITH SPACE EXTENT: A PARADIGM FOR LATTICE QUANTUM WALKS
- ENTANGLED MARKOV CHAINS ARE INDEED ENTANGLED
- The continuous-time quantum walk on some graphs based on the view of quantum probability
- Limit distribution of a continuous-time quantum walk with a spatially 2-periodic Hamiltonian
- Quantum walk mixing is faster than classical on periodic lattices
- A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks
- Ranking nodes in directed networks via continuous-time quantum walks
- Swift chiral quantum walks
- Discrete-time quantum walks on one-dimensional lattices
- On the relationship between continuous- and discrete-time quantum walk
- On limiting distributions of quantum Markov chains
- Tree search and quantum computation
- Recovering the original simplicity: succinct and exact quantum algorithm for the welded tree problem
- A q-version of the relation between the hypercube, the Krawtchouk chain and Dicke states
- Experimental observations of 1D quantum walks in a limited region
- 2-adic quantum mechanics, continuous-time quantum walks, and the space discreteness
- Controlled quantum communication using quantum walk
- Scoring anomalous vertices through quantum walks
- Quantum vs classical birth and death processes; exactly solvable examples
- Quantum mechanics, non-locality, and the space discreteness hypothesis
- Response to glassy disorder in coin on spread of quantum walker
- An edge labeling of graphs from Rado's partition regularity condition
- Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
This page was built for publication: An example of the difference between quantum and classical random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573073)
