On the Relationship Between Continuous- and Discrete-Time Quantum Walk

2009/10/09 by Andrew M. Childs · 52 citations
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata #Cloud Computing and Resource Management

paper · doi:10.1007/s00220-009-0930-1

Cited by

• Quantum algorithms for scientific computing
• Fourier extensions for matrix-function block encodings with error-independent subnormalization bounds
• Robustness of periodicity in Grover walks under a magnetic vector potential
• Noise-resilient spatial search with lackadaisical quantum walks
• A Primer on Quantum Machine Learning
• Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
• Discretization of continuous-time quantum walks via the staggered model\n with Hamiltonians
• A Quantum Walk Enhanced Grover Search Algorithm for Global Optimization
• Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines
• Continuum Limits of Lazy Open Quantum Walks
• Quantum Algorithms for Unsupervised Machine Learning and Neural Networks
• Efficient quantum circuits for dense and non-unitary operators
• Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem
• Hamiltonian Simulation by Uniform Spectral Amplification
• Lazy Quantum Walks with Native Multiqubit Gates
• Quantum-driven sampling of the quasi-uniform distribution via quantum walks
• Quantum Support Vector Machine for Big Data Classification
• Quantum linear systems algorithms: a primer
• Quantum Algorithm for a Convergent Series of Approximations towards the Exact Solution of the Lowest Eigenstates of a Hamiltonian
• Quantum Recommendation Systems
• Randomized Algorithms and Lower Bounds for Quantum Simulation
• Exponential Quantum Advantage for Message Complexity in Distributed Algorithms
• Quantum Algorithms in Cybernetics
• Fast-forwardable Lindbladians imply quantum phase estimation
• Multi-target quantum walk search on Johnson graph
• Quantum Krylov Algorithm for Szegö Quadrature
• Improving time dynamics simulation by sampling the error unitary
• Qubit-optimal quantum phase estimation of block-encoded Hamiltonians
• Optimal quantum simulation of linear non-unitary dynamics
• A Symmetry-Based Taxonomy of Quantum Algorithms
• A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint
• Memory and interfaces in composite dispersion: A probability amplitude functions theory
• Time-Dependent Hamiltonian Simulation via Time-Independent Dynamics in a Larger Space
• Finding Angles for Quantum Signal Processing with Machine Precision
• On quantum computation of Kloosterman sums
• Quantum Fractional Revival on Graphs
• Quantum Fast-Forwarding: Markov Chains and Graph Property Testing
• Quantum Machine Learning For Classical Data
• Quantum walk on a spin network
• Efficient implementation of unitary transformations
• Two Variations of Quantum Phase Estimation for Reducing Circuit Error Rates: Application to the Harrow--Hassidim--Lloyd Algorithm
• Uniform semiclassical observable error bound of Trotterization without the Egorov theorem: a simple algebraic proof
• Controllability of Quantum Walks on Graphs
• Quantum state transfer and periodicity in discrete-time quantum walks under non--Markovian dephasing noise
• Deterministic quantum search on all Laplacian integral graphs
• A universal adiabatic quantum query algorithm
• Search of clustered marked states with lackadaisical quantum walks
• Quantum stabilizer codes from Abelian and non-Abelian groups association schemes
• Efficient quantum circuits for dense circulant and circulant like operators. [europepmc]
• Discrete-Time Quantum Walk with Phase Disorder: Localization and Entanglement Entropy. [europepmc]
• Biology and medicine in the landscape of quantum advantages. [europepmc]
• Efficient and practical Hamiltonian simulation from time-dependent product formulas. [europepmc]