Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2604.11314

Risk-aware neural pulse compilation of continuously parameterized single-qubit gates with optimal-control benchmarking and NMR hardware validation

Arash Fath Lipaei, Ebrahim Khaleghian, Gani Göral, Zidong Lin, Selin Aslan, Özgür E. Müstecaplıoğlu

quant-phSubmitted Apr 13, 2026• Announced Apr 14, 2026• 1 citation• Revised Oct 13, 2026 (v3)
v1 · Apr 13, 2026v2 · May 14, 2026v3 · Oct 13, 2026
arXivHTMLPDF

Abstract

Pulse-level compilation can reduce the depth and calibration overhead associated with decomposing continuously parameterized quantum operations into fixed gate libraries, but conventional optimal control requires a new optimization for each target and can be sensitive to hardware uncertainty. We introduce a physics-informed neural compilation framework that learns a reusable map from continuously parameterized single-qubit gate targets directly to experimentally admissible control waveforms. The compiler is trained end-to-end through differentiable quantum dynamics without precomputed optimal-pulse labels, and its robustness is improved by first diagnosing physically relevant failure modes and then applying tail-risk-aware fine-tuning. On a three-qubit liquid-state nuclear magnetic resonance (NMR) model, the learned compiler generalizes across Haar-distributed single-qubit targets with mean nominal fidelity above 0.99 and generates new pulses in submillisecond inference time. Matched benchmarks reveal complementary advantages: robust gradient ascent pulse engineering (GRAPE) achieves the highest per-target fidelity, whereas the trained neural compiler amortizes the optimization cost across the target family, enabling substantially faster online pulse generation. Risk-aware training substantially broadens tolerance to radio-frequency (RF)-amplitude errors, including perturbations beyond the training range. Experiments on a three-spin NMR processor reproduce the predicted broadening of the RF-tolerance response, although the absolute experimental correlations are lower than the simulated values. These results establish a general workflow combining amortized machine learning, physical sensitivity diagnosis, risk-aware control, optimal-control benchmarking, and hardware testing, providing a route toward fast and robust pulse-level compilation for repeatedly varying quantum operations.

Related papers

Uncovering Latent Structures in Robust Pulse Sequences: A Model-Based Reinforcement Learning Approach for Adaptable Quantum Control

Tobias Kiermeyer, Thomas Heydenreich, Léo Van Damme +3 more

Real-time adaptive control of quantum systems requires rapid generation of robust, high-fidelity pulses across a continuous range of operating conditions. Standard optimization algorithms such as gradient-ascent pulse engineering (GRAPE) solve each instance independently, discarding information between runs and requiring costly reinitialization when parameters change. We present an approach to robust optimal quantum control based on model-based reinforcement learning, in which a single neural network -- embedding the Hamiltonian directly into the training pipeline -- generates robust gates across an entire family of gate configurations, without pre-computed training data. Demonstrated on a single-spin (two-level) system, the trained networks produce pulses for arbitrary rotation angles over a range of pulse durations, detunings, and field inhomogeneities in milliseconds, at fidelities comparable to multi-seed GRAPE. The framework is inherently adaptable: any parameter entering the Hamiltonian can serve as a network input, extending the approach to different systems and control settings. Beyond speed, the network reveals structure in the control landscape: it discovers the same structured phase profiles that appear in GRAPE solutions -- made identifiable through fidelity-invariant symmetry transformations -- but more consistently than independent optimization. This consistency enables smooth interpolation across the entire trained parameter space.

quant-pharXiv:2606.24507•Jun 24, 2026•2 citations

Using Optimal Control to Guide Neural-Network Interpolation of Continuously-Parameterized Gates

Bikrant Bhattacharyya, Fredy An, Dominik Kozbiel +2 more

