Spatial search and the Dirac equation
From MaRDI portal
Publication:3102517
DOI10.1103/PhysRevA.70.042312zbMath1227.81156arXivquant-ph/0405120OpenAlexW1968991779WikidataQ61604366 ScholiaQ61604366MaRDI QIDQ3102517
Andrew M. Childs, Jeffrey Goldstone
Publication date: 4 December 2011
Published in: Physical Review A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0405120
Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Computational methods for problems pertaining to quantum theory (81-08)
Related Items (56)
Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks ⋮ Localization of space-inhomogeneous three-state quantum walks ⋮ The walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks ⋮ Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems ⋮ Grover search with lackadaisical quantum walks ⋮ Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification ⋮ Quantum Walks ⋮ Robust quantum spatial search ⋮ History dependent quantum random walks as quantum lattice gas automata ⋮ Quantum walk and its application domains: a systematic review ⋮ Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs ⋮ A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks ⋮ Quantum circuits for discrete-time quantum walks with position-dependent coin operator ⋮ On the relationship between continuous- and discrete-time quantum walk ⋮ Lackadaisical quantum walk for spatial search ⋮ Periodicity of lively quantum walks on cycles with generalized Grover coin ⋮ Quantum walk search on a two-dimensional grid with extra edges ⋮ Discrete-time quantum walks on one-dimensional lattices ⋮ On the hitting times of quantum versus random walks ⋮ One-dimensional lackadaisical quantum walks ⋮ Probability distributions for Markov chain based quantum walks ⋮ Limiting properties of stochastic quantum walks on directed graphs ⋮ Walking on vertices and edges by continuous-time quantum walk ⋮ Transport properties in directed quantum walks on the line ⋮ Perfect state transfer on bi-Cayley graphs over abelian groups ⋮ Analysis and applications of quantum walks ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Relativistic effects and rigorous limits for discrete- and continuous-time quantum walks ⋮ One-dimensional quantum walks with a position-dependent coin ⋮ One-dimensional quantum walks with a time and spin-dependent phase shift ⋮ 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 quantum-walk algorithm for the two-dimensional spatial search ⋮ Faster search by lackadaisical quantum walk ⋮ Models of quantum computation and quantum programming languages ⋮ 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 ⋮ Quantum walks on hypergraphs ⋮ Decoherence in quantum walks – a review ⋮ How to suppress dark states in quantum networks and bio-engineered structures ⋮ Quantum Random Walks – New Method for Designing Quantum Algorithms ⋮ Quantum Walks with Multiple or Moving Marked Locations ⋮ Quantum state transfer on unsymmetrical graphs via discrete-time quantum walk ⋮ Quantum algorithms for algebraic problems ⋮ Quantum search on Hanoi network ⋮ QUANTUM MAPS WITH SPACE EXTENT: A PARADIGM FOR LATTICE QUANTUM WALKS ⋮ Quantum random walks do not need a coin toss ⋮ Quantum walk on a toral phase space ⋮ Two-particle coined-quantum walk with long-range interaction ⋮ QUANTUM WALKS ON GENERAL GRAPHS ⋮ Faster search of clustered marked states with lackadaisical quantum walks ⋮ Fast quantum search of multiple vertices based on electric circuits ⋮ Topological classification of time-asymmetry in unitary quantum processes ⋮ Finding more than one path through a simple maze with a quantum walk ⋮ Quantum walks can find a marked element on any graph
Cites Work
This page was built for publication: Spatial search and the Dirac equation
