Noise-regularized training of quantum circuit Born machines under a finite shot budget
Authors: Hoang M. Ngo, Quan Nguyen, Jung Taek Seo, Wanli Xing, My T. Thai
Organizations: Department of Computer and Information Science and Engineering, University of Florida, 1889 Museum Road, Gainesville, 32611, Florida, USA. · Department of Smart Security, Gachon University, 1342 Seongnam-daero, Sujeong-gu, Seongnam-si, 13120, Gyeonggi-do, Republic of Korea. · Department of Teaching and Learning, School of Education and Human Development, University of Miami, 5202 University Drive, Coral Gables, 33124, Florida, USA.
Quantum circuit Born machines (QCBMs) can learn distributions that are hard to sample from classically, but their value depends on generalizing from finite training data. Here, we study how hardware noise affects this generalization. We show that, for any noise process, the generalization gap of a QCBM trained with the maximum mean discrepancy is bounded by the complexity of the distributions the noisy model can reach. Scrambled local Pauli noise contracts this complexity but biases the model towards the uniform distribution, so residual noise acts as a regularizer whose optimal strength can be intermediate. We propose GENIE, a framework that realizes a chosen noise level with capped error mitigation and selects it during training from held-out data within a fixed execution budget, with provably bounded regret. In simulations on synthetic and census data, GENIE stays close to the best of four noise-control strategies, whereas every fixed noise level falls short in many settings.
Figures & tables
Figure 1: Overview of GENIE. The circuit-execution budget B is divided between training, (1−α)B , and probing, αB . Circuit parameters θ are updated using the MMD loss estimated from training data and outcomes weighted by probabilistic error reduction (PER) (y,w) , where y is a measured bitstring and w is its signed PER weight. Every K steps, θ is held fixed while candidate residual-noise profiles from capped PER allocation are evaluated on held-out validation data. The next profile is selected using validation fit, estimation uncertainty, and sampling overhead. The selected profile specifies target local Pauli-noise rates rk throughout the circuit, with γ(r) summarizing the effective global noise under the assumed model. GENIE returns the trained parameters θ^ and the selected residual-noise profile r^ .
Figure 2: Final population loss across training-set sizes and execution budgets. Rows show the blob (top), wfc (middle) and Ising (bottom) datasets, and panels within a row show the budgets B∈{1,5,25,125}×U . Each curve shows the final population loss LP against the training-set size m for training without mitigation, with half mitigation and with full mitigation, and for GENIE . Values are averaged over the three error rates and the three seeds, and bars show the range across seeds. The vertical axis is shared within each row.
Figure 3: Regret of each method over all conditions. Median (circles) and mean (diamonds) regret of each method relative to the best of the four methods, over the 144 conditions of the grid, with losses averaged over three seeds before the regret is computed. Labels give the median and the mean.
Figure 4: How often each method is near the best. a , Percentage of the 144 conditions in which each method is within a given regret threshold of the best method. A point (x,y) means that the method is within x% of the best method in y% of the conditions. The dotted lines mark thresholds of 1% and 5% . b , Percentage of conditions in which each method is the worst (left) and the best (right) of the four methods.
Figure 5: Generated population shares on Adult. Each group compares the percentage of records satisfying the indicated event in held-out real data (gray) and samples generated by four methods (colored). Dotted lines mark the real-data percentages. Smaller absolute gaps from these lines indicate more accurate marginal probabilities. Labels above bars show rounded percentages. GENIE is closest or tied for closest on six of the seven events, with an average absolute discrepancy of approximately 4 percentage points, versus 8 – 10 for the fixed mitigation levels. Values are averaged over combinations of B∈{5,25,125}×U and training-set sizes m∈{64,128,256,512} .
Figure 6: Preservation of subgroup income rates on Adult. Each marker represents one of 125 subgroups defined by values of two non-income attributes and covering at least 2% of the real test records. Its horizontal coordinate is the fraction of real subgroup members earning above 50K,whileitsverticalcoordinateisthecorrespondingfractioningenerateddata.Thedasheddiagonaldenotesexactagreementsuchthatpointsaboveitoverestimatethesubgroup’sincomerate,andpointsbelowitunderestimateit.Markersizeindicatesrealsubgroupsize.Verticalbarsshowhowmuchonegroup’sgeneratedanswervariesacrossruns.Panelannotationsreportthegroup−size−weightedmeanabsoluteerrorinpercentagepoints.GENIEreducesthiserrorto16points,comparedwith19–22$ for the fixed mitigation levels.
Figure 7: Income prediction on held-out records. Predictions are obtained by conditioning each learned distribution on a test record’s nine non-income bits and applying the decision rule in Methods. Each stacked bar represents 100 real test records: blue denotes correct predictions, orange denotes false positives (income at most 50Kpredictedasabove50K), and gray denotes false negatives (income above 50Kpredictedasatmost50K).
Quantum noise is expected to degrade quantum machine learning by driving circuits away from their noiseless implementations. Yet recent studies show moderate noise can reduce testing error, a behavior unexplained by weak-noise perturbative error accumulation or strong-noise trainability collapse. Here we develop a statistical learning theory connecting microscopic noise processes to macroscopic learning performance. At its heart is a noise-order purity parameter, derived from a surrogate model analysis, that predicts the noise-induced reduction in model complexity and the consequent reduction in the generalization gap. Noise simultaneously increases prediction bias. Their competition explains the intermediate-noise regime left open between these limits. It produces a finite-noise optimum whose location depends on the learning setup and can disappear in the large-sample limit. Numerical experiments validate these predictions. Noise programming can move a model towards this optimum. These results make the non-monotonic effect of noise predictable and provide a route to harness it.
Ziyu Zhang, Zikang Jia, Xiaosong Li +1
Department of Chemistry, University of Washington, Seattle, Washington 98195, USA · Department of Mathematics, University of Michigan, Ann Arbor, Michigan 48109, USA · Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109, USA
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.
Gennaro De Luca, Vinayak Sharma, Aviral Shrivastava
Quantum circuit Born machines based on instantaneous quantum polynomial-time (IQP) circuits are natural candidates for quantum generative modeling, both because of their probabilistic structure and because IQP sampling is provably classically hard in certain regimes. Recent proposals focus on training IQP-QCBMs using Maximum Mean Discrepancy (MMD) losses built from low-body Pauli-Z correlators, but the effect of initialization on the resulting optimization landscape remains poorly understood. In this work, we address this by first proving that the MMD loss landscape suffers from barren plateaus for random full-angle-range initializations of IQP circuits. We then establish lower bounds on the loss variance for identity and an unbiased data-agnostic initialization. We then additionally consider a data-dependent initialization that is better aligned with the target distribution and, under suitable assumptions, yields provable gradients and generally converges quicker to a good minimum (as indicated by our training of circuits with 150 qubits on genomic data). Finally, as a by-product, the developed variance lower bound framework is applicable to a general class of non-linear losses, offering a broader toolset for analyzing warm-starts in quantum machine learning.
Sacha Lerch, Joseph Bowles, Ricard Puig +3
Institute of Physics, Ecole Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland · Centre for Quantum Science and Engineering, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland · Xanadu, Toronto, ON, M5G 2C8, Canada +3