Quantum Walk Algorithm for Element Distinctness
From MaRDI portal
Publication:5454249
DOI10.1137/S0097539705447311zbMath1134.81010arXivquant-ph/0311001WikidataQ56386238 ScholiaQ56386238MaRDI QIDQ5454249
Publication date: 28 March 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0311001
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
68Q99: Theory of computing
Related Items
Unnamed Item, Unnamed Item, Path-sum solution of the Weyl quantum walk in 3 + 1 dimensions, The Power of Asymmetry in Constant-Depth Circuits, One-dimensional lackadaisical quantum walks, Probability distributions for Markov chain based quantum walks, Quantum Query Algorithms Are Completely Bounded Forms, ASYMPTOTIC ENTANGLEMENT IN 1D QUANTUM WALKS WITH A TIME-DEPENDENT COINED, Quantum Walks with Multiple or Moving Marked Locations, Unnamed Item, Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations, Quantum walks can find a marked element on any graph, The staggered quantum walk model, Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model, Quantum walks on simplicial complexes, Path-integral solution of the one-dimensional Dirac quantum cellular automaton, Grover walks on a line with absorbing boundaries, Discrete-time quantum walks in random artificial gauge fields, On the power of non-adaptive learning graphs, Massless Dirac equation from Fibonacci discrete-time quantum walk, Szegedy's quantum walk with queries, Simulating continuous-time Hamiltonian dynamics by way of a discrete-time quantum walk, On the relationship between continuous- and discrete-time quantum walk, Tree search and quantum computation, Discrete-time quantum walk search on Johnson graphs, Fourier 1-norm and quantum speed-up, The QWalk simulator of quantum walks, Periodicity of Grover walks on generalized Bethe trees, A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs, Weyl, Dirac and Maxwell quantum cellular automata, Quantum algorithms for finding constant-sized sub-hypergraphs, Claw finding algorithms using quantum walk, Quantum walk, entanglement and thermodynamic laws, Landau levels for discrete-time quantum walks in artificial magnetic fields, Quantum reversible circuit of AES-128, Spectral approximation for ergodic CMV operators with an application to quantum walks, Quantum walks and gravitational waves, Quantum algorithm for triangle finding in sparse graphs, The excitonic qubit coupled with a phonon bath on a star graph: anomalous decoherence and coherence revivals, Quantum field as a quantum cellular automaton: the Dirac free evolution in one dimension, Generalized teleportation by quantum walks, Quantum algorithm design: techniques and applications, Two quantum coins sharing a walker, Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations, Quantum walks in artificial electric and gravitational fields, Quantum walks with memory on cycles, Quantum search with variable times, Constructing quantum hash functions based on quantum walks on Johnson graphs, Element distinctness revisited, Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2, Models of quantum computation and quantum programming languages, Coined quantum walks lift the cospectrality of graphs and trees, Central limit theorems for open quantum random walks on the crystal lattices, Key establishment à la Merkle in a quantum world, Discrete-time quantum walks and graph structures, Hash function based on quantum walks, Quantum search on simplicial complexes, Perfect state transfer on distance-regular graphs and association schemes, Optimal parallel quantum query algorithms, Action principles for quantum automata and Lorentz invariance of discrete time quantum walks, On the hitting times of quantum versus random walks, Quantum walks on two kinds of two-dimensional models, Superlinear Advantage for Exact Quantum Algorithms, Discrete-time quantum walks: Continuous limit and symmetries, QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT, Quantum Complexity of Boolean Matrix Multiplication and Related Problems, Time-bin quantum RAM, Adjacent Vertices Can Be Hard to Find by Quantum Walks, Quantum algorithms for algebraic problems, Quantum Property Testing for Bounded-Degree Graphs, Unnamed Item, TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS, Quantum Walk Based Search Algorithms, The Quantum Complexity of Markov Chain Monte Carlo, Relativistic effects and rigorous limits for discrete- and continuous-time quantum walks
