Conditional IQP Born machines capture magnetization shifts.

Oriol Balló-Gimbernat of Eurecat, Centre Tecnològic de Catalunya, and colleagues demonstrate that a single conditional model, using just sixteen qubits, accurately captures the magnetization transition of the Curie-Weiss spin model at previously unseen temperatures. This approach encodes conditioning information within the input state and uses a shared IQP unitary, outperforming diagonally conditioned models with the same number of qubits and achieving comparable results to classical generative models with significantly more parameters. The work extends classically trained IQP Born machines to conditional generation.

Classical Training of Conditional IQP Born Machines

This demonstration of predictive capability distinguishes it from diagonally conditioned IQP models with an equivalent qubit count, which cannot represent the same conditional data families. The architecture achieves this by encoding the conditioning information directly into the input state, while employing a single IQP unitary across all conditions, a departure from previous designs that relied on condition-dependent parameters within the diagonal layer. The training process minimized the squared maximum mean discrepancy (MMD) across various conditions, a metric dependent on the model’s Pauli-Z moments, estimated classically as described in the research.

The team trained conditional models classically with up to 2048 qubits, reproducing the mean squared magnetization of the target Curie-Weiss model away from the crossover point, validating the scalability of the approach. This work builds upon previously established methods for classically training IQP Born machines, extending their capabilities to encompass conditional generation.

For the sixteen-qubit Curie-Weiss spin model, a single conditional model captures the magnetization transition at held-out temperatures. The model exhibited a mean total variation distance six times lower than that of a diagonally conditioned IQP model under the same protocol.

The researchers emphasize the scalability of their approach, stating, “We trained conditional IQP Born machines for the Curie–Weiss model with up to 2048 qubits.” Because the Curie-Weiss model is permutation invariant, its exact observables reduce to sums over the n + 1 values of the magnetization and remain computable at these sizes, allowing the team to verify what the models learned against the target.

IQP Circuits Bypass Quantum Hardware Training Costs

The ability to accurately model complex physical phenomena without relying on extensive quantum hardware resources has moved closer to reality, as a newly developed conditional IQP Born machine demonstrates performance comparable to classical generative models while using significantly fewer parameters. This achievement bypasses the need for large-scale quantum computers for training, a major obstacle in the field of quantum machine learning.

This contrasts with earlier designs that relied on making the parameters of the diagonal layer condition-dependent, offering a more efficient and versatile architecture. The researchers demonstrated that this input conditioning can represent conditional families of data that diagonally conditioned IQP models, even those with the same number of qubits, cannot reproduce.

This approach allows for the calculation of unbiased gradients, essential for training the conditional IQP Born machines. The team’s method uses efficient sampling and amplitude-ratio evaluation for the reference state, enabling unbiased classical estimates of the conditional maximum mean discrepancy objective and its gradients.

Six-Fold Improvement Over Diagonal Conditioning at 16 Qubits

The ability to accurately predict behavior at held-out temperatures suggests a more robust and efficient representation of the underlying physical system. The researchers also note that diagonal conditioning, even with a large number of parameters tailored to each training temperature, learns the target distribution less accurately than the conditional model under the same training protocol. This highlights the benefit of the new approach in terms of both accuracy and parameter efficiency.

Scaling Conditional IQP Born Machines to 2048 Qubits

This demonstration of complex modeling with a relatively small qubit count highlights a key advantage of the new approach to conditional quantum generation. The researchers demonstrated this capability through a theoretical proof, Proposition 1 in their published work, establishing a fundamental advantage for input conditioning in representing certain types of conditional distributions. The team validated the models through the mean squared magnetization, a computable metric for the Curie-Weiss model, allowing direct comparison against the target at various sizes.

This classical training also enabled estimation of physical observables without requiring quantum hardware, a significant efficiency gain. The researchers note that the method’s success relies on the input state supporting efficient sampling and amplitude ratios. The framework’s design, encoding the condition in the input state and sharing a single IQP unitary, offers a distinct advantage over traditional diagonally conditioned models.

Representing Conditional Families Beyond Diagonal Models

The architecture of this new approach diverges from previous conditional IQP Born machines, which altered parameters within the diagonal layer to reflect the conditioning information. This design choice is not merely a technical refinement. It fundamentally expands the scope of representable conditional families, enabling the model to capture relationships that are inaccessible to diagonally conditioned counterparts.

The researchers suggest that future work will focus on characterizing which conditional families can be represented by different classes of tractable encoders, and how the encoder itself influences the model’s ability to generalize, opening avenues for exploring the interplay between encoder design and the representation of complex conditional data.

👉 More information
🗞 Classical training of conditional instantaneous quantum polynomial-time Born machines
✍️ Oriol Balló-Gimbernat and Adan Garriga (Eurecat, Centre Tecnològic de Catalunya, Barcelona, Spain); Emiliano Tolotti (Department of Information Engineering and Computer Science, University of Trento, Via Sommarive 9, 38123 Trento, Italy); Laia Domingo and Fernando Vilariño (Centre de Visió per Computador (CVC), Barcelona, Spain)
🧠 ArXiv: https://arxiv.org/html/2611.05483v1

Stay current

See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.

Avatar of Rusty Flint

Rusty Flint

Rusty is a quantum science nerd. He's been into academic science all his life, but spent his formative years doing less academic things. Now he turns his attention to write about his passion, the quantum realm. He loves all things Quantum Physics especially. Rusty likes the more esoteric side of Quantum Computing and the Quantum world. Everything from Quantum Entanglement to Quantum Physics. Rusty thinks that we are in the 1950s quantum equivalent of the classical computing world. While other quantum journalists focus on IBM's latest chip or which startup just raised $50 million, Rusty's over here writing 3,000-word deep dives on whether quantum entanglement might explain why you sometimes think about someone right before they text you. (Spoiler: it doesn't, but the exploration is fascinating)

Latest Posts by Rusty Flint: