Quantum Simulation of a Discrete-Time Quantum Stochastic Walk
arXiv:2004.06151 · doi:10.1209/0295-5075/133/50003
Abstract
Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this paper, we propose a trajectory-based quantum simulation protocol to effectively implement a family of discrete-time QSWs in a quantum device. After deriving the protocol for a 2-vertex graph with a single edge, we show how our protocol generalizes to a graph with arbitrary topology and connectivity. The straight-forward generalization leads to simple scaling of the protocol to complex graphs. Finally, we show how to simulate a restricted class of continuous-time QSWs by a discrete-time QSW, and how this is amenable to our simulation protocol for discrete-time QSWs.
References in corpus (15)
- Quantum support vector machine for big data classification
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- A Quantum Random Walk Search Algorithm
- Universal quantum computation using the discrete time quantum walk
- Quantum stochastic walks: A generalization of classical random walks and quantum walks
- Fast Escape from Quantum Mazes in Integrated Photonics
- Observation of noise-assisted transport in an all-optical cavity-based network
- Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
- Optimally designed quantum transport across disordered networks
- Universally Optimal Noisy Quantum Walks on Complex Networks
- Quantum walks on graphs representing the firing patterns of a quantum neural network
- Quantum walks and gravitational waves
- Quantum Simulation of a Quantum Stochastic Walk
- On the physical realizability of quantum stochastic walks