Quantum stochastic walk models for quantum state discrimination
From MaRDI portal
Publication:2212931
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.
Recommendations
Cites work
- Completely positive dynamical semigroups of N-level systems
- Deep learning
- Designing optimal quantum detectors via semidefinite programming
- Exponential algorithmic speedup by a quantum walk
- scientific article; zbMATH DE number 3418522 (Why is no real title available?)
- On the generators of quantum dynamical semigroups
- Optimal Detection of Symmetric Mixed Quantum States
- Optimal Universal Learning Machines for Quantum State Discrimination
- Optimum testing of multiple hypotheses in quantum detection theory
- Qswalk: a \textit {Mathematica} package for quantum stochastic walks on arbitrary graphs
- Quantum detection and estimation theory
- Quantum walks: a comprehensive review
- Steady states of continuous-time open quantum walks
- The elements of statistical learning. Data mining, inference, and prediction
- Tutorial review. Discrimination of quantum states
- Universal computation by multiparticle quantum walk
- Universally optimal noisy quantum walks on complex networks
Cited in
(4)
This page was built for publication: Quantum stochastic walk models for quantum state discrimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212931)