Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem

DOI10.4230/LIPICS.TQC.2014.99MaRDI QIDQ2969052zbMATH OpenOpenAlexFDO

Authors Alex Monràs, Andreas Winter

Publication date 13 March 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/tqc/tqc2014.html#MonrasW14

zbMATH Keywords

machine learninghidden Markov modelquantum measurementquantum instrument

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Quantum learning of classical stochastic processes: the completely positive realization problem
• Quantum learning: asymptotically optimal classification of qubit states
• Equivalences and Separations Between Quantum and Classical Learnability
• The learnability of quantum states
• scientific article; zbMATH DE number 6096711
• Learning and testing quantum states via probabilistic combinatorics and representation theory
• Learning quantum models from quantum or classical data
• Quantum markovianity as a supervised learning task
• Optimal quantum sample complexity of learning algorithms
• Optimal quantum sample complexity of learning algorithms

Cited in

(5)

• Quantum learning of classical stochastic processes: the completely positive realization problem
• scientific article; zbMATH DE number 7701523 (Why is no real title available?)
• scientific article; zbMATH DE number 6096711 (Why is no real title available?)
• Quantum learning: asymptotically optimal classification of qubit states
• Machine learning versus semidefinite programming approach to a particular problem of the theory of open quantum systems

This page was built for publication: Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969052)