Control synthesis for continuously-parameterized families of quantum gates can enable critical advantages for mid-sized quantum computing applications in advance of fault-tolerance. We combine quantum optimal control with physics-informed machine learning to efficiently synthesize control surfaces that interpolate among continuously-parameterized gate families. Using optimal control as an active learning strategy to guide pretraining, we bootstrap a physics-informed neural network to achieve rapid convergence to nonlinear control surfaces sufficient for our desired gates. We find our approach is critical for enabling an expressiveness beyond linear interpolation, which is important in cases of hard quantum control. We show in simulation that by adapting our pretraining to use a few reference pulse calibrations, we can apply transfer learning to quickly calibrate our learned control surfaces when devices fluctuate over time. We demonstrate synthesis for one and two qubit gates with one or two parameters, focusing on gate families for variational quantum algorithm (VQA) ansatz. By avoiding the inefficient decomposition of VQA ansatz into basis gate sets, continuous gate families are a potential method to improve the noise robustness of VQAs in the near term. Our framework shows how accessible optimal control tools can be combined with simple machine learning to enable practitioners to achieve 3x speedups for their algorithms by going beyond the standard gate sets.

arXiv:2412.06623•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations

Evolution-Level Quantum Optimal Control of Single-Qubit Gates with Physics-Informed Neural Networks

Yao Du, Jian-Jian Cheng, Lin Zhang +2 more

Quantum gate design is often represented as pulse optimization, although the physical object that implements a gate is the full controlled evolution generated by the pulse. Here we use physics-informed neural networks to represent single-qubit gate design at this evolution level: the control fields, the Bloch-state trajectories, and the total duration are learned together under the Bloch equation. This changes the optimized object from pulse amplitudes to a differentiable physical process whose structure can be inspected and refined. For rotation gates, the optimized evolutions recover the physical organization expected for bounded single-qubit control, with no prescribed pulse ansatz or duration scan. For a geometric gate, the representation identifies localized bottlenecks in maintaining the geometric condition and turns this diagnosis into feedback, reducing the residual path error while preserving high fidelity. Thus physics-informed learning is used not only to synthesize gates, but also to make optimized quantum controls physically readable, diagnosable, and locally refinable. This process-level view may be especially useful for adapting gates to hardware-specific, task-specific, and locally varying experimental constraints.

quant-pharXiv:2607.14884•Jul 17, 2026•0 citations

Pulse-Driven Spin Paradigm for Noise-Aware Quantum Classification

Carlos Riascos-Moreno, Andrés Marino Álvarez-Meza, German Castellanos-Dominguez

Quantum machine learning (QML) integrates quantum computing with classical machine learning. Within this domain, QML-CQ classification tasks, where classical data is processed by quantum circuits, have attracted particular interest for their potential to exploit high-dimensional feature maps, entanglement-enabled correlations, and non-classical priors. Yet, practical realizations remain constrained by the Noisy Intermediate-Scale Quantum (NISQ) era, where limited qubit counts, gate errors, and coherence losses necessitate frugal, noise-aware strategies. The Data Re-Uploading (DRU) algorithm has emerged as a strong NISQ-compatible candidate, offering universal classification capabilities with minimal qubit requirements. While DRU has been experimentally demonstrated on ion-trap, photonic, and superconducting platforms, no implementations exist for spin-based quantum processing units (QPU-SBs), despite their scalability potential via CMOS-compatible fabrication and recent demonstrations of multi-qubit processors. Here, we present a pulse-level, noise-aware DRU framework for spin-based QPUs, designed to bridge the gap between gate-level models and realistic spin-qubit execution. Our approach includes (i) compiling DRU circuits into hardware-proximate, time-domain controls derived from the Loss–DiVincenzo Hamiltonian, (ii) explicitly incorporating coherent and incoherent noise sources through pulse perturbations and Lindblad channels, (iii) enabling systematic noise-sensitivity studies across one-, two-, and four-spin configurations via continuous-time simulation, and (iv) developing a noise-aware training pipeline that benchmarks gate-level baselines against spin-level dynamics using information-theoretic loss functions. Numerical experiments show that our simulations reproduce gate-level dynamics with fidelities near unity while providing a richer error characterization under realistic noise. Moreover, divergence-based losses significantly enhance classification accuracy and robustness compared to fidelity-based metrics. Together, these results establish the proposed framework as a practical route for advancing DRU on spin-based platforms and motivate future work on error-attentive training and spin–quantum-dot noise modeling.

