Coins make quantum walks faster
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Partition-based discrete-time quantum walks
- Scattering and inverse scattering for nonlinear quantum walks
- Exceptional quantum walk search on the cycle
- Parametric quantum search algorithm as quantum walk: a quantum simulation
- Stationary amplitudes of quantum walks on the higher-dimensional integer lattice
- Localization of a multi-dimensional quantum walk with one defect
- Equivalence of Szegedy's and coined quantum walks
- Quantum algorithm design: techniques and applications
- Faster search by lackadaisical quantum walk
- Quantum walk on distinguishable non-interacting many-particles and indistinguishable two-particle
- Quantum walks: a comprehensive review
- Spatial search using the discrete time quantum walk
- Correlated Markov quantum walks
- Quantum partial search for uneven distribution of multiple target items
- Element distinctness revisited
- Dispersive estimates for quantum walks on 1D lattice
- 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
- The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
- Combinatorial and rotational quantum abstract detecting systems
- Generalized quantum teleportation of shared quantum secret: a coined quantum-walk approach
- Strongly trapped space-inhomogeneous quantum walks in one dimension
- A new kind of flexible quantum teleportation of an arbitrary multi-qubit state by multi-walker quantum walks
- Wave packet spreading with periodic, Fibonacci quasiperiodic, and random nonlinear discrete-time quantum walks
- Stationary measure induced by the eigenvalue problem of the one-dimensional Hadamard walk
- Analysis and applications of quantum walks
- Adjacent vertices can be hard to find by quantum walks
- Quantum search on simplicial complexes
- Progress in quantum algorithms
- Exact simulation of coined quantum walks with the continuous-time model
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- Quantum walks for the determination of commutativity of finite dimensional algebras
- On the hitting times of quantum versus random walks
- Decoherence in quantum Markov chains
- One-dimensional quantum walks subject to next-nearest-neighbour hopping decoherence
- Quantum walks can find a marked element on any graph
- Quantum walk on the line through potential barriers
- An algorithm to factorize quantum walks into shift and coin operations
- Supersymmetry for chiral symmetric quantum walks
- Spectral mapping theorem of an abstract quantum walk
- Impact of the malicious input data modification on the efficiency of quantum spatial search
- Quantum abstract detecting systems
- Search on vertex-transitive graphs by lackadaisical quantum walk
- Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term
- Probability and entanglement evolutions for Szegedy's quantum search on the one-dimensional cycle with self-loops
- Eigenvalues of two-phase quantum walks with one defect in one dimension
- Quantum search of matching on signed graphs
- Quantum walks on Sierpinski gasket and Sierpinski tetrahedron
- Entanglement entropy distinguishes PT-symmetry and topological phases in a class of non-unitary 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
- History dependent quantum random walks as quantum lattice gas automata
- Quantum walks on simplicial complexes
- Adjacent vertices can be hard to find by quantum walks
- scientific article; zbMATH DE number 5901453 (Why is no real title available?)
- Quantum random walks do not need a coin toss
- Robust quantum spatial search
- Grover search with lackadaisical quantum walks
- Quantum Walk Based Search Algorithms
- Analysis of quantum walks with time-varying coin on \(d\)-dimensional lattices
- Localization of the Grover walks on spidernets and free Meixner laws
- Parrondo's game using a discrete-time quantum walk
- Controllability of quantum walks on graphs
- Quantum machine learning: a classical perspective
- Probability distributions for Markov chain based quantum walks
- Quantum walks induced by Dirichlet random walks on infinite trees
- Quantum walks in external gauge fields
- The quantum walk search algorithm: factors affecting efficiency
- Controllability of system dynamics on networks, quantum walks and random walks
- Trapping and spreading properties of quantum walk in homological structure
- Localization of space-inhomogeneous three-state quantum walks
- The localization of quantum random walks on Sierpinski gaskets
- Continuous limits of linear and nonlinear quantum walks
- Szegedy's quantum walk with queries
- One-dimensional quantum walks with a position-dependent coin
- Periodicity of the discrete-time quantum walk on a finite graph
- Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk
- Quantum search on Hanoi network
- Quantum Walks
- Connection between continuous and discrete time quantum walks. From \(D\)-dimensional lattices to general graphs
- Quantum Random Walks – New Method for Designing Quantum Algorithms
- Quantum Walks with Multiple or Moving Marked Locations
- Localization in quantum walks with periodically arranged coin matrices
- Lackadaisical quantum walks on 2D grids with multiple marked vertices
- Quantum walks on two-dimensional grids with multiple marked locations
- Odd-periodic Grover walks
- Open system approach to neutrino oscillations in a quantum walk framework
- The role of tessellation intersection in staggered quantum walks
- Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk
- Quantum walk search on a two-dimensional grid with extra edges
- Lackadaisical discrete-time quantum walk on Johnson graph
- On the relationship between continuous- and discrete-time quantum walk
- Tree search and quantum computation
- Dynamical localization of quantum walks in random environments
- Random time-dependent quantum walks
- Search algorithm on strongly regular graph by lackadaisical quantum walk
- Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph
- Perfect state transfer, equitable partition and continuous-time quantum walk based search
- Spectral analysis for a multi-dimensional split-step quantum walk with a defect
- Quantum walk search for exceptional configurations
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)
