Back to News
quantum-computing

Trainability of IQP Quantum Circuit Born Machines Under Gaussian Initialization

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
A new study examines trainability challenges in quantum generative models using IQP circuits, which leverage the Born rule for machine learning tasks. The research focuses on Gaussian initialization schemes, addressing a gap in prior work that primarily studied uniform distributions. The paper provides rigorous analytical bounds on gradient variance and deviation using Stein’s lemma and Lipschitz concentration techniques. These results offer probabilistic guarantees for gradient behavior, critical for avoiding training failures in quantum models. While IQP circuits are classically hard to sample, their expectation values remain computable, enabling classical training via Maximum Mean Discrepancy loss. This duality highlights a practical pathway for hybrid quantum-classical learning. The work identifies conditions where barren plateaus—exponential gradient vanishing—become likely, proposing strategies to mitigate or exploit concentration effects based on initialization choices and circuit architecture. Findings suggest Gaussian initialization can influence trainability more predictably than uniform schemes, offering a framework to design more robust quantum machine learning models.
Trainability of IQP Quantum Circuit Born Machines Under Gaussian Initialization

Summarize this article with:

Quantum Physics arXiv:2606.10179 (quant-ph) [Submitted on 8 Jun 2026] Title:Trainability of IQP Quantum Circuit Born Machines Under Gaussian Initialization Authors:Gennaro De Luca View a PDF of the paper titled Trainability of IQP Quantum Circuit Born Machines Under Gaussian Initialization, by Gennaro De Luca View PDF HTML (experimental) Abstract:Quantum Circuit Born Machines (QCBMs) offer a natural approach to generative machine learning by leveraging the Born rule. Recent work has provided a method to classically train QCBMs with Instantaneous Quantum Polynomial (IQP) circuits via the Maximum Mean Discrepancy (MMD) loss. Despite the assumed intractability of sampling from IQP circuits classically, their expectation values can be computed classically, enabling training of these IQP QCBMs. However, quantum machine learning (QML) models have various other challenges, including trainability issues caused by exponential concentration or barren plateaus. While these issues have been explored for parameters sampled from a uniform distribution, little work has been done to rigorously treat the use of arbitrary Gaussian initialization schemes. This work leverages Stein's lemma and Lipschitz concentration bounds for Gaussian random variables to provide an analytical lower bound of the variance of the gradient and a probabilistic concentration bound of the deviation of the gradient from its mean. It discusses strategies to either avoid or encourage exponential concentration, as well as the conditions under which barren plateaus are more likely to occur. Comments: Subjects: Quantum Physics (quant-ph); Machine Learning (cs.LG) Cite as: arXiv:2606.10179 [quant-ph] (or arXiv:2606.10179v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.10179 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Gennaro De Luca [view email] [v1] Mon, 8 Jun 2026 21:14:21 UTC (13 KB) Full-text links: Access Paper: View a PDF of the paper titled Trainability of IQP Quantum Circuit Born Machines Under Gaussian Initialization, by Gennaro De LucaView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-06 Change to browse by: cs cs.LG References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-machine-learning
quantum-geopolitics

Source Information

Source: arXiv Quantum Physics