Discrete quantum walks hit exponentially faster
From MaRDI portal
Publication:2571012
DOI10.1007/S00440-004-0423-2zbMATH Open1086.60025OpenAlexW3023909288MaRDI QIDQ2571012FDOQ2571012
Authors: Julia Kempe 
Publication date: 2 November 2005
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00440-004-0423-2
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Sums of independent random variables; random walks (60G50)
Cites Work
- Title not available (Why is that?)
- Exponential algorithmic speedup by a quantum walk
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- From quantum cellular automata to quantum lattice gases
- A random polynomial-time algorithm for approximating the volume of convex bodies
- On the Power of Quantum Computation
- Strengths and Weaknesses of Quantum Computing
- One-dimensional quantum walks
- Quantum walks on graphs
- Quantum simulations of classical random walks and undirected graph connectivity
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Title not available (Why is that?)
- An example of the difference between quantum and classical random walks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete quantum walks hit exponentially faster
- Title not available (Why is that?)
- Normal subgroup reconstruction and quantum computation using group representations
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
Cited In (32)
- Mean hitting times of quantum Markov chains in terms of generalized inverses
- Quantum walks can find a marked element on any graph
- Quantum Walks
- Quantum algorithm design: techniques and applications
- Quantum walk and its application domains: a systematic review
- Discrete quantum walks hit exponentially faster
- Decoherence in quantum walks – a review
- Strong dispersion property for the quantum walk on the hypercube
- Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations
- Simulation methods for quantum walks on graphs applied to formal language recognition
- Quantum transport in \(d\)-dimensional lattices
- Quantum random walk polynomial and quantum random walk measure
- Discrete-time quantum walk on the Cayley graph of the dihedral group
- Discrete-time quantum walks and graph structures
- Absorption probabilities of discrete quantum mechanical systems
- Title not available (Why is that?)
- Quantum simulation of perfect state transfer on weighted cubelike graphs
- The uniform measure for quantum walk on hypercube: A quantum Bernoulli noises approach
- Hitting time of quantum walks with perturbation
- A hybrid classical-quantum clustering algorithm based on quantum walks
- Construction of distinct discrete time scattering quantum walk formulations on the honeycomb lattice
- A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks
- The hitting time of quantum walk on 2D lattice
- QUANTUM TIMING AND SYNCHRONIZATION PROBLEMS
- Exponential algorithmic speedup by a quantum walk
- Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
- Ranking nodes in directed networks via continuous-time quantum walks
- Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
- Experimental observations of 1D quantum walks in a limited region
- Möbius quantum walk
- High-dimensional graphs convolution for quantum walks photonic applications
- Disordered quantum walks in one lattice dimension
This page was built for publication: Discrete quantum walks hit exponentially faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571012)
