Coins make quantum walks faster
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Dispersive estimates for quantum walks on 1D lattice
- Strongly trapped space-inhomogeneous quantum walks in one dimension
- Odd-periodic Grover walks
- Quantum walks on Sierpinski gasket and Sierpinski tetrahedron
- Entanglement entropy distinguishes PT-symmetry and topological phases in a class of non-unitary quantum walks
- Spectral mapping theorem of an abstract quantum walk
- Quantum walks on two-dimensional grids with multiple marked locations
- Deterministic generation of hybrid entangled states using quantum walks
- Asymptotic properties of the quantum walk with initial distribution localized in momentum space
- Discrete-time quantum walk search on Johnson graphs
- A nonlinear quantum walk induced by a quantum graph with nonlinear delta potentials
- Probability distributions for Markov chain based quantum walks
- Stationary amplitudes of quantum walks on the higher-dimensional integer lattice
- Multi-target quantum walk search on Johnson graph
- Quantum walks in external gauge fields
- Quantum walk on distinguishable non-interacting many-particles and indistinguishable two-particle
- Connection between continuous and discrete time quantum walks. From \(D\)-dimensional lattices to general graphs
- Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk
- Quantum walks can find a marked element on any graph
- Quantum walk on the line through potential barriers
- A quantum searching model finding one of the edges of a subgraph in a complete graph
- Faster search of clustered marked states with lackadaisical quantum walks
- Combinatorial and rotational quantum abstract detecting systems
- The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
- 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
- Element distinctness revisited
- Quantum partial search for uneven distribution of multiple target items
- Search algorithm on strongly regular graph by lackadaisical quantum walk
- On the relationship between continuous- and discrete-time quantum walk
- Quantum algorithm design: techniques and applications
- Quantum walks induced by Dirichlet random walks on infinite trees
- Quantum Walks
- Localization of space-inhomogeneous three-state quantum walks
- Analysis and applications of quantum walks
- Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph
- Scattering and inverse scattering for nonlinear quantum walks
- Eigenvalues of two-phase quantum walks with one defect in one dimension
- Open system approach to neutrino oscillations in a quantum walk framework
- Dynamical localization of quantum walks in random environments
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Moments of coinless quantum walks on lattices
- Stationary measure induced by the eigenvalue problem of the one-dimensional Hadamard walk
- Perfect state transfer, equitable partition and continuous-time quantum walk based search
- Supersymmetry for chiral symmetric quantum walks
- Continuous limits of linear and nonlinear quantum walks
- The role of tessellation intersection in staggered quantum walks
- Quantum abstract detecting systems
- Quantum search of matching on signed graphs
- Faster search by lackadaisical quantum walk
- QW-search/zeta correspondence
- Decoherence in quantum Markov chains
- Localization in quantum walks with periodically arranged coin matrices
- Spectral analysis for a multi-dimensional split-step quantum walk with a defect
- The localization of quantum random walks on Sierpinski gaskets
- Wave packet spreading with periodic, Fibonacci quasiperiodic, and random nonlinear discrete-time quantum walks
- Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model
- Spatial search by continuous-time quantum walk with multiple marked vertices
- Parrondo's game using a discrete-time quantum walk
- Controllability of quantum walks on graphs
- Quantum walks on simplicial complexes
- Quantum walk search on a two-dimensional grid with extra edges
- Quantum Random Walks – New Method for Designing Quantum Algorithms
- Szegedy's quantum walk with queries
- Correlated Markov quantum walks
- Spatial search using the discrete time quantum walk
- Quantum Walks with Multiple or Moving Marked Locations
- Quantum vs classical birth and death processes; exactly solvable examples
- Random time-dependent quantum walks
- Quantum walks: a comprehensive review
- Search on vertex-transitive graphs by lackadaisical quantum walk
- Localization of a multi-dimensional quantum walk with one defect
- Partition-based discrete-time quantum walks
- A unified framework of quantum walk search
- Exciton-mediated quantum search on a star graph
- Pulsation of quantum walk on Johnson graph
- History dependent quantum random walks as quantum lattice gas automata
- scientific article; zbMATH DE number 5901453 (Why is no real title available?)
- On the hitting times of quantum versus random walks
- Robust quantum spatial search
- Parrondo's game of quantum search based on quantum walk
- Periodicity of the discrete-time quantum walk on a finite graph
- Equivalence of Szegedy's and coined quantum walks
- Lackadaisical discrete-time quantum walk on Johnson graph
- Quantum walk search for exceptional configurations
- The quantum walk search algorithm: factors affecting efficiency
- Analysis of quantum walks with time-varying coin on \(d\)-dimensional lattices
- Adjacent vertices can be hard to find by quantum walks
- Adjacent vertices can be hard to find by quantum walks
- Sensitivity of quantum walk to phase reversal and geometric perturbations: an exploration in complete graphs
- One-dimensional quantum walks with a position-dependent coin
- Tree search and quantum computation
- Quantum search on simplicial complexes
- Quantum machine learning: a classical perspective
- An algorithm to factorize quantum walks into shift and coin operations
- Quantum search on Hanoi network
- Exceptional quantum walk search on the cycle
- Quantum random walks do not need a coin toss
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk
This page was built for publication: Coins make quantum walks faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921782)
