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 \((R^2 = 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.
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 ((R^2 = 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.
The design of high performing quantum circuits remains largely dependent on human expertise. We introduce an autonomous agentic framework that employs large language models (LLMs) to conduct iterative quantum circuit designs under explicit design constraints. Our system integrates seven components: Exploration, Generation, Discussion, Validation, Storage, Evaluation, and Review. These components form a closed-loop workflow that combines web-based knowledge acquisition, literature-grounded critique, executable code generation, and experimental feedback. We evaluate the framework on two tasks: quantum feature map construction for quantum machine learning and ansatz generation for variational quantum eigensolver applications in quantum chemistry. In image classification benchmarks, the best generated feature map outperforms representative quantum feature maps and, when scaled to larger qubit counts, surpasses the classical radial basis function kernel. In molecular ground state estimation across seven molecules, the generated ansatz attains competitive accuracy with widely used chemically inspired and hardware-efficient constructions while satisfying the imposed scaling constraints. These results establish LLM driven agentic system as a viable paradigm for automated quantum circuit design and illustrate how AI systems can participate in iterative scientific optimization workflows across scientific domains.
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.
Variational quantum algorithms (VQAs) optimize circuit angles through repeated quantum-device evaluations, often facing vanishing gradients and high optimization costs. We ask whether a large language model (LLM) can write these angles directly. Extending *weight-space programming* from classical networks to quantum circuits, we provide a frontier LLM (\gpt) with the problem, circuit, and gate conventions. Its angles are executed exactly as written, without returning losses, gradients, or accuracy feedback. Across 139 requests, we test handwritten-digit classification, VQE ground-state estimation for spin chains and H2, and MaxCut QAOA, comparing against random weights, classical optimization, and optimization initialized with LLM weights on the same circuit. When parameters have interpretable structure, the LLM matches or approaches the optimizer: it achieves 95--100\% of the energy spectrum on every VQE problem, derives the exact H2 ground state in closed form, finds optimal depth-one QAOA angles for every graph, and reaches 93--96\% accuracy on digits 3 versus 8 with 12--18 hand-written weights, outperforming an optimizer trained on the same ten examples. Its weights are also strong warm starts: optimization reaches its best value after a median of one evaluation rather than hundreds. Allowed to design circuits, the LLM chooses data-dependent rotation chains encoding pixel importance in all 30 cases (one qubit for binary tasks, one chain per qubit for ten classes), reaching 65\% accuracy across ten digits. Yet the approach fails in opaque weight spaces: accuracy drops to chance when fixed circuits exceed 30 weights, while optimization improves. It is also sensitive to gate conventions: 6 of 42 QAOA replies reverse mixing-angle signs and fail. We release all prompts, replies, and scores.
Abstract Variational quantum linear solvers (VQLSs) are a promising class of hybrid quantum--classical algorithms for solving linear systems on near-term quantum devices. However, the performance of VQLSs is often impeded by barren plateaus, particularly when using randomly initialized variational quantum circuits (VQCs). To mitigate this issue, we propose \textit{PVLS}, a GNN-based parameter initialization framework that improves both convergence speed and final solution quality. By reformulating the linear system Ax=b as a graph with A encoded in the edges and b as node features, PVLS learns to predict effective initial VQC parameters. Our method is trained on thousands of randomly generated matrices with varying dimensions (n∈[4,10]), using optimized VQC parameters as ground-truth labels. On unseen test instances, PVLS reduces the initial cost by an average of 81.3\% and the final loss by 71\% compared to random initialization. PVLS also accelerates convergence, reducing the number of optimization steps by more than 60\% on average. We further evaluate PVLS on ten real-world sparse matrices, demonstrating its generalization capability and robustness. Our results highlight the utility of machine-learned priors in improving the trainability of VQLSs and alleviating optimization challenges in variational quantum algorithms.
The Variational Quantum Linear Solver (VQLS), a hybrid quantum-classical algorithm for solving linear systems, faces a practical scalability bottleneck: the Linear Combination of Unitaries (LCU) decomposition requires O(L2) circuit evaluations per optimizer iteration, where L can grow to 4n in the worst case for an n-qubit system. We address this computational bottleneck through two complementary strategies. First, we present a distributed VQLS (D-VQLS) framework (https://code.ornl.gov/olcf-qcfd/DVQLS.git), built on NVIDIA CUDA-Q, that enables asynchronous, scalable distribution of the O(L2) cost evaluations. Second, a fast Walsh--Hadamard transform (FWHT)-based Pauli decomposition with coefficient-amplitude pruning threshold τ=0.01 curbs LCU growth for the structured Toeplitz family, reducing L from O(2n) to 64 for n>6 and compressing the circuit complexity per optimizer iteration from O(n4n) to O(n). We derive the exact top-L Frobenius error and connect it to worst-case solution error. For a 10-qubit tridiagonal Toeplitz system, the L=64 pruning yields a 256× reduction---from 23 million to 90k circuits per optimizer iteration.
The D-VQLS framework is validated on the NERSC Perlmutter supercomputer using multi-node, multi-GPU ideal state-vector simulations, achieving over 99.99% fidelity against classical solutions on tridiagonal Toeplitz and Hele--Shaw flow benchmarks, with near-ideal strong scaling up to 24 GPUs and 95.3% weak scaling efficiency at 96 GPUs processing more than 360k circuits per optimizer iteration (from larger-L pruning) for the 10-qubit system. Systematic profiling identifies the optimal resource allocation for distributed quantum circuit workloads, yielding a 2.52× speedup for the configurations studied.
Large language models (LLMs) have recently demonstrated the ability to generate parameters for variational quantum circuits without conventional optimization. However, the conditions under which this approach is effective remain unclear. Here, we investigate a frozen, general-purpose LLM that generates complete circuit parameter vectors from symbolic circuit and Hamiltonian descriptions, with optional iterative energy feedback. We evaluate the approach on general random Hamiltonians, structured parent Hamiltonians, and molecular systems. For general Hamiltonians, LLM-generated parameters exhibit larger energy errors than conventional Adam optimization, while additional feedback generally provides limited improvement. In contrast, for structured Hamiltonians, the LLM can generate promising low-energy parameter configurations, suggesting that identifiable physical and mathematical structure facilitates parameter inference. We also show that direct LLM predictions of minimum energies can violate the Hamiltonian spectral lower bound, whereas generated circuit parameters allow independent evaluation of physically realizable energy expectation values. Finally, we investigate blind circuit interpretation and find that the LLM can predict measurement outcomes even when it fails to identify the underlying quantum algorithm. These findings highlight the role of problem structure, the limitations of iterative LLM optimization, and the importance of independently verifiable predictions in quantum parameter programming.