Problem-informed Graphical Quantum Generative Learning

arXiv:2405.14072v3 Announce Type: replace Abstract: Leveraging the intrinsic probabilistic nature of quantum systems, generative quantum machine learning (QML) offers the potential to outperform classical learning models. Current generative QML algorithms mostly rely on general-purpose models that, while being very expressive, face several training challenges. One potential way to address these setbacks is by constructing problem-informed models that are capable of more efficient training on structured problems. In particular, probabilistic graphical models provide a flexible framework for representing structure in generative learning problems and can thus be exploited to incorporate inductive bias into QML algorithms. In this work, we propose a problem-informed quantum circuit Born machine Ansatz for learning the joint probability distribution of random variables, with independence relations efficiently represented by a Markov network (MN). We further demonstrate the applicability of the MN framework in constructing generative learning benchmarks and compare our model's performance to previous designs, showing that it outperforms problem-agnostic circuits. Based on a preliminary analysis of trainability, we narrow down the class of MNs to those exhibiting favourable trainability properties. Finally, we discuss the potential of our model to offer quantum advantage in the context of generative learning, and present a practical scenario demonstrating the scalability of the approach.

Abstract:Leveraging the intrinsic probabilistic nature of quantum systems, generative quantum machine learning (QML) offers the potential to outperform classical learning models. Current generative QML algorithms mostly rely on general-purpose models that, while being very expressive, face several training challenges. One potential way to address these setbacks is by constructing problem-informed models that are capable of more efficient training on structured problems. In particular, probabilistic graphical models provide a flexible framework for representing structure in generative learning problems and can thus be exploited to incorporate inductive bias into QML algorithms. In this work, we propose a problem-informed quantum circuit Born machine Ansatz for learning the joint probability distribution of random variables, with independence relations efficiently represented by a Markov network (MN). We further demonstrate the applicability of the MN framework in constructing generative learning benchmarks and compare our model's performance to previous designs, showing that it outperforms problem-agnostic circuits. Based on a preliminary analysis of trainability, we narrow down the class of MNs to those exhibiting favourable trainability properties. Finally, we discuss the potential of our model to offer quantum advantage in the context of generative learning, and present a practical scenario demonstrating the scalability of the approach.

arXiv:2405.14072 [quant-ph]

(or arXiv:2405.14072v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2405.14072 Focus to learn more arXiv-issued DOI via DataCite

https://doi.org/10.1088/2058-9565/ae73b0 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

aiqbench analysis

Problem-informed Graphical Quantum Generative Learning

Related coverage