On the relationship between continuous- and discrete-time quantum walk

DOI10.1007/S00220-009-0930-1zbMath1207.81029arXiv0810.0312OpenAlexW2098948451WikidataQ56813120 ScholiaQ56813120MaRDI QIDQ625458

Andrew M. Childs

Publication date: 17 February 2011

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.0312

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum stochastic calculus (81S25) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (63)

Analytical expression for variance of homogeneous-position quantum walk with decoherent position ⋮ Quantum support vector machine based on gradient descent ⋮ Quantum walk on a comb with infinite teeth ⋮ Transport and localization in quantum walks on a random hierarchy of barriers ⋮ Grover search with lackadaisical quantum walks ⋮ Random walk quantum clustering algorithm based on space ⋮ Strong convergence of quantum random walks via semigroup decomposition ⋮ Quantum spectral methods for differential equations ⋮ Quantum walk and its application domains: a systematic review ⋮ 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 ⋮ A weak limit theorem for a class of long-range-type quantum walks in 1d ⋮ Solving systems of linear algebraic equations via unitary transformations on quantum processor of IBM quantum experience ⋮ Simulation of three-spin evolution under \(XX\) Hamiltonian on quantum processor of IBM-quantum experience ⋮ Fast black-box quantum state preparation based on linear combination of unitaries ⋮ Hitting time of quantum walks with perturbation ⋮ Ranking nodes in directed networks via continuous-time quantum walks ⋮ Quantum circuits for discrete-time quantum walks with position-dependent coin operator ⋮ Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices ⋮ Overview: recent development and applications of reduction and lackadaisicalness techniques for spatial search quantum walk in the near term ⋮ Perfect edge state transfer on cubelike graphs ⋮ Quantum blind signature scheme based on quantum walk ⋮ Abstract model of continuous-time quantum walk based on Bernoulli functionals and perfect state transfer ⋮ On the efficiency of quantum algorithms for Hamiltonian simulation ⋮ Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision ⋮ Discretization of continuous-time quantum walks via the staggered model with Hamiltonians ⋮ Operations with elements of transferred density matrix via unitary transformations on extended receiver ⋮ Lackadaisical discrete-time quantum walk on Johnson graph ⋮ Efficient quantum circuits for continuous-time quantum walks on composite graphs ⋮ Exact solutions and symmetry analysis for the limiting probability distribution of quantum walks ⋮ EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS ⋮ Controllability of quantum walks on graphs ⋮ Directional correlations in quantum walks with two particles ⋮ A Complete Characterization of Unitary Quantum Space ⋮ Quantum algorithm design: techniques and applications ⋮ Quantum circuit design for accurate simulation of qudit channels ⋮ Controllability of system dynamics on networks, quantum walks and random walks ⋮ How to Realize One-dimensional Discrete-time Quantum Walk by Dirac Particle ⋮ Computing scalar products via a two-terminal quantum transmission line ⋮ Birth and death processes and quantum spin chains ⋮ Element distinctness revisited ⋮ An all-pair quantum SVM approach for big data multiclass classification ⋮ Survival of classical and quantum particles in the presence of traps ⋮ ASYMPTOTIC ENTANGLEMENT IN 1D QUANTUM WALKS WITH A TIME-DEPENDENT COINED ⋮ Simulating continuous-time Hamiltonian dynamics by way of a discrete-time quantum walk ⋮ Quantum walks: a comprehensive review ⋮ Connection between continuous and discrete time quantum walks. From \(D\)-dimensional lattices to general graphs ⋮ Unnamed Item ⋮ Quantum walks and elliptic integrals ⋮ On the von Neumann entropy of certain quantum walks subject to decoherence ⋮ Thermalization in Many-Particle Quantum Walks ⋮ Bounding the costs of quantum simulation of many-body physics in real space ⋮ Quantum fractional revival on graphs ⋮ Quantum walk on a toral phase space ⋮ Eigenbasis of the evolution operator of 2-tessellable quantum walks ⋮ Brownian-Huygens propagation: modeling wave functions with discrete particle-antiparticle random walks ⋮ Arbitrated quantum signature scheme with quantum walk-based teleportation ⋮ Faster search of clustered marked states with lackadaisical quantum walks ⋮ Unnamed Item ⋮ Quantum multi-secret sharing via trap codes and discrete quantum walks ⋮ Discrete-time quantum walks: Continuous limit and symmetries ⋮ Wave packet spreading with periodic, Fibonacci quasiperiodic, and random nonlinear discrete-time quantum walks ⋮ Quantum computation and quantum information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient quantum algorithms for simulating sparse Hamiltonians
• From quantum cellular automata to quantum lattice gases
• On the absence of homogeneous scalar unitary cellular automata.
• Quantum computation of zeta functions of curves
• An example of the difference between quantum and classical random walks
• Quantum complexity of testing group commutativity
• Span-program-based quantum algorithm for evaluating formulas
• Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
• Universal Quantum Simulators
• Spatial search and the Dirac equation
• Quantum lower bounds for the collision and the element distinctness problems
• Adiabatic quantum state generation and statistical zero knowledge
• Exponential algorithmic speedup by a quantum walk
• Quantum verification of matrix products
• Locality in Distributed Graph Algorithms
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Digraph of a Unitary Matrix
• Faster quantum-walk algorithm for the two-dimensional spatial search
• Efficient discrete-time simulations of continuous-time quantum query algorithms
• One-dimensional quantum walks
• Quantum walks on graphs
• Optimal phase estimation in quantum networks
• Quantum Walk Algorithm for Element Distinctness
• On Some Exponential Sums
• Quantum simulations of classical random walks and undirected graph connectivity

This page was built for publication: On the relationship between continuous- and discrete-time quantum walk