Quantum walks on graphs
From MaRDI portal
Abstract: We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible. However, by suitably relaxing the definition, we can obtain a measure of how fast the quantum walk spreads or how confined the quantum walk stays in a small neighborhood. We give definitions of mixing time, filling time, dispersion time. We show that in all these measures, the quantum walk on the cycle is almost quadratically faster then its classical correspondent. On the other hand, we give a lower bound on the possible speed up by quantum walks for general graphs, showing that quantum walks can be at most polynomially faster than their classical counterparts.
Recommendations
- QUANTUM WALKS ON GENERAL GRAPHS
- Quantum walks on directed graphs
- Quantum walks on hypergraphs
- Discrete quantum walks on graphs and digraphs
- Quantum walks on Cayley graphs
- Quantum graph walks. I: Mapping to quantum walks
- Discrete-time quantum walks and graph structures
- scientific article; zbMATH DE number 2222671
- Quantum walks and the size of the graph
- Quantum walks on regular graphs and eigenvalues
Cites work
Cited in
(only showing first 100 items - show all)- Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory
- Graph matching using the interference of continuous-time quantum walks
- History dependent quantum walk on the cycle with an unbalanced coin
- A spectral analysis of discrete-time quantum walks related to the birth and death chains
- Strong convergence of quantum random walks via semigroup decomposition
- Partition-based discrete-time quantum walks
- A note on the search for k elements via quantum walk
- A quantum Jensen-Shannon graph kernel for unattributed graphs
- Exceptional quantum walk search on the cycle
- Localization of a multi-dimensional quantum walk with one defect
- Equivalence of Szegedy's and coined quantum walks
- Generalized teleportation by quantum walks
- Coherence of one-dimensional quantum walk on cycles
- Perfect state transfer on abelian Cayley graphs
- Quantum algorithm design: techniques and applications
- Qswalk: a \textit {Mathematica} package for quantum stochastic walks on arbitrary graphs
- The spectral analysis of the unitary matrix of a 2-tessellable staggered quantum walk on a graph
- Quantum walks: a comprehensive review
- Enhancing the spreading of quantum walks on star graphs by additional bonds
- Time averaged distribution of a discrete-time quantum walk on the path
- Asymptotic distributions of quantum walks on the line with two entangled coins
- Spatial search using the discrete time quantum walk
- Correlated Markov quantum walks
- One-dimensional quantum walks with absorbing boundaries
- Quantum walks with memory on cycles
- Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks
- Intricacies of quantum computational paths
- Constructing quantum hash functions based on quantum walks on Johnson graphs
- Simple hash function using discrete-time quantum walks
- Discrete-time quantum walk on the Cayley graph of the dihedral group
- Quantum key distribution with quantum walks
- Strassen's theorem for quantum couplings
- Quantum walks on hypergraphs
- Quantum walks on embeddings
- Fermionic walkers driven out of equilibrium
- Occupation time for classical and quantum walks
- Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
- Directed graph encoding in quantum computing supporting edge-failures
- Arbitrated quantum signature scheme with quantum walk-based teleportation
- Faster search of clustered marked states with lackadaisical quantum walks
- Simplifying continuous-time quantum walks on dynamic graphs
- Quantum multi-secret sharing via trap codes and discrete quantum walks
- Generalized quantum teleportation of shared quantum secret: a coined quantum-walk approach
- The average search probabilities of discrete-time quantum walks
- A new kind of universal and flexible quantum information splitting scheme with multi-coin quantum walks
- A new type of spectral mapping theorem for quantum walks with a moving shift on graphs
- Fast quantum search of multiple vertices based on electric circuits
- A new kind of flexible quantum teleportation of an arbitrary multi-qubit state by multi-walker quantum walks
- An encryption protocol for NEQR images based on one-particle quantum walks on a circle
- Verifiable multi-dimensional (t,n) threshold quantum secret sharing based on quantum walk
- Quantum identity authentication scheme based on quantum walks on graphs with IBM quantum cloud platform
- An efficient verifiable quantum secret sharing scheme via quantum walk teleportation
- Factoring discrete-time quantum walks on distance regular graphs into continuous-time quantum walks
- The energy cost of quantum information losses
- Periodicity of Grover walks on complete graphs with self-loops
- Perfect state transfer on Cayley graphs over dihedral groups: the non-normal case
- Quantum blind signature scheme based on quantum walk
- Periodicity of lively quantum walks on cycles with generalized Grover coin
- The sensitivity of a quantum PageRank
- The spectra of the unitary matrix of an n-tessellable staggered quantum walk on a graph
- Sedentary quantum walks
- Coined quantum walks lift the cospectrality of graphs and trees
- A quantum walk induced by Hoffman graphs and its periodicity
- Pretty good state transfer on Cayley graphs over dihedral groups
- On fermionic walkers interacting with a correlated structured environment
- Quantum walks and the size of the graph
- Discrete-time quantum walks and graph structures
- Hash function based on quantum walks
- Eigenbasis of the evolution operator of 2-tessellable quantum walks
- Efficient quantum circuits for Szegedy quantum walks
- One-dimensional continuous-time quantum walks
- Quantum walks on generalized quadrangles
- Exact simulation of coined quantum walks with the continuous-time model
- Comparing classical and quantum pageranks
- On the hitting times of quantum versus random walks
- Spectral transition for random quantum walks on trees
- Graphs of unitary matrices and positive semidefinite zero forcing
- Termination of nondeterministic quantum programs
- Proof rules for the correctness of quantum programs
- Optimal computation with non-unitary quantum walks
- Entangled Markov chains
- Spectral properties of quantum walks on rooted binary trees
- Discrete quantum walks hit exponentially faster
- An example of the difference between quantum and classical random walks
- Ergodic quantum computing
- Quantum walks on two kinds of two-dimensional models
- The discrete-time quaternionic quantum walk on a graph
- The staggered quantum walk model
- Quantum walk and its application domains: a systematic review
- Perfect edge state transfer on abelian Cayley graphs
- An infinite family of circulant graphs with perfect state transfer in discrete quantum walks
- Quantum walk with quadratic position-dependent phase defects
- Search on vertex-transitive graphs by lackadaisical quantum walk
- On the equivalence between quantum and random walks on finite graphs
- Perfect edge state transfer on cubelike graphs
- An index theorem for one-dimensional gapless non-unitary quantum walks
- Why and how to add direction to a quantum walk
- Quantum extensive-form games
- Collider events on a quantum computer
- Three-state quantum walk on the Cayley graph of the dihedral group
This page was built for publication: Quantum walks on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175952)
