High-fidelity control of quantum systems is essential for scalable quantum technologies. We introduce a shooting-based quantum optimal control algorithm for systems of finite-dimensional Hilbert spaces, and demonstrate its performances through numerical simulations on systems inspired from single molecule magnets. Our method efficiently decomposes quantum gates into selective electromagnetic pulses, outperforming the standard GRAPE method against which it is benchmarked, especially in larger Hilbert spaces
High-fidelity control of quantum systems is essential for scalable quantum technologies. We introduce a shooting-based quantum optimal control algorithm for systems of finite-dimensional Hilbert spaces, and demonstrate its performances through numerical simulations on systems inspired from single molecule magnets. Our method efficiently decomposes quantum gates into selective electromagnetic pulses, outperforming the standard GRAPE method against which it is benchmarked, especially in larger Hilbert spaces
Most quantum processors requires pulse sequences for controlling quantum states. Here we present an alternative algorithm for computing an optimal pulse sequence so as to perform a specific task, being an implementation of a quantum gate or a quantum-state preparation. In our method, we reduce greatly the number of parameters to be fitted by using a limited number of functions as the modulations for the amplitude and phase of the radio-frequency pulses. Unlike other algorithms, ours uses some approximations to make it fast and scalable, and uses some efficient methods to obtain pulses that are robust to common types of experimental errors. We demonstrate the success of the proposed algorithm by performing several real experiments for 4-, 7-, and 12-quantum-bit systems using NMR. In addition, we show the efficiency of the algorithm, finding pulses for controlling with good fidelity the quantum states of spins in fictional square two-dimensional lattices containing 16, 36, and 100 qubits.
A central goal of quantum optimal control is to achieve high-fidelity and low-energy control pulses. When quantum optimal control methods optimize every point of a pulse discretized over small time steps independently this can yield high fidelity control but also results in broadband and energy-hungry waveforms. We extend MAGICARP, a shooting method inspired by Pontryagin's maximum principle on energy that generates an entire pulse from a small set of parameters, making it smooth and energy-efficient by construction, from driftless systems to closed systems with the constant drift Hamiltonian of two exchange-coupled spins in an external magnetic field. The optimization proceeds in stages: the dressed states of the drift Hamiltonian structure the target, an initial shooting optimization is performed in the rotating-wave frame, and an exact laboratory-frame refinement follows. Benchmarked against Krotov and GRAPE at matched gate infidelity, MAGICARP consistently achieves the lowest energy and a conserved pulse area, concentrates its spectral weight on the gate-relevant transitions, and is the most robust to fluctuations in the exchange coupling; GRAPE independently converges to essentially the same pulse while black-box Krotov meets the same error at an order-of-magnitude energy premium. This method-independence is what qualifies the bounded solver as a measurement instrument, and the central result follows: a large statistical survey of unselected optimization runs resolves a weak-driving quantum speed limit for two exchange-coupled electron spins: low-amplitude realizations of the two-qubit quantum Fourier transform cease to exist below a critical gate time, and the minimum control energy diverges on approach to this limit. The divergence obeys a simple two-parameter area--pole law, E2law(T)=A/T+B/(T−T∗).
The efficient implementation of quantum computing is contingent upon high-fidelity quantum operations. Nevertheless, the fidelity of these operations is constrained by the precision of quantum system evolution control. The optimization of quantum control pulses is essential for improving the manipulation accuracy of superconducting qubits. Traditional optimization methods, including gradient descent and the gradient ascent pulse engineering algorithm, frequently encounter challenges such as slow convergence and susceptibility to local optima in pulse optimization problems. This study introduces an adaptive open-loop optimization algorithm based on the adaptive moment estimation (Adam) optimizer, capitalizing on the benefits of momentum and adaptive learning rate adjustments inherent in Adam. We conduct experimental analysis on the algorithm’s hyperparameters to achieve optimal solutions with a higher fidelity range at a faster convergence speed, effectively improving the fidelity and optimization efficiency of quantum gate operations. Through numerical simulations on the QuTiP platform, we validate the excellent performance of the Adam algorithm in quantum gate optimization. In optimizing the X and SWAP gates, its fidelity improved by 0.03% and 0.0016%, respectively, compared to the GRAPE algorithm. Compared to the CRAB method, the initial convergence speed of the Adam method increased fivefold, enabling it to achieve the target fidelity more rapidly. Future research will investigate closed-loop optimization strategies, utilizing feedback derived from the fidelity results of actual quantum computers to further augment quantum control performance
Dynamically correcting for unwanted interactions between a quantum system and its environment is vital to achieving the high-fidelity quantum control necessary for a broad range of quantum information technologies. In recent work, we uncovered the complete solution space of all possible driving fields that suppress transverse quasistatic noise errors while performing single-qubit phase gates. This solution space lives within a simple geometrical framework that makes it possible to obtain globally optimal pulses subject to a set of experimental constraints by solving certain geometrical optimization problems. In this work, we solve such a geometrical optimization problem to find the fastest possible pulses that implement single-qubit phase gates while canceling transverse quasistatic noise to second order. Because the time-optimized pulses are not smooth, we provide a method based on our geometrical approach to obtain experimentally feasible smooth pulses that approximate the time-optimal ones with minimal loss in gate speed. We show that in the presence of realistic constraints on pulse rise times, our smooth pulses significantly outperform sequences based on ideal pulse shapes, highlighting the benefits of building experimental waveform constraints directly into dynamically corrected gate designs.
An exquisite control over the dynamics of a quantum system is essential for realizing any quantum technology. This thesis presents some practical and efficient strategies for coherent quantum control: a paradigm for controlling quantum dynamics using electromagnetic fields. Coherent control is a common framework for describing the physical implementation of quantum logic gates in several quantum information processing platforms including superconducting qubits and trapped ions. For the purpose of demonstration, however, liquid-state Nuclear Magnetic Resonance (NMR) is used in this thesis as it is an ideal test-bed for developing, testing and benchmarking coherent control tools and techniques. Coherent control was revitalised in 2005 by the development of Gradient Ascent Pulse Engineering (GRAPE), a powerful optimal control technique that is widely used for designing shaped pulses for a variety of tasks. GRAPE, like any other closed-loop optimal control algorithm, requires multiple evaluations of the computationally expensive matrix exponential and the full time-evolution propagator. To this end, I present strategies to sidestep the explicit evaluation of matrix exponentials, thereby offering substantial speed-ups over conventional implementations of the GRAPE algorithm. The results are demonstrated experimentally in NMR, but also in simulations of ultracold molecules and superconducting qubits. Beyond GRAPE, this thesis also considers methods for designing spin-echo sequences for implementing any arbitrary network of controlled-Z gates in a system of qubits with zz-couplings. First, a method based on linear-programming provides near time-optimal sequences in fully-coupled systems having up to a few hundred qubits. Further, an analytic method based on graph colouring finds near time-optimal spin echo sequences in engineered systems with any number of qubits having only nearest and next-nearest neighbour-couplings.
We present a general method to quickly generate high-fidelity control pulses for any continuously-parameterized set of quantum gates after calibrating a small number of reference pulses. We find that interpolating between optimized control pulses for different quantum operations does not immediately yield a high-fidelity intermediate operation. To solve this problem, we propose a method to optimize control pulses specifically to provide good interpolations. We pick several reference operations in the gate family of interest and optimize pulses that implement these operations, then iteratively re-optimize the pulses to guide their shapes to be similar for operations that are closely related. Once this set of reference pulses is calibrated, we can use a straightforward linear interpolation method to instantly obtain high-fidelity pulses for arbitrary gates in the continuous operation space. We demonstrate this procedure on the three-parameter Cartan decomposition of two-qubit gates to obtain control pulses for any arbitrary two-qubit gate (up to single-qubit operations) with consistently high fidelity. Compared to previous neural network approaches, the method is 7.7x more computationally efficient to calibrate the pulse space for the set of all single-qubit gates. Our technique generalizes to any number of gate parameters and could easily be used with advanced pulse optimization algorithms to allow for better translation from simulation to experiment.