Quantum control is essential for quantum information science and technology, yet designing high-fidelity control protocols remains challenging due to complex optimization landscapes, hardware noise, and long pulse sequences. Existing numerical solvers often require problem-specific engineering and produce opaque control amplitudes, while naive large language models (LLMs) lack the physical consistency and long-horizon precision for reliable quantum control synthesis. Here we introduce VF-QCTRL, a physics-informed large language model framework for general quantum control that combines symbolic reasoning with optimization to propose analytic control ansätze and coherently refine their parameters through feedback. To systematically evaluate LLM-driven quantum control, we develop QCTRL-BENCH, a benchmark spanning sixteen tasks across single- and multi-qubit systems, closed and open quantum dynamics, noiseless and noisy settings, and both analytic and numerical protocols. Across the benchmark, VF-QCTRL demonstrates strong universality, accuracy, efficiency, and interpretability: it applies to generic quantum control systems without task-specific training, achieves performance competitive with or exceeding state-of-the-art conventional solvers in both noiseless and noisy regimes with query efficiency, exhibits favorable inference-time scaling and pulse resolution scaling, and derives physically interpretable analytical protocols directly from prompts. Our results establish physics-informed LLM-based quantum control as a promising paradigm for accurate, efficient, interpretable, and training-free quantum control protocol design across a broad range of quantum systems.
Quantum control is essential for quantum information science and technology, yet designing high-fidelity control protocols remains challenging due to complex optimization landscapes, hardware noise, and long pulse sequences. Existing numerical solvers often require problem-specific engineering and produce opaque control amplitudes, while naive large language models (LLMs) lack the physical consistency and long-horizon precision for reliable quantum control synthesis. Here we introduce VF-QCTRL, a physics-informed large language model framework for general quantum control that combines symbolic reasoning with optimization to propose analytic control ansätze and coherently refine their parameters through feedback. To systematically evaluate LLM-driven quantum control, we develop QCTRL-BENCH, a benchmark spanning sixteen tasks across single- and multi-qubit systems, closed and open quantum dynamics, noiseless and noisy settings, and both analytic and numerical protocols. Across the benchmark, VF-QCTRL demonstrates strong universality, accuracy, efficiency, and interpretability: it applies to generic quantum control systems without task-specific training, achieves performance competitive with or exceeding state-of-the-art conventional solvers in both noiseless and noisy regimes with query efficiency, exhibits favorable inference-time scaling and pulse resolution scaling, and derives physically interpretable analytical protocols directly from prompts. Our results establish physics-informed LLM-based quantum control as a promising paradigm for accurate, efficient, interpretable, and training-free quantum control protocol design across a broad range of quantum systems.
We address a wide spectrum of quantum control strategies, including various open-loop protocols and advanced adaptive methods. These methodologies apply to few-qubit scenarios and naturally scale to larger N-qubit systems. We benchmark them across fundamental quantum tasks: entanglement preservation/generation, and directed quantum transport in a disordered quantum walk. All simulations are performed in a challenging environment featuring non-Markov colored noise, imperfections, and the Markov Lindblad equation. With a complex task-dependent performance hierarchy, our deterministic protocols proved highly effective for entanglement generation/preservation, and in specific pulse configurations, they even outperformed the RL-optimization. In contrast, more advanced methods demonstrate a marked specialization. For entanglement preservation, a physics-informed hybrid Quantum Error Correction and Dynamical Decoupling (QEC-DD) protocol provides the most stable and effective solution, outperforming all other approaches. Conversely, for dynamic tasks requiring the discovery of non-trivial control sequences, such as DD, Floquet engineering, and rapid entanglement generation or coherent transport, the model-free Reinforcement Learning (RL) agents consistently find superior solutions. We further demonstrate that the control pulse envelope is a non-trivial factor that actively shapes the control landscape, which determines the difficulty for all protocols and highlights the adaptability of the RL agent. We conclude that no single strategy is universally dominant. A clear picture emerges: the future of high-fidelity quantum control lies in a synthesis of physics-informed design, as exemplified by robust hybrid methods, and the specialized, high-performance optimization power of adaptive machine learning.
Quantum optimal control (QOC) underpins adiabatic quantum computation, quantum annealing, and quantum state engineering, yet practical deployment is fundamentally bottlenecked by strict hardware constraints and substantial expert effort required to design protocols for each problem instance. To overcome this, we introduce QOC-Workbench, an auditable, large language model (LLM)-driven workflow that acts as an automated quantum co-scientist for cross-paradigm protocol design. Going beyond traditional numerical optimizers that merely tune parameters within a fixed formula, the LLM autonomously parses physics literature, proposes structural hypotheses, and writes code to validate them by direct simulation. This workflow supports cross-paradigm design by accumulating control motifs across tasks. We demonstrate this approach across three distinct settings: Case 1, Rydberg-atom maximum-independent-set arrays; Case 2, interacting XXZ spin chains; and Case 3, random transverse-field Ising models. In Cases 1 and 2, the workflow autonomously discovers hardware-compliant auxiliary controls, target catalysts, and schedule deformations that outperform literature baselines. In Case 3, it addresses the computational bottleneck of variational counterdiabatic driving by escalating from per-instance optimization to an amortized graph-neural-network generator, successfully transferring learned coefficient paths to larger unseen systems. By actively bridging the gap between theoretical algorithms and experimental restrictions across distinct control paradigms and Hamiltonian families, QOC-Workbench establishes a continuously evolving, cross-paradigm methodology for autonomous quantum control.
Abstract We present Quantum2Prompt , a cross-modal framework that reformulates quantum circuits as structured language prompts, enabling large language models (LLMs) to estimate outcomes of the Variational Quantum Linear Solver (VQLS). Instead of relying on iterative quantum--classical loops with repeated measurements, Quantum2Prompt translates gate sequences, control--target relations, and rotation parameters into compact textual descriptions that preserve circuit semantics while remaining hardware-agnostic. An LLM-based regressor consumes these descriptions to produce real-valued residual estimates, transforming VQLS outcome prediction into a prompt-to-residual regression task. Extensive experiments across Toeplitz, Laplacian, and sparse matrix families show that Quantum2Prompt achieves up to (R2=0.99) and MSE = 0.0026 , substantially outperforming classical baselines such as Random Forest, SVR, and LightGBM. Ablation and noise-robustness analyses further demonstrate that combining circuit text, rotation parameters, and optimization-step features yields the most accurate and noise-resilient predictions. Beyond empirical gains, we contribute the first benchmark dataset aligning VQLS circuits, textual encodings, and residual labels, enabling reproducible evaluation and hybrid quantum--language workflows. These results suggest that LLMs can serve as efficient, interpretable surrogates for variational solvers, paving the way toward language-driven quantum algorithm design and performance prediction.The full dataset and implementation are publicly available for reproducibility.
Can Large Language Models (LLMs) understand and reason about quantum operators? Despite their remarkable capabilities in mathematics and symbolic reasoning, LLMs remain inherently blind to quantum representations such as unitary matrices. In this work, we take a step toward bridging this gap by introducing an approach that maps unitary operators into the latent space of an LLM, enabling unified modeling over quantum and linguistic inputs. We instantiate this idea on Clifford+T circuit synthesis over a Pauli rotation gate set, where our model achieves results competitive with state-of-the-art methods and scales consistently with training data, with no signs of saturation. Our approach further enables language-conditioned synthesis, allowing gate constraints unseen during training to be specified directly in natural language. This work suggests a path toward quantum--aware foundation models that can natively interpret and reason about quantum operations, which could have broader implications reaching across quantum compilation and algorithm discovery.
Quantum computers promise massive computational speedup for problems in many critical domains, such as physics, chemistry, cryptanalysis, healthcare, etc. However, despite decades of research, they remain far from entering an era of utility. The lack of mature software, architecture, and systems solutions capable of translating quantum-mechanical properties of algorithms into physical state transformations on qubit devices remains a key factor underlying the slow pace of technological progress. The problem worsens due to significant reliance on domain-specific expertise, especially for software developers, computer architects, and systems engineers. To address these limitations and accelerate large-scale high-performance quantum system design, we ask:
Can large language models (LLMs) help with solving quantum software, architecture, and systems problems?
In this work, we present a case study assessing the performance of LLMs on quantum system reasoning tasks. We evaluate nine frontier LLMs and compare their performance to graduate UT Austin students on a set of quantum computing problems. Finally, we recommend several directions along which research and engineering development efforts must be pursued.
Large language models (LLMs) show strong capabilities in general reasoning but typically lack reliability in scientific domains like quantum mechanics, which demand strict adherence to physical constraints. This limitation arises from the scarcity of verifiable training resources and the inadequacy of coarse feedback signals in standard alignment paradigms. To address the data challenge, we introduce QuantumQA, a large-scale dataset constructed via a task-adaptive strategy and a hybrid verification protocol that combines deterministic solvers with semantic auditing to guarantee scientific rigor. Building on this foundation, we propose the verification-aware reward model (VRM) tailored for Reinforcement Learning with Verifiable Rewards (RLVR), which employs an adaptive reward fusion (ARF) mechanism to dynamically integrate deterministic signals from a scientific execution suite (SES) with multidimensional semantic evaluations for precise supervision. Experimental results demonstrate that our method consistently outperforms baselines and general-purpose preference models. Notably, our optimized 8B model achieves performance competitive with proprietary models, validating that incorporating verifiable, rule-based feedback into the reinforcement learning loop offers a parameter-efficient alternative to pure scaling.