Bridge of Ψ's (BOPS) is a generative model that learns to transform quantum circuits into equivalent, optimized versions using Schr"odinger bridges and a custom denoiser architecture. Trained on data engineered to challenge existing optimizers, BOPS achieves a 2.46× reduction in gate count and a 2.45× reduction in depth on 8‑qubit, 64‑depth Clifford+$T$ circuits, outperforming nine baseline optimizers. This work demonstrates the first successful application of generative machine learning to quantum circuit optimization, expanding the quantum compilation stack with learned techniques.
arXiv:2607. 29145v1 Announce Type: cross Abstract: Quantum software engineering is an emerging research field focusing on efficiently embedding the quantum programming paradigm into existing software ecosystems.
arXiv:2510. 12430v2 Announce Type: replace-cross Abstract: Translating a general quantum circuit on a specific hardware topology with a reduced set of available gates, also known as transpilation, comes with a substantial increase in the length of the equivalent circuit.
Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates. We study this problem using a compact 44.
Quantum MeanFlow (QMF) is a new quantum generative sampling method that enables single‑step sample generation by learning an average velocity field over a time interval, unlike the multi‑step quantum flow matching (QFM) which requires sequential integration of an ordinary differential equation. Using parameterized quantum circuits, the authors benchmark QMF and QFM on the MNIST dataset, finding that QMF produces lower image quality than multi‑step QFM but outperforms single‑step QFM at every shot count. Both models were executed on IBM quantum computers, and best‑of‑N rejection sampling mitigates device noise without circuit modification, demonstrating QMF’s practicality for efficient single‑step quantum generative sampling.
arXiv:2607. 12780v1 Announce Type: cross Abstract: Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates.
Circuit cutting lets a large quantum neural network (QNN) run as independent subcircuits on small devices, but rebuilding its outputs by reconstruction carries a classical sampling overhead exponential in the number of cuts - the dominant runtime cost in prior work. We ask whether, for machine-learning tasks, this step is necessary, and replace it with late fusion: each subcircuit is trained and measured independently, and a small classical head combines their outputs - a linear-cost, decision-level combination borrowed from multimodal learning.
arXiv:2606. 14822v1 Announce Type: cross Abstract: Recent advances in Machine Learning have transformed numerous industrial sectors, yet classical paradigms face fundamental limitations: rapidly growing data volumes, rising computational costs, significant energy consumption, and the physical scaling limits of conventional hardware architectures.
arXiv:2510. 03389v2 Announce Type: replace-cross Abstract: Current quantum computers require algorithms that use limited resources economically.
arXiv:2606. 31536v1 Announce Type: new Abstract: As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory.
AlphaClifford is a model‑based reinforcement learning framework that uses Monte Carlo Tree Search to synthesize Clifford circuits from the H, S, and CNOT gate set. By modeling the state space with the algebraic properties of the symplectic group, it consistently reduces total and two‑qubit gate counts compared to existing heuristics. The approach also extends to hardware‑constrained transpilation and serves as a post‑synthesis optimizer in a full Clifford+T pipeline.
arXiv:2607. 21121v1 Announce Type: cross Abstract: In this work, a quantum architecture search framework for approximate quantum state preparation (QSP) is proposed.
arXiv:2607. 16800v1 Announce Type: cross Abstract: Variational Quantum Algorithms (VQAs) are a leading paradigm for near-term quantum computing, yet their training suffers from sensitivity to circuit depth, initialization, and landscape pathologies such as barren plateaus.