Abstract The noisy nature of quantum hardware necessitates the implementation of high-fidelity quantum gates in a noise-insensitive manner. While there exist many powerful methods for designing dynamically corrected gates (DCGs), they often use a single cost function to simultaneously achieve a target gate and suppress noise. This can lead to unnecessary tradeoffs that lower gate fidelities and complicate the discovery of globally-optimal solutions. Here, we present a method for single-qubit DCGs called Bézier Ansatz for Robust Quantum (BARQ) control to address these challenges. Rather than numerically optimizing the controls directly, BARQ instead makes use of the Space Curve Quantum Control formalism in which the quantum evolution is mapped to a geometric space curve. In the formulation used by BARQ, the boundary conditions of the space curve dictate the target gate while its shape determines the gate’s noise sensitivity. We eliminate the aforementioned tradeoffs by employing a control-point parameterization that allows the target gate to be fixed upfront and use numerical optimization only for noise-robustness. BARQ introduces a global perspective into the control landscape and provides ample freedom to design experimentally friendly and robust control pulses. The pulse design is facilitated through the developed software package qurveros .
Abstract The noisy nature of quantum hardware necessitates the implementation of high-fidelity quantum gates in a noise-insensitive manner. While there exist many powerful methods for designing dynamically corrected gates (DCGs), they often use a single cost function to simultaneously achieve a target gate and suppress noise. This can lead to unnecessary tradeoffs that lower gate fidelities and complicate the discovery of globally-optimal solutions. Here, we present a method for single-qubit DCGs called Bézier Ansatz for Robust Quantum (BARQ) control to address these challenges. Rather than numerically optimizing the controls directly, BARQ instead makes use of the Space Curve Quantum Control formalism in which the quantum evolution is mapped to a geometric space curve. In the formulation used by BARQ, the boundary conditions of the space curve dictate the target gate while its shape determines the gate’s noise sensitivity. We eliminate the aforementioned tradeoffs by employing a control-point parameterization that allows the target gate to be fixed upfront and use numerical optimization only for noise-robustness. BARQ introduces a global perspective into the control landscape and provides ample freedom to design experimentally friendly and robust control pulses. The pulse design is facilitated through the developed software package qurveros .
Quantum computers can significantly speed up the solution of certain classical tasks and even provide solutions to problems that are classically intractable. However, achieving this requires a fault-tolerant architecture with components and quantum operations (gates) whose physical error rates are below a specific threshold. Advanced quantum control methods can suppress environmental noise and implement below-threshold gates, but there are infinitely many ways to do so. These methods can rely entirely on analytical solutions or combine them with numerical optimization, where pulse properties are treated as optimization goals. Analytical constraints are always met exactly, but numerically optimized goals may only be satisfied approximately, leading to tradeoffs. Therefore, a modular analytical framework is needed that fixes some objectives in advance while optimizing only a selected subset. In this dissertation, I employ Space Curve Quantum Control (SCQC), a method that generates noise-resistant quantum gates using differential geometry. In SCQC, a space curve's global geometric properties dictate the gate's noise-robustness, while the controls that realize it are extracted from its local quantities. The first part of the dissertation is devoted to extending SCQC for arbitrary and simultaneous noise suppression, with experimentally-friendly pulses. I first derive the geometric conditions and curve examples for suppressing two separate noise types simultaneously. Then, I extend SCQC by deriving the adjoint representation equations of the associated quantum evolution. This allows one to describe the entire control design in terms of space curve elements and propose a systematic control design approach called the Bézier Ansatz for Robust Quantum (BARQ) control method. BARQ can encode the target gate upfront and allow optimization only for noise-robustness properties. This approach solves the usually unavoidable tradeoff between gate fidelity and noise-sensitivity and is capable of producing control pulses with experimentally-friendly features. The second part of the dissertation applies BARQ in two leading qubit modalities. I first describe my participation in experiments on IBM's superconducting devices, where doubly-robust BARQ pulses demonstrate at least one order-of-magnitude error reduction in the presence of engineered noise. The second platform is a four-qubit trapped-ion register hosted in the Quantum Scientific Computing Open User Testbed (QSCOUT) ecosystem. I show that utilizing BARQ pulses can reduce gate errors up to two times and effectively combat motion-induced decoherence.
Implementing high-fidelity quantum control and suppressing the unwanted environmental noise has been one of the essential challenges in developing quantum information technologies. In the past, driving pulse sequences based on Dirac delta functions or square wave functions, such as Hahn spin echo or CPMG, have been developed to dynamically correcting the noise effects. However, implementing these ideal pulses with high fidelity is a challenging task in real experiments. In this thesis, we provide a new and simple method to explore the entire solution space of driving pulse shapes that suppress environmental noise in the evolution of the system. In this method, any single-qubit phase gate that is first-order robust against quasi-static transversal noise corresponds to a closed curve on a two-dimensional plane, and more general first-order robust single-qubit gates correspond to closed three-dimensional space curves. Second-order robust gates correspond to closed curves having the property that their projection onto any two-dimensional planes shall enclose a zero net area. The driving pulse shapes that implement the gates can be determined by the curvature, torsion, and the length of the curve. By utilizing the framework it is possible to obtain globally optimal solutions in pulse shaping in respect of experimental constraints by mapping them into geometrical optimization problems. One such problem we solved is to prove that the fastest possible single-qubit phase gates that are second-order noise-resistant shall be implemented using sign-flipping square functions. Since square waves are not experimentally feasible, we provide a method to smooth these pulses with minimal loss in gate speed while maintaining the robustness, based on the geometrical framework. This framework can also be useful in diagnosing the noise-cancellation properties of pulse shapes generated from numerical methods such as GRAPE. We show that this method for pulse shaping can significantly improve the fidelity of single-qubit gates through numerical simulation.
Implementing high-fidelity quantum control and reducing the effect of the coupling between a quantum system and its environment is a major challenge in developing quantum information technologies. Here, we show that there exists a geometrical structure hidden within the time-dependent Schr\"odinger equation that provides a simple way to view the entire solution space of pulses that suppress noise errors in a system's evolution. In this framework, any single-qubit gate that is robust against quasistatic noise to first order corresponds to a closed three-dimensional space curve, where the driving fields that implement the robust gate can be read off from the curvature and torsion of the space curve. Gates that are robust to second order are in one-to-one correspondence with closed curves whose projections onto three mutually orthogonal planes each enclose a vanishing net area. We use this formalism to derive examples of dynamically corrected gates generated from smooth pulses. We also show how it can be employed to analyze the noise-cancellation properties of pulses generated from numerical algorithms such as grape. A similar geometrical framework exists for quantum systems of arbitrary Hilbert space dimension.
Noise-induced gate errors remain one of the main obstacles to realizing a broad range of quantum information technologies. Dynamical error suppression using carefully designed control schemes is critical for overcoming this challenge. Such schemes must be able to correct against multiple noise sources simultaneously afflicting a qubit to reach error-correction thresholds. Here we present a general framework for designing control fields that simultaneously suppress both noise in the fields themselves as well as transverse dephasing noise. Using the recently developed space curve quantum control formalism, in which robust quantum evolution is mapped to closed geometric curves in a multidimensional Euclidean space, we derive the minimal conditions necessary to guarantee the simultaneous cancellation of both types of noise to leading order. In particular, we find that the cancellation of control field noise requires the derivative of the space curve to have zero-area projections, which is a much more subtle property compared to the closed-curve condition needed to suppress transverse dephasing. We present several techniques for solving both these conditions simultaneously and provide explicit examples of error-resistant control fields. Our work also sheds light on the relation between holonomic evolution and the suppression of control field errors.
High-fidelity entangling gates are essential for quantum computation. Currently, most approaches to designing such gates are based either on simple, analytical pulse waveforms or on ones obtained from numerical optimization techniques. In both cases, it is typically not possible to obtain a global understanding of the space of waveforms that generate a target gate operation, which can make it challenging to identify globally time-optimal waveforms that respect amplitude and bandwidth constraints. Here, we show that in the case of weakly coupled qubits, it is possible to find all pulses that implement a target entangling gate in near-minimal time. We do this by mapping quantum evolution onto geometric space curves. We derive the minimal conditions these curves must satisfy in order to guarantee a gate with a desired entangling power is implemented. Pulse waveforms are extracted from the curvatures of these curves. We illustrate our method by designing fast, cnot-equivalent entangling gates for silicon quantum dot spin qubits with fidelities exceeding 99 %. We show that fidelities can be further improved while maintaining low bandwidth requirements by using geometrically derived pulses as initial guesses in numerical optimization routines.
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.