Sign inGet started
Paper · arXiv

QFlowNet: Fast, Diverse, and Efficient Unitary Synthesis with Generative Flow Networks

Unitary Synthesis, the decomposition of a unitary matrix into a sequence of quantum gates, is a fundamental challenge in quantum compilation. Prevailing reinforcement learning (RL) approaches are often hampered by sparse reward signals, which necessitate complex reward shaping or long training times, and typically converge to a single policy, lacking solution diversity. In this work, we propose QFlowNet, a novel framework that learns efficiently from sparse signals by pairing a Generative Flow Network (GFlowNet) with Transformers. Our approach addresses two key challenges. First, the GFlowNet framework is fundamentally designed to learn a diverse policy that samples solutions proportional...

AuthorsInhoe Koo, Hyunho Cha, Jungwoo Lee
Primary categoryquant-ph
Published3 March 2026
Last updated at source4 March 2026
quant-phcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/b8f5a94f-56de-422a-b1df-229cfa7c2730" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.