quant-phNov 3, 2026

Classical training of conditional instantaneous quantum polynomial-time Born machines

Authors: Oriol Balló-Gimbernat, Emiliano Tolotti, Laia Domingo, Fernando Vilariño, Adan Garriga

Organizations: Eurecat, Centre Tecnològic de Catalunya, Barcelona, Spain · Centre de Visió per Computador (CVC), Barcelona, Spain · Universitat Autònoma de Barcelona (UAB), Barcelona, Spain · Department of Information Engineering and Computer Science, University of Trento, Via Sommarive 9, 38123 Trento, Italy

Abstract

Instantaneous quantum polynomial-time (IQP) Born machines are attractive quantum generative models, as certain IQP circuit families are conjectured to be hard to sample, yet they can be trained classically. Previously proposed conditional IQP Born machines make the parameters of the diagonal layer condition dependent. We introduce conditional IQP Born machines, in which the condition is encoded in the input state and a single IQP unitary is shared across conditions. Efficient sampling and amplitude-ratio evaluation for the reference state entering the diagonal layer suffice to obtain unbiased classical estimates of a conditional maximum mean discrepancy objective and its gradients. We show that input conditioning can represent conditional families that no diagonally conditioned IQP model with the same number of qubits can reproduce. For the sixteen-qubit Curie-Weiss spin model, a single conditional model captures the magnetization transition at held-out temperatures. Its mean total variation distance is six times lower than that of diagonal conditioning under the same protocol and comparable to that of classical generative models with up to seven times as many parameters. We also train conditional models classically with up to 2048 qubits, which reproduce the mean squared magnetization of the target away from the crossover. These results extend classically trained IQP Born machines to conditional generation.

Figures & tables

Appendix figures & tables8 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Characterizing the Trainability of Instantaneous Quantum Polynomial Circuit Born Machines

    Feb 11, 2026Kevin Shen, Susanne Pielawa, Vedran Dunjko +1Quantum Generative ModelingQuantum Circuit Born Machines

  2. IQP Born Machines under Data-dependent and Agnostic Initialization Strategies

    Mar 15, 2026Sacha Lerch, Joseph Bowles, Ricard Puig +3Quantum Circuit Born MachinesQuantum Machine Learning

  3. Trainability of IQP Quantum Circuit Born Machines Under Gaussian Initialization

    Jun 8, 2026Gennaro De Luca, Vinayak Sharma, Aviral ShrivastavaQuantum Generative ModelingQuantum Machine Learning