The open-loop optimization of quantum dynamics using gradient-based quantum optimal control methods involves calculating the time-ordered propagator and its gradient. In this Letter, we present a unifying framework for gradient-based quantum optimal control with respect to any general pulse parameterization by deriving the formal solution from first principles. For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients, significantly reducing the number of matrix exponentials needed to compute the gradient. The expansion highlights the connection between derivatives of the propagator and operator evolution in the Heisenberg picture. The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions, which is a common situation in large multi-qubit platforms. We compare the computational cost required for the series with the Gradient Optimization of Analytic conTrols (GOAT) method, and, focusing on the problem of preparation of a GHZ state, demonstrate more than an order of magnitude speedup for a qubit ladder and a chain geometry.
High-fidelity quantum control relies on accurate models of driven dynamics. We examine this re- quirement for single-qubit gates in superconducting transmons by comparing control pulses derived from the standard Duffing approximation and from a Hamiltonian constructed by diagonalizing the transmon eigenbasis. Using the same correction-pulse construction for both models, we show that correction fields derived from the Duffing approximation can substantially reduce the gate error pre- dicted by that model while remaining less effective when combined with an independently calibrated baseline pulse in the diagonalized-transmon model. In the fast-gate regime, such transferred correc- tions can even fail to improve over the uncorrected diagonalized-transmon baseline. We show that small model-dependent differences in both the energy spectrum and the representation of the drive operator can compound during driven evolution, resulting in different predicted error generators and correction pulses. A mismatch in the accumulated AC Stark phase provides one illustrative di- agnostic of this dynamical model dependence. We further demonstrate that the model Hamiltonian informs the choice of control framework: Omitting relevant leakage pathways or higher-order error channels can lead to an overly restricted correction strategy. Including these channels motivates an extended correction framework that improves the gate performance using the same physical control resources.
Precise control of multi-qubit architectures remains a critical bottleneck in superconducting quantum processors. In this work, we investigate the synthesis of high-fidelity quantum operations and state transfer protocols within an extended superconducting linear chain, scaling from three to seven sites. Using Floquet theory, we model the periodic drive as a train of delta-like pulses, mapping the quantum control problem onto quasi-energy resonance conditions. Combining the Baker-Campbell-Hausdorff expansion with Floquet spectral decomposition, we analytically identify optimal driving parameters, refined via the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). In the three-qubit architecture, this enables high-fidelity synthesis of the iSWAP gate. Extending to a seven-site chain, we implement periodic trains of finite-width Gaussian pulses to activate distinct double-excitation transport channels with ultra-short gate durations t_gate (~170 ns). This achieves a clear scale separation from energy-relaxation times (T1) typical of fixed-frequency transmon devices with tunable couplers, such as IBM Quantum hardware. Finally, we benchmark stability under realistic imperfections, revealing a heightened sensitivity to static parameter disorder at the sub-percent level (eta ~ 10^-3) driven by spectral crowding, and discuss how closed-loop topologies could mitigate this constraint. This framework bridges time-periodic control theory and practical quantum gate engineering.
A. De Luca, Carola Ciaramelletti, Simone Paganelli· 0 citations
In quantum optimal control theory, gradient-based trajectory optimization techniques have proven versatile in designing multi-qubit quantum gates. Furthermore, incorporating the underlying Lie-group structure can accelerate the optimization process. In this work, we adapt the Lie-group formulation of the iterative linear quadratic regulator (iLQR) to the special unitary group SU(N) and apply it to quantum gate synthesis, systematically comparing it against the standard Euclidean iLQR formulation across multiple two- to five-qubit gates. We find that in the idealized, unconstrained setting, where all Lie-algebra basis elements are available as drive Hamiltonian terms, the Lie-group formulation converges faster than the Euclidean iLQR formulation. If drive terms are constrained to 2-local Hamiltonian terms, the Lie-group variant converges faster in early optimization iterations, but exhibits greater sensitivity to initialization and a stronger tendency towards local minima. These results demonstrate that incorporating Lie-group geometry into iLQR substantially improves convergence and highlight important next steps for improvements in constrained control settings.
D. Heimann, Felix Wiebe, Elie Mounzer et al.· 0 citations
The quantum-selected configuration interaction identifies important determinantal basis functions through real-time evolution of a reference wavefunction and diagonalizing the Hamiltonian matrix in the resulting selected subspace. However, implementing the full electronic Hamiltonian on noisy quantum devices leads to rapidly increasing circuit complexity, limiting its scalability. To address this issue, we identify the dominant fermionic excitation operators and perform reference-state fidelity loss analysis to construct a compact Hamiltonian, reducing computational overhead while retaining high precision. Applied to Group IIIA monofluorides (BF, AlF, GaF, InF, and TlF), the proposed framework achieves a near-quadratic improvement in Hamiltonian-term scaling, enabling resource-efficient simulations. We employ this framework to compute the relativistic ground-state energies and permanent electric dipole moments (PDMs) of the systems under consideration. After validating the framework via simulations, we demonstrate hardware execution for AlF and TlF on the IBM Marrakesh processor using active spaces of up to 20 qubits. For a 20-qubit TlF system, the reduced Hamiltonian yields a reduction of higher than $ 98\%$ in both circuit depth and two-qubit gate counts, with the resulting PDMs from quantum hardware matching complete active space configuration interaction values within $99.99\%$. These results demonstrate the scalability of this approach on noisy intermediate-scale quantum devices.
Suprava Sahoo, Abdul Kalam, Kenji Sugisaki et al.· 0 citations
A protocol for approximating the measurement distributions of quantum states, extending beyond standard observable estimation is introduced, and tightened gate complexity bounds for practically relevant systems, including those with k-local interactions, long-tailed matrix ensembles, and conserved quantities are provided.
A. Mazumder, James D. Watson, Samson Wang· 0 citations
Electronic Hamiltonian simulation is commonly formulated by mapping fermionic operators to qubit operators and subsequently expanding the resulting ladder-operator products into Pauli strings. While general, this procedure obscures the higher-level fermionic structure and can hide opportunities for circuit optimization. Building on ladder-string-pair (Lasp) diagonalization originally developed for Hamiltonian simulation of partial differential equations, we construct time-evolution circuits for the second-quantized electronic Hamiltonian without performing a Pauli expansion. For the most general case of complex-valued coefficients, we present a time-evolution circuit for a two-body fermionic Lasp operator that corresponds to 16 Pauli strings in the Pauli-expansion approach but does not suffer from Trotter error at this stage. Expanding the optimization scope from a single operator to a triad of three fermionic Lasp operators sharing the same four spin-orbital indices enables systematic cancellation of CX gates, reducing the CX-gate count from 36 to 12 in the example considered, still without introducing Trotter error at this stage. For $n$ spin orbitals, further expanding the optimization scope to a sequence of $O(n)$ suitably ordered triads enables a cascade of CX-gate reductions across triad boundaries, reducing the CX-gate count from $O(n^2)$ to $O(n)$. The Lasp-based approach also naturally accommodates controlled time evolution and yields further optimizations for real-valued Hamiltonians. These results demonstrate that the Lasp-based approach enables more efficient time-evolution circuits by preserving high-level circuit structures and thereby expanding the scope of optimization, providing a systematic route toward more efficient electronic Hamiltonian simulation.
Tamiya Onodera, Takeshi Sato· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
