Pages that link to "Item:Q3581288"

The following pages link to Exponential algorithmic speedup by a quantum walk (Q3581288):

Displaying 50 items.

• Quantum computation and quantum information (Q252779) (← links)
• Quantum walk on the line through potential barriers (Q264601) (← links)
• Duality quantum computer and the efficient quantum simulations (Q291560) (← links)
• Perfect state transfer in Laplacian quantum walk (Q295824) (← links)
• Path-integral solution of the one-dimensional Dirac quantum cellular automaton (Q305025) (← links)
• \textit{pyCTQW}: a continuous-time quantum walk simulator on distributed memory computers (Q310323) (← links)
• Grover walks on a line with absorbing boundaries (Q331399) (← links)
• Localization of two-particle quantum walk on glued-tree and its application in generating Bell states (Q331406) (← links)
• Laplacian versus adjacency matrix in quantum walk search (Q332103) (← links)
• Two-dimensional quantum walk with position-dependent phase defects (Q488166) (← links)
• Green's function approach for quantum graphs: an overview (Q521776) (← links)
• Crossover from diffusive to ballistic transport in periodic quantum maps (Q595998) (← links)
• On the relationship between continuous- and discrete-time quantum walk (Q625458) (← links)
• A hybrid classical-quantum clustering algorithm based on quantum walks (Q632204) (← links)
• Tree search and quantum computation (Q638594) (← links)
• A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
• Experimental observations of 1D quantum walks in a limited region (Q670001) (← links)
• Complexity classes of equivalence problems revisited (Q716333) (← links)
• Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix (Q877677) (← links)
• Efficient quantum algorithms for simulating sparse Hamiltonians (Q883042) (← links)
• Quantum walks on a circle with optomechanical systems (Q892624) (← links)
• Weyl, Dirac and Maxwell quantum cellular automata (Q892928) (← links)
• Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory (Q967281) (← links)
• Quantum computing algorithm for electromagnetic field simulation (Q989907) (← links)
• Quantum approaches to graph colouring (Q1004074) (← links)
• Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
• Vertices cannot be hidden from quantum spatial search for almost all random graphs (Q1654045) (← links)
• Quantum algorithm design: techniques and applications (Q1730317) (← links)
• Qswalk: a \textit {Mathematica} package for quantum stochastic walks on arbitrary graphs (Q1738911) (← links)
• Quantum walk on distinguishable non-interacting many-particles and indistinguishable two-particle (Q1757873) (← links)
• Quantum walks: a comprehensive review (Q1757875) (← links)
• Time averaged distribution of a discrete-time quantum walk on the path (Q1757883) (← links)
• Spatial search using the discrete time quantum walk (Q1761706) (← links)
• Quantum entanglement as a new information processing resource (Q1880335) (← links)
• Intricacies of quantum computational paths (Q1952642) (← links)
• Image classification based on quantum K-nearest-neighbor algorithm (Q1991017) (← links)
• Quantum key distribution with quantum walks (Q1994738) (← links)
• Universal state transfer on graphs (Q2015084) (← links)
• Reducing the number of ancilla qubits and the gate count required for creating large controlled operations (Q2018210) (← links)
• Perfect state transfer on weighted abelian Cayley graphs (Q2047235) (← links)
• Laplacian fractional revival on graphs (Q2048554) (← links)
• Hitting times of quantum and classical random walks in potential spaces (Q2088229) (← links)
• Zero transfer in continuous-time quantum walks (Q2100789) (← links)
• Faster search of clustered marked states with lackadaisical quantum walks (Q2101572) (← links)
• The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors (Q2102182) (← links)
• Simplifying continuous-time quantum walks on dynamic graphs (Q2102270) (← links)
• Spatial search on Johnson graphs by continuous-time quantum walk (Q2102297) (← links)
• Fast quantum search of multiple vertices based on electric circuits (Q2107944) (← links)
• An encryption protocol for NEQR images based on one-particle quantum walks on a circle (Q2110949) (← links)
• On state transfer in Cayley graphs for abelian groups (Q2110995) (← links)