Computers•Nov 1, 2025•0 citations

Performance of Krotov, PRONTO and PINN for optimal control of quantum gates

Martín D. Jiménez, Murilo D. Forlevesi, Emanuel F. de Lima +1 more

Achieving scalable quantum computing demands high-fidelity operations capable of mitigating population leakage into non-computational states. Physics-Informed Neural Networks (PINNs) have recently emerged as a powerful paradigm to unify quantum hardware characterization (inverse problems) and pulse engineering (direct problems), laying the foundational architecture for autonomous quantum processors. However, standard PINN frameworks face severe numerical bottlenecks, such as spectral bias, when attempting to simultaneously solve highly oscillatory multi-level dynamics and optimize continuous control fields under strict global phase constraints. In this work, we propose an enhanced PINN scheme for quantum optimal control (PINNQOC) that circumvents these limitations by incorporating Fourier feature embeddings, dynamic epoch normalization, and an informed pre-training routine. To rigorously evaluate its performance, we systematically benchmark our framework against two premier continuous control solvers: the first-order Krotov method and the second-order Projection Operator Newton Method for Trajectory Optimization (PRONTO). These techniques are applied to implement multiple quantum gates on a truncated three-level fluxonium qubit and a four-level Nitrogen-Vacancy center coupled to a Carbon-13 nuclear spin. Our advanced PINNQOC approach successfully suppresses population leakage while achieving gate fidelities exceeding 99.9$\%$, matching the efficacy of traditional solvers. Finally, we provide a comprehensive analysis of computational times, iteration efficiency, and mean leakage, highlighting the distinct trade-offs and avenues for embedding physics-guided machine learning into automated quantum hardware pipelines.

quant-pharXiv:2607.23276•Jul 28, 2026•1 citation

No need to calibrate: characterization and compilation for high-fidelity circuit execution using imperfect gates

Ashish Kakkar, Samuel Marsh, Yulun Wang +5 more

We propose and validate on real quantum computing hardware a new method for extended two-qubit gate set design, replacing iterative, fine calibration with fast characterization of a small number of gate parameters which are then tracked and corrected in circuit compilation. Coherent contributions to the pulse unitary that would traditionally be considered sources of error are treated as part of the gate definition, and compensated in software via single-qubit rotations. This approach enables rapid device-wide generation of high-fidelity two-qubit entangling gates, which are combined with standard calibrated gates to produce an expanded gate set. We show how these gates are directly usable as part of a quantum compiler, synthesizing generic two-qubit circuit blocks into minimal-duration sequences of the characterized gates interleaved with compensating single-qubit rotations. Benchmarking against circuits compiled using the default $CX$ gate alone on 127-qubit IBM hardware shows up to 7X improvement in success probability for Quantum Fourier Transform circuits up to 26 qubits, and up to 9X lower mean-square error in Trotter simulations of the one-dimensional transverse-field Ising model. Our hardware-agnostic characterization and compilation methodology makes it practical to scale up expressive gate sets on quantum computing architectures while minimizing the need for onerous fine-tuning of low-level control waveforms.

