How to Compute Using Quantum Walks
arXiv:2004.01329 · doi:10.4204/EPTCS.315.1
Abstract
Quantum walks are widely and successfully used to model diverse physical processes. This leads to computation of the models, to explore their properties. Quantum walks have also been shown to be universal for quantum computing. This is a more subtle result than is often appreciated, since it applies to computations run on qubit-based quantum computers in the single walker case, and physical quantum walks in the multi-walker case (quantum cellular automata). Nonetheless, quantum walks are powerful tools for quantum computing when correctly applied. In this paper, I explain the relationship between quantum walks as models and quantum walks as computational tools, and give some examples of their application in both contexts.
In Proceedings QSQW 2020, arXiv:2004.01061
References in corpus (28)
- Quantum Annealing in the Transverse Ising Model
- Strengths and Weaknesses of Quantum Computing
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Exponential algorithmic speedup by quantum walk
- Spatial search by quantum walk
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum Search by Local Adiabatic Evolution
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Universal quantum computation using the discrete time quantum walk
- Robustness of adiabatic quantum computation
- Universal computation by multi-particle quantum walk
- Discrete single-photon quantum walks with tunable decoherence
- Decoherence and disorder in quantum walks: From ballistic spread to localization
- Experimental Implementation of Discrete Time Quantum Random Walk on an NMR Quantum Information Processor
- Quantum Algorithms: Entanglement Enhanced Information Processing
- When does a physical system compute?
- Experimental implementation of an adiabatic quantum optimization algorithm
- Using Quantum Computers for Quantum Simulation
- Modernizing Quantum Annealing using Local Searches
- Climbing Mount Scalable: Physical-Resource Requirements for a Scalable Quantum Computer
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Finding spin-glass ground states using quantum walks
- Quantum walk transport properties on graphene structures
- Practical designs for permutation symmetric problem Hamiltonians on hypercubes