In this entry we provide a detailed overview of the specific in-built solutions for various single and multi-qubit operations implemented in Q-CTRL products. Details of the underlying physical controls may be found in the Control Hamiltonian and Control Operations entries.

## Single-Qubit Driven

The available schemes for implementing single qubit controls are described. In the presentation below $\tau$ denotes the total drive duration, $\Omega_\text{max}$ denotes the maximum single-qubit Rabi and we define $\tau_{\pi} = \pi/\Omega_\text{max}$ as the minimum time ($\pi$-time) for implementing a (primitive) single-qubit $\pi$ rotation .

### Benchmark Driven Control

#### Primitive

The primitive square control implementing a net $R(\theta,0)$ driven rotation is denoted $\text{PRIMITIVE($\theta$)}$. The control-space array is tabulated

### Control Error Compensating Driven Controls

#### BB1

The Wimperis broadband or BB1 sequence (see Wimperis, 1994 ) implementing a net $R(\theta,0)$ driven rotation is denoted $\text{BB1($\theta$)}$. The control-space array is tabulated

where

#### SCROFULOUS

The sequence called SCROFULOUS (Short Composite ROtation For Undoing Length Over and Under Shoot) (see Cummings, 2003 ), implementing a net $R(\theta,0)$ driven rotation is denoted $\text{SCROFULOUS($\theta$)}$. The control-space array is tabulated

where

#### SK1

The first-order Solovay-Kitaev sequence (see Brown, 2004 and Brown, 2005 ) implementing a net $R(\theta,0)$ driven rotation is denoted $\text{SK1($\theta$)}$. The control-space array is tabulated

where

### Dephasing Error Compensating Driven Controls

#### CORPSE

The sequence called CORPSE (compensating for off-resonance with a pulse sequence) (see Brando, 2003 ), implementing a net $R(\theta,0)$ driven rotation is denoted $\text{CORPSE($\theta$)}$. the control-space array is tabulated

where

#### WAMF1

The sequence called WAMF1 (first-order Walsh amplitude-modulated filter) (see Ball, 2015 ), implementing a net $R(\theta,0)$ driven rotation is denoted $\text{WAMF1($\theta$)}$. The control-space array is tabulated

This construction may be optimized by finding the minimum value of $\tau$ is found such to produce maximal suppression against dephasing noise.

### Dephasing and Control Error Compensating Driven Controls

#### CORPSEinBB1

The sequence called CORPSEinBB1 (CORPSE concatenated within BB1) (see Kabytayev, 2014 ), implementing a net $R(\theta,0)$ driven rotation is denoted $\text{CORPSEinBB1($\theta$)}$. The control-space array is tabulated

where

#### CORPSEinSCROFULOUS

The sequence called CORPSEinSCROFULOUS (CORPSE concatenated within a SCROFULOUS, i.e. each element of the SCROFULOUS is replaced by a CORPSE, see Brando, 2003 and Cummings, 2003 ), implementing a net $R(\theta,0)$ driven rotation is denoted $\text{CORPSEinSCROFULOUS($\theta$)}$. The control-space array is tabulated

where

and $\theta’ \in {\theta_1, \theta_2, \theta_3}$ are the SCROFULOUS angles:

#### CORSPEinSK1

The sequence called CORPSEinSK1 (CORPSE concatenated within SK1) (see Kabytayev, 2014 ), implementing a net $R(\theta,0)$ driven rotation is denoted $\text{CORPSEinSK1($\theta$)}$. The control-space array is tabulated

where

## Dynamical Decoupling Sequences

A Dynamic Decoupling Sequence (DDS) is canonically defined as a series of $n$-instantaneous unitary
operations, often $\pi$-pulses, executed at time *offsets*

over the time interval with a total *duration* $\tau$. We define a set of error-robust common DDS
below. In each case we use the notation $J_\theta$ to indicate an instantaneous unitary
which is a rotation of $\theta$ about the $J = X, Y$ or $Z$ axis. This is related to
DDS control format
variables
*rabi rotation* $\omega$, *azimuthal angle* $\phi$ and
*detuning rotation* $\delta$
as follows:

In practice all DDS typically have a $X_{\pi/2}$ operation at the start and finish. This is because it is assumed that the qubit is initially in the $|0\rangle$ state and a superposition needs to be created and removed to make the qubit sensitive to dephasing. For brevity, these operations are not included in any of the definitions below.

### Benchmark Dynamical Decoupling Sequences

#### Ramsey

The Ramsey DDS
is simply free evolution between the start and finish of the DDS. Technically, the Ramsey DDS does not dynamically decouple from the environment, nevertheless, it is a useful sequence for characterization and testing protocols and hence it is included. Ramsey DDS is parameterized by just the *duration* $\tau$ and contains no offsets in between the start and finish of the sequence.

### Dephasing Error Compensating Dynamical Decoupling Sequences

#### Spin Echo