quant-pharXiv:2511.21831•Nov 28, 2025•4 citations
Pulse-level compilation can reduce the depth and calibration overhead associated with decomposing continuously parameterized quantum operations into fixed gate libraries, but conventional optimal control requires a new optimization for each target and can be sensitive to hardware uncertainty. We introduce a physics-informed neural compilation framework that learns a reusable map from continuously parameterized single-qubit gate targets directly to experimentally admissible control waveforms. The compiler is trained end-to-end through differentiable quantum dynamics without precomputed optimal-pulse labels, and its robustness is improved by first diagnosing physically relevant failure modes and then applying tail-risk-aware fine-tuning. On a three-qubit liquid-state nuclear magnetic resonance (NMR) model, the learned compiler generalizes across Haar-distributed single-qubit targets with mean nominal fidelity above 0.99 and generates new pulses in submillisecond inference time. Matched benchmarks reveal complementary advantages: robust gradient ascent pulse engineering (GRAPE) achieves the highest per-target fidelity, whereas the trained neural compiler amortizes the optimization cost across the target family, enabling substantially faster online pulse generation. Risk-aware training substantially broadens tolerance to radio-frequency (RF)-amplitude errors, including perturbations beyond the training range. Experiments on a three-spin NMR processor reproduce the predicted broadening of the RF-tolerance response, although the absolute experimental correlations are lower than the simulated values. These results establish a general workflow combining amortized machine learning, physical sensitivity diagnosis, risk-aware control, optimal-control benchmarking, and hardware testing, providing a route toward fast and robust pulse-level compilation for repeatedly varying quantum operations.
Real-time adaptive control of quantum systems requires rapid generation of robust, high-fidelity pulses across a continuous range of operating conditions. Standard optimization algorithms such as gradient-ascent pulse engineering (GRAPE) solve each instance independently, discarding information between runs and requiring costly reinitialization when parameters change. We present an approach to robust optimal quantum control based on model-based reinforcement learning, in which a single neural network -- embedding the Hamiltonian directly into the training pipeline -- generates robust gates across an entire family of gate configurations, without pre-computed training data. Demonstrated on a single-spin (two-level) system, the trained networks produce pulses for arbitrary rotation angles over a range of pulse durations, detunings, and field inhomogeneities in milliseconds, at fidelities comparable to multi-seed GRAPE. The framework is inherently adaptable: any parameter entering the Hamiltonian can serve as a network input, extending the approach to different systems and control settings. Beyond speed, the network reveals structure in the control landscape: it discovers the same structured phase profiles that appear in GRAPE solutions -- made identifiable through fidelity-invariant symmetry transformations -- but more consistently than independent optimization. This consistency enables smooth interpolation across the entire trained parameter space.
Control synthesis for continuously-parameterized families of quantum gates can enable critical advantages for mid-sized quantum computing applications in advance of fault-tolerance. We combine quantum optimal control with physics-informed machine learning to efficiently synthesize control surfaces that interpolate among continuously-parameterized gate families. Using optimal control as an active learning strategy to guide pretraining, we bootstrap a physics-informed neural network to achieve rapid convergence to nonlinear control surfaces sufficient for our desired gates. We find our approach is critical for enabling an expressiveness beyond linear interpolation, which is important in cases of hard quantum control. We show in simulation that by adapting our pretraining to use a few reference pulse calibrations, we can apply transfer learning to quickly calibrate our learned control surfaces when devices fluctuate over time. We demonstrate synthesis for one and two qubit gates with one or two parameters, focusing on gate families for variational quantum algorithm (VQA) ansatz. By avoiding the inefficient decomposition of VQA ansatz into basis gate sets, continuous gate families are a potential method to improve the noise robustness of VQAs in the near term. Our framework shows how accessible optimal control tools can be combined with simple machine learning to enable practitioners to achieve 3x speedups for their algorithms by going beyond the standard gate sets.
Quantum gate design is often represented as pulse optimization, although the physical object that implements a gate is the full controlled evolution generated by the pulse. Here we use physics-informed neural networks to represent single-qubit gate design at this evolution level: the control fields, the Bloch-state trajectories, and the total duration are learned together under the Bloch equation. This changes the optimized object from pulse amplitudes to a differentiable physical process whose structure can be inspected and refined. For rotation gates, the optimized evolutions recover the physical organization expected for bounded single-qubit control, with no prescribed pulse ansatz or duration scan. For a geometric gate, the representation identifies localized bottlenecks in maintaining the geometric condition and turns this diagnosis into feedback, reducing the residual path error while preserving high fidelity. Thus physics-informed learning is used not only to synthesize gates, but also to make optimized quantum controls physically readable, diagnosable, and locally refinable. This process-level view may be especially useful for adapting gates to hardware-specific, task-specific, and locally varying experimental constraints.
Quantum machine learning (QML) integrates quantum computing with classical machine learning. Within this domain, QML-CQ classification tasks, where classical data is processed by quantum circuits, have attracted particular interest for their potential to exploit high-dimensional feature maps, entanglement-enabled correlations, and non-classical priors. Yet, practical realizations remain constrained by the Noisy Intermediate-Scale Quantum (NISQ) era, where limited qubit counts, gate errors, and coherence losses necessitate frugal, noise-aware strategies. The Data Re-Uploading (DRU) algorithm has emerged as a strong NISQ-compatible candidate, offering universal classification capabilities with minimal qubit requirements. While DRU has been experimentally demonstrated on ion-trap, photonic, and superconducting platforms, no implementations exist for spin-based quantum processing units (QPU-SBs), despite their scalability potential via CMOS-compatible fabrication and recent demonstrations of multi-qubit processors. Here, we present a pulse-level, noise-aware DRU framework for spin-based QPUs, designed to bridge the gap between gate-level models and realistic spin-qubit execution. Our approach includes (i) compiling DRU circuits into hardware-proximate, time-domain controls derived from the Loss–DiVincenzo Hamiltonian, (ii) explicitly incorporating coherent and incoherent noise sources through pulse perturbations and Lindblad channels, (iii) enabling systematic noise-sensitivity studies across one-, two-, and four-spin configurations via continuous-time simulation, and (iv) developing a noise-aware training pipeline that benchmarks gate-level baselines against spin-level dynamics using information-theoretic loss functions. Numerical experiments show that our simulations reproduce gate-level dynamics with fidelities near unity while providing a richer error characterization under realistic noise. Moreover, divergence-based losses significantly enhance classification accuracy and robustness compared to fidelity-based metrics. Together, these results establish the proposed framework as a practical route for advancing DRU on spin-based platforms and motivate future work on error-attentive training and spin–quantum-dot noise modeling.
Achieving scalable quantum computing demands high-fidelity operations capable of mitigating population leakage into non-computational states. Physics-Informed Neural Networks (PINNs) have recently emerged as a powerful paradigm to unify quantum hardware characterization (inverse problems) and pulse engineering (direct problems), laying the foundational architecture for autonomous quantum processors. However, standard PINN frameworks face severe numerical bottlenecks, such as spectral bias, when attempting to simultaneously solve highly oscillatory multi-level dynamics and optimize continuous control fields under strict global phase constraints. In this work, we propose an enhanced PINN scheme for quantum optimal control (PINNQOC) that circumvents these limitations by incorporating Fourier feature embeddings, dynamic epoch normalization, and an informed pre-training routine. To rigorously evaluate its performance, we systematically benchmark our framework against two premier continuous control solvers: the first-order Krotov method and the second-order Projection Operator Newton Method for Trajectory Optimization (PRONTO). These techniques are applied to implement multiple quantum gates on a truncated three-level fluxonium qubit and a four-level Nitrogen-Vacancy center coupled to a Carbon-13 nuclear spin. Our advanced PINNQOC approach successfully suppresses population leakage while achieving gate fidelities exceeding 99.9%\%%, matching the efficacy of traditional solvers. Finally, we provide a comprehensive analysis of computational times, iteration efficiency, and mean leakage, highlighting the distinct trade-offs and avenues for embedding physics-guided machine learning into automated quantum hardware pipelines.
We propose and validate on real quantum computing hardware a new method for extended two-qubit gate set design, replacing iterative, fine calibration with fast characterization of a small number of gate parameters which are then tracked and corrected in circuit compilation. Coherent contributions to the pulse unitary that would traditionally be considered sources of error are treated as part of the gate definition, and compensated in software via single-qubit rotations. This approach enables rapid device-wide generation of high-fidelity two-qubit entangling gates, which are combined with standard calibrated gates to produce an expanded gate set. We show how these gates are directly usable as part of a quantum compiler, synthesizing generic two-qubit circuit blocks into minimal-duration sequences of the characterized gates interleaved with compensating single-qubit rotations. Benchmarking against circuits compiled using the default CXCXCX gate alone on 127-qubit IBM hardware shows up to 7X improvement in success probability for Quantum Fourier Transform circuits up to 26 qubits, and up to 9X lower mean-square error in Trotter simulations of the one-dimensional transverse-field Ising model. Our hardware-agnostic characterization and compilation methodology makes it practical to scale up expressive gate sets on quantum computing architectures while minimizing the need for onerous fine-tuning of low-level control waveforms.