Faster quantum-walk algorithm for the two-dimensional spatial search
From MaRDI portal
Publication:4903104
DOI10.1103/PhysRevA.78.012310zbMath1255.81118arXiv0801.0497OpenAlexW1980458533MaRDI QIDQ4903104
Publication date: 19 January 2013
Published in: Physical Review A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.0497
Related Items
Quantum walk, entanglement and thermodynamic laws ⋮ Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model ⋮ Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification ⋮ Robust quantum spatial search ⋮ Quantum walk and its application domains: a systematic review ⋮ Exceptional quantum walk search on the cycle ⋮ Search via quantum walks with intermediate measurements ⋮ Quantum search algorithm for set operation ⋮ Improvement of quantum walks search algorithm in single-marked vertex graph ⋮ Quantum circuits for discrete-time quantum walks with position-dependent coin operator ⋮ Quantum walks for the determination of commutativity of finite dimensional algebras ⋮ A quantum blockchain-enabled framework for secure private electronic medical records in Internet of medical things ⋮ On the relationship between continuous- and discrete-time quantum walk ⋮ Lackadaisical quantum walk for spatial search ⋮ Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk ⋮ Quantum walk search on a two-dimensional grid with extra edges ⋮ On the hitting times of quantum versus random walks ⋮ Probability distributions for Markov chain based quantum walks ⋮ Circuit implementation of discrete-time quantum walks via the shunt decomposition method ⋮ Controllability of quantum walks on graphs ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ An alternate quantum adiabatic evolution for the Deutsch-Jozsa problem ⋮ Quantum algorithm design: techniques and applications ⋮ SYMMETRY AND QUANTUM TRANSPORT ON NETWORKS ⋮ Controllability of system dynamics on networks, quantum walks and random walks ⋮ Search on a hypercubic lattice using a quantum random walk. I.<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>></mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math> ⋮ Search on a hypercubic lattice using a quantum random walk. II.<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math> ⋮ Faster search by lackadaisical quantum walk ⋮ Simulating continuous-time Hamiltonian dynamics by way of a discrete-time quantum walk ⋮ Quantum walks: a comprehensive review ⋮ Spatial search using the discrete time quantum walk ⋮ Connection between continuous and discrete time quantum walks. From \(D\)-dimensional lattices to general graphs ⋮ Analysis of quantum walks with time-varying coin on d-dimensional lattices ⋮ QUANTUM HITTING TIME ON THE COMPLETE GRAPH ⋮ Spatial search on a honeycomb network ⋮ Quantum search on Hanoi network ⋮ Quantum search on simplicial complexes ⋮ Generalized quantum teleportation of shared quantum secret: a coined quantum-walk approach ⋮ A new kind of flexible quantum teleportation of an arbitrary multi-qubit state by multi-walker quantum walks ⋮ Quantum computation and quantum information ⋮ Lackadaisical quantum walks on 2D grids with multiple marked vertices ⋮ Quantum walks can find a marked element on any graph
Cites Work
This page was built for publication: Faster quantum-walk algorithm for the two-dimensional spatial search
