Discrete quantum walks hit exponentially faster
From MaRDI portal
Publication:2571012
DOI10.1007/s00440-004-0423-2zbMath1086.60025OpenAlexW3023909288MaRDI QIDQ2571012
Publication date: 2 November 2005
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00440-004-0423-2
Sums of independent random variables; random walks (60G50) Graph theory (including graph drawing) in computer science (68R10)
Related Items
The uniform measure for quantum walk on hypercube: A quantum Bernoulli noises approach ⋮ Quantum Walks ⋮ Simulation methods for quantum walks on graphs applied to formal language recognition ⋮ Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits ⋮ Quantum walk and its application domains: a systematic review ⋮ 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 ⋮ Möbius quantum walk ⋮ A hybrid classical-quantum clustering algorithm based on quantum walks ⋮ Quantum random walk polynomial and quantum random walk measure ⋮ Quantum algorithm design: techniques and applications ⋮ Experimental observations of 1D quantum walks in a limited region ⋮ Discrete-time quantum walk on the Cayley graph of the dihedral group ⋮ Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations ⋮ Decoherence in quantum walks – a review ⋮ Construction of distinct discrete time scattering quantum walk formulations on the honeycomb lattice ⋮ Discrete-time quantum walks and graph structures ⋮ Absorption probabilities of discrete quantum mechanical systems ⋮ Disordered quantum walks in one lattice dimension ⋮ Quantum transport ind-dimensional lattices ⋮ Mean hitting times of quantum Markov chains in terms of generalized inverses ⋮ Implementation of quantum hitting times of cubelike graphs on IBM’s Qiskit platform ⋮ Quantum walks can find a marked element on any graph
Cites Work
- Approximate counting, uniform generation and rapidly mixing Markov chains
- From quantum cellular automata to quantum lattice gases
- An example of the difference between quantum and classical random walks
- Normal subgroup reconstruction and quantum computation using group representations
- Exponential algorithmic speedup by a quantum walk
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Strengths and Weaknesses of Quantum Computing
- One-dimensional quantum walks
- Quantum walks on graphs
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Quantum simulations of classical random walks and undirected graph connectivity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