The spin echo (SE) DDS
is
the simplest DDS. It is parameterized by *duration* $\tau$. There is a single $X_\pi$ unitary
operation at $t_1=\frac{\tau}{2}$.

#### Carr-Purcell

The Carr-Purcell (CP) DDS
is parameterized by the *number of offsets* $n$ and *duration* $\tau$.
The DDS is made up of a set of $X_\pi$ operations applied at

where $i=1 \cdots n$.

#### Carr-Purcell-Meiboom-Gill

The Carr-Purcell-Meiboom-Gill (CPMG) DDS has the same timing and number of offsets as a CP DDS,

where $i=1 \cdots n$. However, due to a $\pi/2$ phase shift between the initial and final phases, the operations are $Y_\pi$.

#### Uhrig

The Uhrig DDS
is parameterized by *duration* $\tau$ and *number of offsets* $n$. The Uhrig DDS is the application of $Y_\pi$ operations at offsets given by

where $i=1 \cdots n$.

#### Periodic

The periodic DDS
is parameterized by *duration* $\tau$ and *number of offsets* $n$. The periodic DDS is made of $X_\pi$ operations at offsets

where $i=1 \cdots n$.

#### Walsh

The Walsh DDS
is
parameterized by the *duration* $\tau$ and *paley order* $k$.
The Walsh DDS is made of $X_\pi$ operations at offsets defined by a $k$th order Walsh Function given by

The $j$th Rademacher function $R_j(.)$ is defined as

where $(b_m, b_{m-1}, \ldots, b_{0})$ is the binary representation of $k$ and $m$ is the index of most significant bit (hence $b_m=1$ by definition).

#### Quadratic

The Quadratic DDS
is
parameterized by *duration* $\tau$, *number of inner offsets* $n_1$ and *number of outer offsets* $n_2$.
The *outer sequence* consists of $n_2$ pulses of type $X_\pi$, which partition the time-domain into $n_2+1$ sub-intervals on which *inner sequences* consisting of $n_1$ pulses of type $Z_\pi$ are nested. The total number of offsets $n$ is $n = n_1+n_2(n_1+1)$.

The pulse times for outer sequence ($X_\pi^1,\ldots, X_\pi^{n_2}$) are defined according to the Uhrig DDS on the time-domain $t\in{0,\tau}$. The $j$th $X_\pi$ pulse, $X_\pi^{j}$, therefore has timing offset defined by

where $j=1 \cdots n_2$. On each sub-interval defined by the outer sequence, an inner sequence ($Z_\pi^1,\ldots, Z_\pi^{n_1}$) is implemented. The pulse times for the inner sequences are also defined according to Uhrig DDS. The $k$th $Z_\pi$ pulse of the $j$th inner sequence has timing offset defined by

where $k=1 \cdots n_1$ and $j=1 \cdots n_2+1$.

#### X and XY Concatenated

The $X$ or $XY$ concatenated DDS
are constructed by recursively concatenating DDS structures. They are parameterized by the *concatenation order* $l$ and the *duration* $\tau$ of the total sequence. Let the $l$th order of concatenation be denoted as $C_l(\tau)$. In this scheme, zeroth order concatenation of duration $\tau$ is defined as free evolution over a period of $\tau$. We use a notation of $1 (\tau)$ to mean free evolution over duration $\tau$. We define the base DSS to be:

The $l$th order X-CDD can be recursively defined as

XY-CDD is similarly defined by

## Two-Qubit Parametric Drive (iSWAP Subspace)

The available control solutions are described for implementing parametrically-driven two-qubit iSWAP gates . For notational simplicity the standard notation for control-coordinates is streamlined by replacing the subscripted symbols with the un-subscripted symbols:

In the presentation below, $\Lambda_\text{max}$ and $\Omega_\text{max}$ denote the maximum parametric coupling rate and maximum single-qubit Rabi respectively, and we define $\tau_\text{iSWAP} = \pi/\Lambda_\text{max}$ and $\tau_\text{qubit} = \pi/\Omega_\text{max}$ as the minimum time ($\pi$-time) for implementing an iSWAP $\pi$ rotation and single-qubit $\pi$ rotation respectively. The control solutions presented below implement the net iSWAP operation

### Benchmark Control

#### Primitive

The primitive iSWAP drive is similar to the unmodulated single-qubit primitive control , but implementing the iSWAP operation , $U_{\text{iSWAP}}(\pi,0)$. The control-space array is tabulated

### Dephasing Error Compensating Controls

#### CPMG in WAMF

The iSWAP control phasor is modulated with a WAMF envelope, the segments of which are interleaved with single-qubit $pi$ rotations, forming a CPMG (Carr-Purcell-Meiboom-Gill ) timing pattern. The single-qubit controls in each segment (here implemented as primitive rotations) may be replaced with any predefined single-qubit control , as long as it implements a net $\pi$ rotation. The control-space array is tabulated

#### Interleaved

