Structured Quantum Optimal Control under Bandwidth and Smoothness Constraints-An Inexact Proximal-ADMM Approach for Low-Complexity Pulse Synthesis

• URL: http://arxiv.org/abs/2603.13020v1
• Date: Fri, 13 Mar 2026 14:27:40 GMT
• Title: Structured Quantum Optimal Control under Bandwidth and Smoothness Constraints-An Inexact Proximal-ADMM Approach for Low-Complexity Pulse Synthesis
• Abstract summary: I study an inexact Proximal-ADMM framework that combines gate-infidelity with sparsity, total-variation regularization, explicit band-limit projection, and box constraints in a single loop.<n>It is benchmarked against GRAPE, standard Krotov, and L-BFGS-B on a single-qubit $X$ gate, a leakage-prone qutrit task, and a two-qubit entangling gate.<n>The contribution should still be read as a numerical framework for constrained pulse synthesis rather than as a finished route to immediately deployable high-fidelity gates
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum optimal control is often judged by nominal fidelity alone, even though realistic pulse-design studies must also account for bandwidth, amplitude, and smoothness constraints. I study this structured-control regime with an inexact Proximal-ADMM framework that combines gate-infidelity minimization with $L_1$ sparsity, total-variation regularization, explicit band-limit projection, and box constraints in a single loop. The method is benchmarked against GRAPE, standard Krotov, and L-BFGS-B on a single-qubit $X$ gate, a leakage-prone qutrit task, and a two-qubit entangling gate. Across ten random seeds, Pareto scans, ablations, filtered-baseline fairness checks, significance analysis with false-discovery-rate correction, and robustness tests, the method is not a universal winner in either nominal fidelity or wall-clock cost. Its value is instead to expose and stabilize a low-complexity frontier of the fidelity-complexity landscape. After retuning the PADMM budgets and warm-start lengths, the qutrit and two-qubit structured fidelities rise to 0.6672 +- 0.0001 and 0.6342 +- 0.0003, respectively, while preserving markedly lower complexity than unconstrained quasi-Newton solutions. These values remain well below deployment-grade gate thresholds, so the contribution should still be read as a numerical framework for constrained pulse synthesis rather than as a finished route to immediately deployable high-fidelity gates. Training-time robust optimization yields only task-dependent gains, with the clearest effect appearing in qutrit drift robustness and amounting to a small absolute improvement. The results therefore position PADMM as a constraint-native framework for low-complexity frontier exploration, not as a replacement for unconstrained high-fidelity solvers.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Distribution-Aware Robust Bilevel Optimization: Quantile-Guided Huber Updates in Two-Timescale Stochastic Approximation [16.106678611834102]
  Bilevel optimization (BLO) is fundamental to hierarchical decision-making but suffers from critical instability under heavy-tailed noise.<n>Existing techniques typically rely on magnitude checks, which fail to distinguish informative geometric signals from outliers.
  arXiv  Detail & Related papers  (2026-06-21T10:57:37Z)
• Diffusion Controller: Framework, Algorithms and Parameterization [54.82539154511621]
  We present a unified control-theoretic view that casts reverse diffusion sampling as state-only control within (generalized) linearly-solvable Markov Decision Processes.<n>Under this framework, control acts by reweighting the pretrained reverse-time transition kernels, balancing terminal objectives against an $f$-divergence cost.<n>Experiments on Stable Diffusion v1.4 show consistent gains in preference-alignment win rates and improved quality-efficiency trade-offs.
  arXiv  Detail & Related papers  (2026-03-07T01:49:59Z)
• Comparing and correcting robustness metrics for quantum optimal control [1.6927349660459692]
  We present a novel, systematic study demonstrating important numerical differences between adjoint end-point and toggling-frame approaches.<n>We also introduce a critical discretization correction to the widely-used robustness-frame estimator.<n>Our approach uniquely handles control and fidelity constraints while cleanly isolating robustness for dedicated optimization.
  arXiv  Detail & Related papers  (2026-02-10T22:44:16Z)
• Intelligent Control of Collisional Architectures for Deterministic Multipartite State Engineering [0.0]
  We introduce an intelligent, constraint-aware control framework for deterministic generation of symmetric Dicke states $|D_n(m)rangle$ in repeated excitation-within-interaction architectures.<n>The protocol employs partialSWAP collisions between two disjoint qubit registers, mediated by $m$ ancillary shuttle'' qubits, and poses Dickestate preparation as a emph-loop design problem.
  arXiv  Detail & Related papers  (2026-02-09T11:15:32Z)
• E-Globe: Scalable $ε$-Global Verification of Neural Networks via Tight Upper Bounds and Pattern-Aware Branching [9.161865803917847]
  Formal verification provides robustness guarantees, but current methods face a scalability-completeness trade-off.<n>We propose a hybrid verifier that efficiently tightens both upper and lower bounds until an $-$global optimum is reached or early stop is triggered.
  arXiv  Detail & Related papers  (2026-02-04T21:42:29Z)
• Constraint-Aware Discrete-Time PID Gain Optimization for Robotic Joint Control Under Actuator Saturation [18.71390061417015]
  Practical loops deviate from continuous-time theory due to discrete-time execution, actuator saturation, and small delays and measurement imperfections.<n>We present an implementation-aware analysis and tuning workflow for saturated discrete-time joint control.
  arXiv  Detail & Related papers  (2026-01-26T16:11:05Z)
• Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs [56.246783503873225]
  This paper revisits the weighted strategy for non-stationary parametric bandits.<n>We propose a simpler weight-based algorithm that is as efficient as window/restart-based algorithms.<n>Our framework can be used to improve regret bounds of other parametric bandits.
  arXiv  Detail & Related papers  (2026-01-03T04:50:21Z)
• Exploration in the Limit [37.0278529107694]
  We introduce a relaxed formulation that requires valid error control with respect to a minimum sample size.<n>This aligns with many real-world settings that often involve weak signals, high desired significance, and post-experiment inference requirements.<n>We develop a novel, anytime-valid confidence sequences over arm indices, and we use it to design a new BAI algorithm for our framework.
  arXiv  Detail & Related papers  (2025-12-31T19:27:59Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Best Arm Identification with Minimal Regret [55.831935724659175]
  Best arm identification problem elegantly amalgamates regret minimization and BAI. Agent's goal is to identify the best arm with a prescribed confidence level. Double KL-UCB algorithm achieves optimality as the confidence level tends to zero.
  arXiv  Detail & Related papers  (2024-09-27T16:46:02Z)
• Achieving the Pareto Frontier of Regret Minimization and Best Arm Identification in Multi-Armed Bandits [91.8283876874947]
  We design and analyze the BoBW-lil'UCB$(gamma)$ algorithm. We show that (i) no algorithm can simultaneously perform optimally for both the RM and BAI objectives. We also show that BoBW-lil'UCB$(gamma)$ outperforms a competitor in terms of the time complexity and the regret.
  arXiv  Detail & Related papers  (2021-10-16T17:52:32Z)
• On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization [55.937424268654645]
  We consider algorithm-independent lower bounds for the problem of black-box optimization of functions having a bounded norm. We provide a novel proof technique for deriving lower bounds on the regret, with benefits including simplicity, versatility, and an improved dependence on the error probability.
  arXiv  Detail & Related papers  (2020-08-20T03:48:14Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.