Quantum Stochastic Walk Models for Quantum State Discrimination
arXiv:2003.13257 · doi:10.1016/j.physleta.2019.126195
Abstract
Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We consider the problem of quantum state discrimination on such a system, and we solve it by optimizing the network topology weights. Finally, we test it on different quantum network topologies and compare it with optimal theoretical bounds.
References in corpus (12)
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Universal computation by quantum walk
- Dephasing assisted transport: Quantum networks and biomolecules
- Exponential algorithmic speedup by quantum walk
- Highly efficient energy excitation transfer in light-harvesting complexes: The fundamental role of noise-assisted transport
- Universal computation by multi-particle quantum walk
- On the Optimality of Square Root Measurements in Quantum State Discrimination
- Quantum walks on graphs representing the firing patterns of a quantum neural network
- Dephasing-assisted transport in linear triple quantum dots
- QSWalk: a Mathematica package for quantum stochastic walks on arbitrary graphs
- Optimal universal learning machines for quantum state discrimination
- Steady states of continuous-time open quantum walks