The lack of ability to determine and implement accurately quantum optimal control is a strong limitation to the development of quantum technologies. We propose a digital procedure based on a series of pulses where their amplitudes and (static) phases are designed from an optimal continuous-time protocol for given type and degree of robustness, determined from a geometric analysis. This digitalization combines the ease of implementation of composite pulses with the potential to achieve global optimality, i.e., to operate at the ultimate speed limit, even for a moderate number of control parameters. We demonstrate the protocol on IBM's quantum computers for a single qubit, obtaining a robust transfer with a series of Gaussian or square pulses in a time T=382 ns for a moderate amplitude. We find that the digital solution is practically as fast as the continuous one for square subpulses with the same peak amplitudes.
The lack of ability to determine and implement accurately quantum optimal control is a strong limitation to the development of quantum technologies. We propose a digital procedure based on a series of pulses where their amplitudes and (static) phases are designed from an optimal continuous-time protocol for given type and degree of robustness, determined from a geometric analysis. This digitalization combines the ease of implementation of composite pulses with the potential to achieve global optimality, i.e., to operate at the ultimate speed limit, even for a moderate number of control parameters. We demonstrate the protocol on IBM's quantum computers for a single qubit, obtaining a robust transfer with a series of Gaussian or square pulses in a time T=382 ns for a moderate amplitude. We find that the digital solution is practically as fast as the continuous one for square subpulses with the same peak amplitudes.
The ability of pulse-shaping devices to generate accurately quantum optimal control is a strong limitation to the development of quantum technologies. We propose and demonstrate a systematic procedure to design robust digital control processes adapted to such experimental constraints. We show to what extent this digital pulse can be obtained from its continuous-time counterpart. A remarkable efficiency can be achieved even for a limited number of pulse parameters. We experimentally implement the protocols on IBM quantum computers for a single qubit, obtaining an optimal robust transfer in a time T = 382 ns.
Fastness and robustness are both critical in the implementation of high-fidelity gates for quantum computation, but in practice a trade-off has to be made between them. In this paper, we investigate the robust time-optimal control problem that aims at the best balance. Based on the Taylor expansion of the system in terms of uncertainty parameters, we formulate the design problem as the optimal control of an augmented finite-dimensional system at its quantum speed limit (QSL), where the robustness is graded by the order of series truncation. The gradient-descent algorithm is then introduced to sequentially seek QSLs corresponding to different orders of robustness. Numerical simulations are carried out for single-qubit systems with frequency and field amplitude uncertainties, and the obtained time-optimal control pulses can effectively suppress gate errors to the prescribed robustness order. These results provide a practical guide for selecting pulse lengths in the pulse-level compilation of quantum circuits.
High-fidelity quantum gates are a central requirement for fault-tolerant quantum computation, yet their implementation is limited by the sensitivity of qubits to environmental noise and by control non-idealities. To mitigate these effects, quantum gates can be designed as dynamically corrected gates (DCGs), where control sequences are engineered to suppress the impact of errors on the resulting operation. Many methods in the literature are able to synthesize DCGs, but they typically rely on numerical optimization, with synthesis times on the order of minutes per gate. Here, we propose an automated semi-analytical method that reduces this cost by orders of magnitude, synthesizing smooth, robust control pulses in tens of milliseconds rather than minutes, with comparable fidelity and robustness. Our approach is based on the Space Curve Quantum Control (SCQC) formalism, where quantum evolution is mapped onto a geometric space curve whose geometric properties determine the target gate and its robustness. We parameterize the curve in the Frenet-Serret frame and employ the Pontryagin Maximum Principle (PMP) to design controls that are robust against both amplitude and dephasing errors. The PMP is formulated as a boundary-value problem and solved using a shooting method. The Frenet-Serret frame is integrated using Rodrigues' formula. Starting from a reference solution, we gradually vary the target rotation angle to construct a library of solutions, whose interpolation provides initial guesses for the shooting parameters of new target gates. We evaluated the method on 2,000 single-qubit rotations, obtaining a mean local optimization time of 39.945 ms per gate after preparation of the interpolation base. Quantum propagation yielded nominal gate infidelities below 10^-9 after virtual phase correction, with verified robustness against quasistatic amplitude and dephasing errors.
Efficient adiabatic control schemes, where one steers a quantum system along an adiabatic path ensuring minimal excitations while achieving a desired final state, that enable fast, high-fidelity operations are essential for any practical quantum computation. However, current optimization protocols are not universally tractable due to stringent requirements imposed by the microscopic systems encoding the qubit, including complex energy level structures and unwanted transitions, and generally require a trade-off between speed and fidelity of the operation. Here, we address these challenges by developing a general framework for optimal control based on the quantum metric tensor. This framework allows for fast and high-fidelity adiabatic pulses, even for a dense energy spectrum, based solely on the Hamiltonian of the system instead of the time evolution propagator and independent of the size of the underlying Hilbert space. Furthermore, our framework suppresses diabatic transitions and state-dependent crosstalk effects without the need for additional control fields. As an example, we study the adiabatic charge transfer in a double quantum dot to find optimal control pulses with improved performance. We show that for the geometric protocol, the transfer fidelities are lower bounded F>99% for ultrafast $20~\mbox{ns}$ pulses, regardless of the size of the anti-crossing, while being robust against miscalibration errors and quasistatic noise.
Abstract Precise control of quantum systems is one of the most important milestones for achieving practical quantum technologies, such as computation, sensing, and communication. Several factors deteriorate the control precision and thus their suppression is strongly demanded. One of the dominant factors is systematic errors, which are caused by discord between an expected parameter in control and its actual value. Error-robust control sequences, known as composite pulses, have been invented in the field of nuclear magnetic resonance (NMR). These sequences mainly focus on the suppression of errors in one-qubit control. The one-qubit control, which is the most fundamental in a wide range of quantum technologies, often suffers from detuning error. As there are many possible control sequences robust against the detuning error, it will practically be important to find ‘optimal’ robust controls with respect to several cost functions such as time required for operation, and pulse-area during the operation, which corresponds to the energy necessary for control. In this paper, we utilize the Pontryagin’s maximum principle (PMP), a tool for solving optimization problems under inequality constraints, to solve the time and pulse-area optimization problems. We analytically obtain pulse-area optimal controls robust against the detuning error. Moreover, we found that short-CORPSE, which is the shortest known composite pulse so far, is a probable candidate of the time optimal solution according to the PMP. We evaluate the performance of the pulse-area optimal robust control and the short-CORPSE, comparing with that of the direct operation.
Achieving high-fidelity control of quantum systems is essential for realization of a practical quantum computer. Composite pulse sequences which suppress different types of errors can be nested to suppress a wide variety of errors but the result is often not optimal, especially in the presence of constraints such as bandwidth limitations. Robust smooth pulse shaping provides flexibility but obtaining such analytical pulse shapes is a nontrivial problem and choosing the appropriate parameters typically requires a numerical search in a high-dimensional space. In this work, we extend a previous analytical treatment of robust smooth pulses to allow the determination of pulse parameters without numerical search. We also show that the problem can be reduced to a set of coupled ordinary differential equations which allows for a more streamlined numerical treatment.