For the *interleaved* control solution iSWAP control segments are temporally interleaved with single-qubit control segments. The iSWAP and single-qubit phasors (where nonzero) are constrained to *fixed-amplitude* drives: $\Lambda(t) = \Lambda_\text{max}$ and $\Omega(t) = \Omega_\text{max}$. This control solution relies strictly on phase modulation in order to achieve error robustness. Segment durations are allowed to vary such that individual segments implement arbitrary unitary rotations on the relevant control subspace. The specific phase-modulation pattern has been determined using the control optimizer, for a specific ratio $\Omega_\text{max}/\Lambda_\text{max}$. The control-space array is tabulated

#### Concurrent

For the *concurrent* control solution iSWAP and single-qubit phasors are allowed to be simultaneously active in every segment. The iSWAP and single-qubit phasors are constrained to *fixed-amplitude* drives: $\Lambda(t) = \Lambda_\text{max}$ and $\Omega(t) = \Omega_\text{max}$. This control solution relies on simultaneous phase modulation on both iSWAP and single-qubit drives in order to achieve error robustness. For an $m$-segment control solution, segment durations are fixed as equal divisions $\tau/m$ of the total drive duration $\tau$. The specific phase-modulation pattern has been determined using the control optimizer, for a specific ratio $\Omega_\text{max}/\Lambda_\text{max}$. The control-space array is tabulated

## Mølmer-Sørensen Drive

The available schemes for implementing Mølmer-Sørensen controls are described. In the presentation below $\tau$ denotes the total drive duration, $\Omega_\text{max}$ denotes the maximum Rabi . The control solutions presented below implement the net Mølmer-Sørensen unitary

### Benchmark Control

#### Primitive

Assume a fixed Rabi rate $\Omega(t) = \Omega_\text{MS}\le\Omega_\text{max}$ and drive phase $\phi(t)=0$. The primitive implementation of $U_\text{MS}$ is tabulated

where $\tau_\text{MS}$ is the drive duration such that

where the entangling phase in this case is evaluated

### Control and Detuning Error Compensating Controls

#### Amplitude Modulation

The amplitude modulation scheme (see Choi, 2014 ) is designed to decouple a set of motional modes in a Mølmer-Sørensen entangling gate by applying a time-dependent drive on the system. Similar to the phase-modulation scheme described above, this is achieved by ensuring that the phase-space trajectories of the targeted modes return to their starting point by the end of the gate. For a number $J$ of target modes, this leads to a set of $2J$ conditions for the closure of phase-space loops. This, together with the requirement of the correct entangling phase for the gate, defines the total $2J+1$ conditions for the correct gate implementation.

Consider a system with $M$ total oscillator modes and define a subset with $J<=M$ elements containing the modes to be decoupled. For the amplitude modulation solution, we split the total gate time ($\tau$) into $2J+1$ segments and assign to each segment $j$ a Rabi frequency $\Omega_j = \vert \Omega_j \vert e^{i \phi_j}$, where the phases simply determine the sign of the drive amplitude. This allows us to write the total decoupling condition explicitly for each of the $J$ target modes by integrating the phase-space trajectories :

By solving these equations, the control-space array is tabulated

where the drive amplitude has been scaled such that the entangling phase satisfies

#### Custom control

In the customized amplitude modulation control, the condition on the number of segments being $2J+1$ is relaxed and the complexity of the control solution can be set by selecting the total number of segments, $N_s$, at will. In this case, an optimization problem is solved to determine the drive amplitude for each segment $j$:

#### Phase Modulation

The phase-modulation scheme (see Green, 2015
) is designed to suppress the dominant source of infidelity in implementing Mølmer-Sørensen entangling gates. This scheme uses a *fixed-amplitude* drive, with $\Omega(t) = \Omega_\text{MS}\le\Omega_\text{max}$, and relies exclusively on discrete shifts in the drive phase to ensure multiple oscillator modes are decoupled, and to suppress the effects of fluctuations in the driving field
. The phase-modulation pattern is determined analytically to satisfy the decoupling condition
for $J$ targeted modes, such that their phase-space trajectories
close (return to the origin) at the end of the interaction. Consider a system with $M$ oscillator modes in total and relative detunings
denoted $\delta_{k}$ for
Define the *mode-closure sequence*

Namely, an ordered sequence selected from the set of $M$ modes, where the sequence length $J$ may be greater than, equal to, or less than $M$. This therefore includes any subset, permutation and combination the the $M$ modes, including repetitions, but such that every $\delta_{\rho_{j}}$ corresponds to one of the $M$ oscillator modes. To decouple the $J$ targeted modes, the drive duration is partitioned into $m=2^J$ segments of length $\tau_{s} = \tau/2^J$. The shift in the drive phase at the $\ell$th segment may be expressed

where $q(\ell)$ is the most significant binary digit in the binary representation of $\ell$, and $h(\ell)$ is the Hamming weight:

With these definitions, the control-space array is tabulated

where the drive amplitude has been scaled such that the entangling phase satisfies