An example of the difference between quantum and classical random walks

From MaRDI portal
Publication:2573073

DOI10.1023/A:1019609420309zbMath1329.82006arXivquant-ph/0103020WikidataQ61604376 ScholiaQ61604376MaRDI QIDQ2573073

Andrew M. Childs, Edward Farhi, Sam Gutmann

Publication date: 7 November 2005

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0103020




Related Items (81)

Quantum decomposition of random walk on Cayley graph of finite groupGenerator of an abstract quantum walkQuantum walk on a comb with infinite teethQuantum WalksOne-dimensional continuous-time quantum walksOne-dimensional three-state quantum walk with single-point phase defectsQUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONSImproving quantum state transfer efficiency and entanglement distribution in binary tree spin network through incomplete collapsing measurementsGate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubitsInvestigation of continuous-time quantum walk via spectral distribution associated with adjacency matrixA quantum Jensen-Shannon graph kernel for unattributed graphsQuantum walk and its application domains: a systematic reviewEfficient quantum algorithms for simulating sparse HamiltoniansThe excitonic qubit coupled with a phonon bath on a star graph: anomalous decoherence and coherence revivalsPerfect state transfer by means of discrete-time quantum walk on complete bipartite graphsA Markov–Dobrushin Inequality for Quantum ChannelsDephasing assisted transport on a biomimetic ring structureLimit distribution of a continuous-time quantum walk with a spatially 2-periodic HamiltonianQuantum walks of three interacting bosons on one-dimensional optical latticesQuantum walk mixing is faster than classical on periodic latticesA new definition of hitting time and an embedded Markov chain in continuous-time quantum walksRanking nodes in directed networks via continuous-time quantum walksQuantum tunneling on graphsThe Quantum Complexity of Markov Chain Monte CarloOn the relationship between continuous- and discrete-time quantum walkEntanglement transfer via chiral and continuous-time quantum walks on a triangular chainINVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORMWhy and how to add direction to a quantum walkQuantum extensive-form gamesSwift chiral quantum walksPeriodicity of lively quantum walks on cycles with generalized Grover coinDiscrete-time quantum walks on one-dimensional latticesOn the efficiency of quantum algorithms for Hamiltonian simulationLocalization of a multi-dimensional quantum walk with one defectGeneral condition of quantum teleportation by one-dimensional quantum walksA graph with fractional revivalEfficient quantum circuits for continuous-time quantum walks on composite graphsLimiting properties of stochastic quantum walks on directed graphsTransport properties in directed quantum walks on the lineOn limiting distributions of quantum Markov chainsTree search and quantum computationOpen quantum random walksAnalysis and applications of quantum walksRelativistic effects and rigorous limits for discrete- and continuous-time quantum walksQuantum random walk polynomial and quantum random walk measureQuantum algorithm design: techniques and applicationsUniversally optimal noisy quantum walks on complex networksSpin Chains, Graphs and State RevivalA study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D latticeSYMMETRY AND QUANTUM TRANSPORT ON NETWORKSExperimental observations of 1D quantum walks in a limited regionQswalk: a \textit {Mathematica} package for quantum stochastic walks on arbitrary graphsTwo quantum coins sharing a walkerBirth and death processes and quantum spin chainsQuantum search algorithm for exceptional vertexes in regular graphs and its circuit implementationWhen is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)?Green's function approach for quantum graphs: an overviewQuantum walks: a comprehensive reviewContinuous-time quantum walks on semi-regular spidernet graphs via quantum probability theoryOne-dimensional quantum walks with absorbing boundariesQuantum walks, Ihara zeta functions and cospectrality in regular graphsInvestigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithmThe excitonic qubit on a star graph: dephasing-limited coherent motionQuantum walk with a general coin: exact solution and asymptotic propertiesCoined quantum walks lift the cospectrality of graphs and treesEntangled Markov chainsOn the von Neumann entropy of certain quantum walks subject to decoherenceConstruction of distinct discrete time scattering quantum walk formulations on the honeycomb latticeGraph matching using the interference of continuous-time quantum walksContinuous-time quantum walks on star graphsCONTINUOUS-TIME QUANTUM WALKS ON TREES IN QUANTUM PROBABILITY THEORYQUANTUM MAPS WITH SPACE EXTENT: A PARADIGM FOR LATTICE QUANTUM WALKSENTANGLED MARKOV CHAINS ARE INDEED ENTANGLEDQuantum walk on a toral phase spaceDiscrete quantum walks hit exponentially fasterCONTINUOUS-TIME QUANTUM WALKS ON ULTRAMETRIC SPACESContinuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked verticesThe effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processorsInfinite dimensional entangled Markov chainsFast quantum search of multiple vertices based on electric circuitsThe continuous-time quantum walk on some graphs based on the view of quantum probability




This page was built for publication: An example of the difference between quantum and classical random walks