This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

thanks: These two authors contributed equally to this work.thanks: These two authors contributed equally to this work.

Virtual ZZ gates and symmetric gate compilation

Arian Vezvaee Department of Electrical & Computer Engineering, University of Southern California, Los Angeles, California 90089, USA Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, CA 90089, USA    Vinay Tripathi Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, CA 90089, USA Department of Physics & Astronomy, University of Southern California, Los Angeles, California 90089, USA    Daria Kowsari Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, CA 90089, USA Department of Physics & Astronomy, University of Southern California, Los Angeles, California 90089, USA    Eli Levenson-Falk Department of Electrical & Computer Engineering, University of Southern California, Los Angeles, California 90089, USA Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, CA 90089, USA Department of Physics & Astronomy, University of Southern California, Los Angeles, California 90089, USA    Daniel A. Lidar Department of Electrical & Computer Engineering, University of Southern California, Los Angeles, California 90089, USA Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, CA 90089, USA Department of Physics & Astronomy, University of Southern California, Los Angeles, California 90089, USA Department of Chemistry, University of Southern California, Los Angeles, California 90089, USA
Abstract

The virtual ZZ gate has been established as an important tool for performing quantum gates on various platforms, including but not limited to superconducting systems. Many such platforms offer a limited set of calibrated gates and compile other gates, such as the YY gate, using combinations of XX and virtual ZZ gates. Here, we show that the method of compilation has important consequences in an open quantum system setting. Specifically, we experimentally demonstrate that it is crucial to choose a compilation that is symmetric with respect to virtual ZZ rotations. This is particularly pronounced in dynamical decoupling (DD) sequences, where improper gate decomposition can result in unintended effects such as the implementation of the wrong sequence. Our findings indicate that in many cases the performance of DD is adversely affected by the incorrect use of virtual ZZ gates, compounding other coherent pulse errors. In addition, we identify another source of coherent errors: interference between consecutive pulses that follow each other too closely. This work provides insights into improving general quantum gate performance and optimizing DD sequences in particular.

Refer to caption
Figure 1: The open system effect of the symmetric and asymmetric compilation of the YY gate with respect to VZ gates. (a) The |±i\ket{\pm i} state follows different Bloch sphere trajectories under YasymY^{\text{asym}}, which consists of an instantaneous VZ gate followed by a physical XX gate. This causes |i\ket{-i} (|+i\ket{+i}) to go through a stable (unstable) ground (excited) state which leads to the asymmetry in the fidelity of the two states. The symmetric decomposition YsymY^{\text{sym}} overcomes this asymmetry, similar to a physical YY gate. (b) Experimental demonstration of the symmetric and asymmetric effects of the YY-gate decomposition on the MUNINN processor. The fidelity of the states |±i\ket{\pm i} is shown under both YasymY^{\text{asym}} and YsymY^{\text{sym}}, as a function of time (bottom axis) or number of YYYY sequence cycles (top axis). The symmetric decomposition results in similar fidelities (black and red) for the initial states |±i\ket{\pm i}. The asymmetric decomposition results in very different fidelities (yellow and green) for the same two initial states. Error bars denote two standard deviation of the mean.

I Introduction

Any quantum computing processor is inherently an open quantum system that interacts with its environment, leading to decoherence and errors, which adversely affect quantum computations [1]. Various error correction, suppression, and mitigation techniques are employed to suppress these effects [2, 3, 4, 5]. There has been a great interest in demonstrations of overcoming decoherence, which have recently become possible with the availability of commercial cloud-based quantum processors [6, 7, 8, 9, 10]. These quantum processors usually have a native set of calibrated gates from which all other gates can be constructed. An important part of the native gate set is the Virtual-ZZ (VZ) gate, which is an instantaneous, error-free operation that plays a central role in gate compilation. Ref. [11] demonstrated that VZ gates can be implemented by simply adding a phase offset in software, unlike physical ZZ-gates that involve physical rotations around the zz-axis of the Bloch sphere. Moreover, they showed, by manipulating the phases of pulses driving the qubits, VZ gates can be effectively combined with two X\sqrt{X} gates to construct any SU(2) gate, thus achieving universality when combined with a two-qubit entangling gate [12, 13]. This approach simplifies the gate decomposition and circuit compilation procedure, and its applicability extends beyond qubits to qudits as well as beyond superconducting systems [14, 15, 16, 17, 18, 19, 20]. Compiling an arbitrary SU(2) operation using VZ gates provides flexibility, but ensuring accuracy in the presence of open quantum system effects is essential for reliable computations. Although different compilations involving VZ gates can be equivalent in closed systems, discrepancies may arise if open-system effects are not correctly accounted for during compilation.

In this work, we investigate the role of VZ gates in gate compilation within an open quantum system dynamics framework. We find that even slight variations in the compilation of quantum gates using VZ gates reveal significant detectable effects. Specifically, an asymmetrical compilation of the YY gate relative to VZ gates introduces fidelity discrepancies between the YY eigenstates |±i\ket{\pm i}, which can be completely mitigated with proper compilation techniques. This observation has important consequences. Asymmetric compilation influences the implementation of dynamical decoupling (DD) sequences [21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34], potentially leading to misimplementation and misidentification of commonly used sequences. For example, DD implementations using cloud quantum processors reveal unexpected pulse-interval effects, as well as unexplained significant oscillations in single-qubit experiments [34]. In addition, our findings uncover previously unrecognized oscillations, even in DD sequences designed to be robust to coherent errors [30, 31, 32]. The investigations into the VZ gate we report here reveal that interference between consecutive pulses explains these oscillations in robust sequences. Given the recent critical role DD has played in improving the fidelity of quantum states [33, 35, 36, 34, 37, 38, 39], circuits [40, 41, 42], and even entire algorithms [43, 44, 45, 46], we expect these findings to contribute to further improvement of quantum error suppression via pulse-based methods such as DD. However, the impact extends beyond DD to any quantum algorithm or error-correction method that requires high-fidelity single-qubit gates.

II VZ gate in an open quantum system

We conduct all our experiments using two superconducting transmon quantum processors: the IBM cloud quantum processor ibm_sherbrooke and our in-house quantum processor MUNINN [47].

We model the transmon qubit as a driven two-level system and consider it in the drive frame under the rotating wave approximation (e.g., Ref. [48]). Let {σα}\{\sigma_{\alpha}\} denote the set of Pauli matrices. The time-dependent system Hamiltonian that generates single-qubit XX rotation gates is given by:

H(t)\displaystyle H(t) =εtot(t)σx2+Herr\displaystyle=\varepsilon_{\mathrm{tot}}(t)\frac{\sigma_{x}}{2}+H_{\mathrm{err}} (1a)
Herr\displaystyle H_{\mathrm{err}} =εerrσx2+Δerrσz2.\displaystyle=\varepsilon_{\mathrm{err}}\frac{\sigma_{x}}{2}+\Delta_{\mathrm{err}}\frac{\sigma_{z}}{2}. (1b)

Here, εtot(t)\varepsilon_{\mathrm{tot}}(t) is the intended time-dependent control field and εerr\varepsilon_{\mathrm{err}} and Δerr\Delta_{\mathrm{err}} are errors. Ideally, εerr=Δerr=0\varepsilon_{\mathrm{err}}=\Delta_{\mathrm{err}}=0. In reality, both are present and give rise to rotation and phase errors

δθεerrtg,δφΔerrε¯,\delta\theta\equiv\varepsilon_{\mathrm{err}}t_{g}\ ,\quad\delta\varphi\equiv\frac{\Delta_{\mathrm{err}}}{\bar{\varepsilon}}, (2)

respectively, with tgt_{g} denoting the gate duration and ε¯\bar{\varepsilon} the effective pulse amplitude [49]. An open system single-qubit gate includes both rotation and phase errors, as well as a system-bath interaction term that is always present while the gate is being generated.

II.1 Gate compilation

VZ gates eliminate the need for performing physical rotations about the Bloch zz-axis, allowing us to focus solely on rotations in the (x,y)(x,y) plane. We denote by Rϕ(θ)R_{\phi}(\theta) a rotation by an angle θ\theta about an arbitrary axis in the (x,y)(x,y) plane, making an angle ϕ\phi with the xx-axis:

Rϕ(θ)exp[i(θ/2)(cos(ϕ)σx+sin(ϕ)σy)].R_{\phi}(\theta)\equiv\exp[-i(\theta/2)(\cos(\phi)\sigma_{x}+\sin(\phi)\sigma_{y})]. (3)

We also denote

Rx(θ)Rϕ=0(θ),Ry(θ)Rϕ=π/2(θ).R_{x}(\theta)\equiv R_{\phi=0}(\theta)\ ,\quad R_{y}(\theta)\equiv R_{\phi=\pi/2}(\theta). (4)

The physical implementation of Rϕ(θ)R_{\phi}(\theta) involves applying an on-resonance microwave pulse of the form εtot(t)=ε(t)cos(ωt+ϕ)\varepsilon_{\mathrm{tot}}(t)=\varepsilon(t)\cos(\omega t+\phi) to the qubit, where the integrated pulse amplitude (for a given pulse duration) determines θ\theta, and the pulse phase determines ϕ\phi. The phase ϕ\phi is arbitrary, as is the choice of the (x,y)(x,y) coordinate system, both set by the initial pulse. This illustrates how the VZ gate is implemented simply by updating the definition of which pulse phase corresponds to ϕ=0\phi=0 (usually set to be the xx-axis, as above). However, this adjustment has tangible physical effects on subsequent gates: after a virtual Rz(φ)exp[i(φ/2)σz]R_{z}(\varphi)\equiv\exp[-i(\varphi/2)\sigma_{z}] gate [note that Rz(π)Z=iσzR_{z}(\pi)\equiv Z=-i\sigma^{z}], the phase of each of the rotations that follow is shifted by φ\varphi. For example, when φ=π\varphi=\pi, then the next operation Rx(θ)R_{x}(\theta) becomes Rπ(θ)=Rx(θ)R_{\pi}(\theta)=R_{-x}(\theta), i.e., a rotation about the xx-axis becomes a rotation about the x-x axis, in the sense that Rx(θ)=Rz(π)Rx(θ)Rz(π)R_{-x}(\theta)=R^{\dagger}_{z}(\pi)R_{x}(\theta)R_{z}(\pi).

For most commercial cloud-based quantum processors not all rotations are natively available. For example, for the IBMQ devices, the calibrated single-qubit native gate set typically consists of the operations 𝒢={Rz(φ),X,X}\mathcal{G}=\{R_{z}(\varphi),\sqrt{X},X\}, where XRx(π/2)\sqrt{X}\equiv R_{x}(\pi/2) and XRx(π)=iσxX\equiv R_{x}(\pi)=-i\sigma_{x}, which are generated using H(t)H(t) given in Eq. 1. However, these are not the only Clifford operations necessary for universal quantum computation. All other Clifford gates must be decomposed into these operations. Specifically, a YRy(π)=iσyY\equiv R_{y}(\pi)=-i\sigma_{y} gate requires an XX gate combined with VZ gates, which can be done in different ways. One method of compiling a YY gate is asymmetrical:

Yasym=XRz(π).Y^{\text{asym}}=XR_{z}(-\pi). (5)

Alternatively, a symmetric compilation of the YY gate with respect to the VZ gates is:

Ysym=Rz(π/2)XRz(π/2).Y^{\text{sym}}=R_{z}(\pi/2)XR_{z}(-\pi/2). (6)

Although these methods are theoretically equivalent in the sense that Yasym=Ysym=YY^{\text{asym}}=Y^{\text{sym}}=Y is a mathematical identity, this is no longer the case when one accounts for deviations from unitary dynamics due to open quantum system effects, as we discuss in detail below.

Refer to caption
Figure 2: Effect of the asymmetric YasymY^{\text{asym}} and symmetric YsymY^{\text{sym}} gates on state fidelity for various qubits of the ibm_sherbrooke processor. We applied different repetitions of the YYYY sequence and observe that subject to YsymY^{\text{sym}} the fidelities of the |±i\ket{\pm i} states (black and red) are much closer than subject to YasymY^{\text{asym}} (yellow and green). Different subfigures correspond to different qubits on ibm_sherbrooke: (a) qubit 0, (b) qubit 1313, (c) qubit 8181, and (d) qubit 8989.

II.2 Trajectories matter: asymmetry between |+i\ket{+i} and |i\ket{-i}

To demonstrate how the two compilation strategies result in different outcomes, we consider a simple experiment, in which we apply sequences with a varying number of YYYY pulses to the two orthogonal initial states |±i\ket{\pm i}. Ideally, the fidelity of YYYY applied to |+i\ket{+i} or |i\ket{-i} should be identical. However, with the asymmetric decomposition the two states follow different Bloch sphere trajectories and leave the (x,y)(x,y) plane. That is, in the case of YasymY^{\text{asym}}, the virtual Rz(π)R_{z}(-\pi) gate instantaneously interchanges |+i\ket{+i} and |i\ket{-i} (up to a global phase of ii) before the physical XX gate is applied. This has the effect of |i\ket{-i} following a trajectory through the stable ground state |0\ket{0} during the XX gate, while |+i\ket{+i} passes through the unstable excited state |1\ket{1} [see Fig. 1(a)]. The second YY gate leads to a reversal of this trajectory, again passing through the ground/excited, as the virtual Rz(π)R_{z}(-\pi) reverses the direction of rotation. Consequently, |i\ket{-i} experiences a lower relaxation rate and maintains a higher fidelity compared to |+i\ket{+i} over the course of repeated applications of the YYYY sequence.

Conversely, using the symmetric decomposition YsymY^{\text{sym}}, the first VZ gate, Rz(π/2)R_{z}(-\pi/2) transforms |i\ket{-i} to |\ket{-} and |+i\ket{+i} to |+\ket{+} (up to a global phase of eiπ/4e^{i\pi/4}). These states then undergo an XX gate, which leaves them unchanged (up to a global phase). The next VZ gate, Rz(π/2)R_{z}(\pi/2), transforms the state back to its original position on the yy-axis. Therefore, with this compilation, |±i\ket{\pm i} both remain in the (x,y)(x,y) plane at all times during the YsymY^{\text{sym}} gate, and do not experience different relaxation rates. As a result, the fidelities of |±i\ket{\pm i} should be similar under YYYY, as for a physical YY gate. By linearity, this extends to any state in the (x,y)(x,y) plane, i.e., to any superposition of |±i\ket{\pm i} or |±\ket{\pm}. Another way to see this result is that symmetric YYYY compiles to two repetitions of Eq. 6, which is then equal to Rz(π/2)XXRz(π/2)R_{z}(\pi/2)XXR_{z}(-\pi/2). The interior XXXX sequence traces out a full 2π2\pi rotation and thus always leads to trajectories that are symmetric about the (x,y)(x,y) plane, as expected by the YYYY sequence.

We verified the effects predicted above through various experiments, using both the ibm_sherbrooke and MUNINN processor. As described above, we first prepare the initial states |±i\ket{\pm i}, apply a series of YYYY sequences, unprepare the initial state, and measure the system in the σz\sigma_{z} eigenbasis. We define the empirical fidelity as the frequency of favorable outcomes, i.e., the number of |0\ket{0} outcomes divided by the total number of experimental shots (800800). Fig. 1(b) shows the results on the MUNINN processor, where we demonstrate that the asymmetric compilation of the YY gate leads to the predicted asymmetry in the fidelity of the |±i\ket{\pm i} states. In contrast, the two states decay almost identically when the symmetric compilation of YY gate is used. We observe the same effect after repeating the experiments on different qubits of the ibm_sherbrooke processor, as highlighted in Fig. 2.

II.3 Impact on DD sequences

Next, we consider the impact of asymmetric compilation on DD sequences. Specifically, we consider asymmetric and symmetric versions of the XY4 sequence [50]:

XY4YfτXfτYfτXfτ,\text{XY}4\equiv Yf_{\tau}Xf_{\tau}Yf_{\tau}Xf_{\tau}, (7)

where fτ=eiτHf_{\tau}=e^{-i\tau H} denotes the free evolution unitary generated by the total system-bath Hamiltonian HH. We also consider how to correctly implement the X¯\overline{X} gate.

II.3.1 Asymmetric YY yields UR4

Using the asymmetric definition of the YY gate [Eq. 5], the XY4 sequence becomes:

XY4asym=\displaystyle\text{XY}4^{\text{asym}}= (8)
Rx(π)Rz(π)fτRx(π)fτRx(π)Rz(π)fτRx(π)fτ.\displaystyle\quad R_{x}(\pi)R_{z}(-\pi)f_{\tau}R_{x}(\pi)f_{\tau}R_{x}(\pi)R_{z}(-\pi)f_{\tau}R_{x}(\pi)f_{\tau}.

As discussed earlier, the VZ gates enact a frame transformation for all subsequent gates. In the present context, this manifests as the identity

Rx(π)Rz(±π)=Rz(π)Rx(π),R_{x}(\pi)R_{z}(\pm\pi)=-R_{z}(\mp\pi)R_{x}(-\pi), (9)

which allows us to commute the VZ gate to the left. Since it is a virtual gate implemented via phase offsets in software, the VZ gate commutes with the free evolution operator fτf_{\tau}. Thus, dropping overall phase factors, we can rewrite XY4asym\text{XY}4^{\text{asym}} as follows:

XY4asym=\displaystyle\text{XY}4^{\text{asym}}=
Rx(π)Rz(π)fτRx(π)Rz(π)fτRx(π)fτRx(π)fτ=\displaystyle\quad R_{x}(\pi)R_{z}(-\pi)f_{\tau}R_{x}(\pi)R_{z}(\pi)f_{\tau}R_{x}(-\pi)f_{\tau}R_{x}(\pi)f_{\tau}=
Rx(π)Rz(2π)fτRx(π)fτRx(π)fτRx(π)fτ=\displaystyle\quad R_{x}(\pi)R_{z}(-2\pi)f_{\tau}R_{x}(-\pi)f_{\tau}R_{x}(-\pi)f_{\tau}R_{x}(\pi)f_{\tau}=
Rx(π)fτRx(π)fτRx(π)fτRx(π)fτ.\displaystyle\quad R_{x}(\pi)f_{\tau}R_{x}(-\pi)f_{\tau}R_{x}(-\pi)f_{\tau}R_{x}(\pi)f_{\tau}. (10)

This sequence is, in fact, the fourth order “universally robust” sequence [32],

UR4=XfτX¯fτX¯fτXfτ,\text{UR}_{4}=Xf_{\tau}\overline{X}f_{\tau}\overline{X}f_{\tau}Xf_{\tau}, (11)

where X¯Rx(π)\overline{X}\equiv R_{x}(-\pi), rather than the intended XY4. I.e.,

XY4asym=UR4.\text{XY}4^{\text{asym}}=\text{UR}_{4}. (12)

II.3.2 Symmetric YY yields XY4

We first note the identity

Rx(π)Rz(π/2)=Rz(π/2)Ry(π),R_{x}(\pi)R_{z}(-\pi/2)=R_{z}(-\pi/2)R_{y}(\pi), (13)

i.e., Rz(π/2)R_{z}(-\pi/2) changes the rotation axis of the subsequent gates by π/2\pi/2, transforming Rx(π)Ry(π)R_{x}(\pi)\to R_{y}(\pi). Therefore, using YsymY^{\text{sym}} [Eq. 6], we have:

XY4sym=\displaystyle\text{XY}4^{\text{sym}}= Rz(π/2)Rx(π)Rz(π/2)fτRx(π)fτ×\displaystyle\ R_{z}(\pi/2)R_{x}(\pi)R_{z}(-\pi/2)f_{\tau}R_{x}(\pi)f_{\tau}\times
Rz(π/2)Rx(π)Rz(π/2)fτRx(π)fτ\displaystyle\ R_{z}(\pi/2)R_{x}(\pi)R_{z}(-\pi/2)f_{\tau}R_{x}(\pi)f_{\tau}
=\displaystyle= Rz(π/2)Rz(π/2)Ry(π)fτRx(π)fτ×\displaystyle\ R_{z}(\pi/2)R_{z}(-\pi/2)R_{y}(\pi)f_{\tau}R_{x}(\pi)f_{\tau}\times
Rz(π/2)Rz(π/2)Ry(π)fτRx(π)fτ\displaystyle\ R_{z}(\pi/2)R_{z}(-\pi/2)R_{y}(\pi)f_{\tau}R_{x}(\pi)f_{\tau}
=\displaystyle= Ry(π)fτRx(π)fτRy(π)fτRx(π)fτ,\displaystyle\ R_{y}(\pi)f_{\tau}R_{x}(\pi)f_{\tau}R_{y}(\pi)f_{\tau}R_{x}(\pi)f_{\tau}, (14)

which is indeed the XY4 sequence [Eq. 7].

II.3.3 Correct X¯Rx(π)\overline{X}\equiv R_{x}(-\pi)

We note that the frame transformation defined by Eq. 9 can be reinterpreted as a way to create a correct X¯\overline{X} gate, which plays an important role in robust DD sequences [32, 31]. Namely, we perform the symmetric version of the gate as:

X¯=Rz(π)XRz(π) or Rz(π)XRz(π).\overline{X}=R_{z}(-\pi)XR_{z}(\pi)\text{ or }R_{z}(\pi)XR_{z}(-\pi). (15)

As we show in the next section, performing the correct X¯\overline{X} gate is critical for understanding the oscillations in the fidelity of the robust DD sequences that have been observed on IBM devices [34]. In particular, it is essential that the physical rotation implemented is Rx(π)R_{x}(\pi) and not only Rx(π)R_{x}(\pi) plus some later frame updates.

Refer to caption
Figure 3: The |+\ket{+} state fidelity as a function of total sequence time (or number of sequence cycles; top axis), subject to the XY4sym{}^{\text{sym}}, XY4asym{}^{\text{asym}}, UR4, YYsymYY^{\text{sym}}, and XX¯X\overline{X} sequences applied to a single qubit (qubit 37) on the ibm_sherbrooke device. Data points for the two-pulse-long YYsymYY^{\text{sym}} and XX¯X\overline{X} sequences are shown for every second cycle (i.e., their total number of cycles is 640640). The XY4asym{}^{\text{asym}} and UR4 sequences exhibit nearly identical fidelity decay behavior, clearly distinct from that of the XY4sym{}^{\text{sym}} sequence, confirming that the asymmetric YY gates transform XY4 into the UR4 sequence. All sequences shown exhibit oscillations.
Refer to caption
Figure 4: As in Fig. 3 (except for the absence of XY4asym{}^{\text{asym}}) with the pulse interval doubled from τ=56.8\tau=56.8 ns to 2τ=113.62\tau=113.6 ns. The oscillation periods of YYsymYY^{\text{sym}} and XX¯X\overline{X} increase significantly, and the difference between the now decaying XY4sym{}^{\text{sym}} and UR4 fidelities is nearly eliminated.

III Experimental verification

Next, we report on experiments with various DD sequences to test our predictions about the role of VZ gates in open quantum systems.

III.1 Symmetric vs asymmetric sequence implementations

To test our prediction that when using YasymY^{\text{asym}}, XY4 is effectively the same as UR4, Fig. 3 presents the results of measuring the fidelity of the |+\ket{+} state as a function of time for a variety of different pulse sequences, each of which is applied repeatedly. Specifically, we apply the following sequences to a single qubit on ibm_sherbrooke: UR4 using the symmetric definition for X¯\overline{X} given in Eq. 15, and two versions of XY4 using the symmetric and asymmetric YY gates. As shown in Fig. 3, the UR4 and XY4asym{}^{\text{asym}} sequences are almost indistinguishable, as expected. In contrast, XY4sym{}^{\text{sym}} is distinct.

It is important to note that Qiskit [51] natively compiles the YY gate in the asymmetric form of Eq. 5. Therefore, caution is necessary when interpreting previously reported DD results involving transmon qubits that did not use the YsymY^{\text{sym}} gate, including numerous studies involving the XY4 sequence.

III.2 Pulse interference

Fig. 3 also displays the YYYY and XX¯X\overline{X} sequences, constructed using the symmetric definitions given in Eqs. 6 and 15, respectively. An unexpected feature observed in Fig. 3 is that all five sequences shown (including the robust ones), exhibit oscillations, which typically arise from coherent errors. We hypothesize that this phenomenon is due to an interference effect between consecutive pulses, e.g., due to an impedance mismatch in the microwave control lines [52].

To test this hypothesis, we repeated the same experiments as shown in Fig. 3 (except that we did not repeat XY4asym{}^{\text{asym}} since we already established its equivalence with UR4), but with an intentional delay added between consecutive pulses, thus doubling the pulse interval τ=56.8\tau=56.8 ns, defined as the time delay between the peaks of two consecutive pulses. The result, shown in Fig. 4, is that the XY4sym{}^{\text{sym}} and UR4 sequences no longer oscillate, but exhibit simple decay. Moreover, the stark difference between the latter two sequences seen in Fig. 3 has now almost disappeared. This is consistent with the observation that ZZ (dephasing) errors are the dominant error source in transmon qubits, so that sequences suppressing XX or YY errors have little added benefit over sequences suppressing only ZZ errors.

The fact that the fidelities seen in Fig. 3 are higher for intervals of 2τ2\tau rather than τ\tau also helps to explain why previous studies involving transmon qubits [33, 34] have observed that, in contrast to the DD theory for ideal, zero width pulses (e.g., Ref. [53]), the optimal pulse interval is not always the shortest possible (the same phenomenon has also been observed in other platforms, e.g., nuclear magnetic resonance [54] and trapped ions [55]). The pulse interference effect, with pulses applied consecutively with the minimum shortest possible pulse interval τ\tau, can introduce additional coherent errors that result in inferior DD performance even with sequences (such as UR4) that are robust against small coherent errors. Our results confirm the conclusion of Ref. [34] that it is essential to optimize the pulse interval for a given quantum processor, with the added insight that this optimization can reduce or (depending on the pulse sequence) even eliminate coherent errors due to pulse interference.

Refer to caption
Figure 5: Experimental study of the fidelities of the XY4sym{}^{\text{sym}} (blue) and UR4 (red) sequences with different pulse intervals (1τ1\tau, 2τ2\tau, and 3τ3\tau) for the whole set of 127 qubits on ibm_sherbrooke. (a), (b) and (c) show the results for 123 of the qubits for the noted pulse intervals. (c), (d) and (e) show the corresponding mean and standard deviations. The oscillations in fidelities vanish as we increase τ\tau due to mitigation of the pulse interference effects.

The reason we include the XX¯X\overline{X} and YYYY sequences in Fig. 3 is that XX¯X\overline{X} is susceptible to phase errors, while YYYY is susceptible to rotation errors [Eq. 2], as discussed in detail in Ref. [49]. More specifically, Figs. 3 and 4 shows that the two sequences exhibit oscillations for both the τ\tau and 2τ2\tau cases, with a period significantly shorter than that of the other sequences shown. This is consistent with the existence of single-pulse phase and rotation errors in addition to pulse interference errors. Doubling the pulse interval significantly increases the oscillation period, as seen in Fig. 4, but does not eliminate the oscillations. Moreover, we have checked (not shown) that further increasing the pulse interval to 3τ3\tau has little effect on the XX¯X\overline{X} and YYYY fidelities, showing that coherent phase and rotation errors cannot be eliminated by controlling the pulse interference effect alone.

Both Figs. 3 and 4 display results from a single qubit. To test whether the small difference between the robust XY4sym{}^{\text{sym}} and UR4 sequences [32] seen in Fig. 4 even with a doubled pulse interval is a statistically significant feature, we performed the XY4sym{}^{\text{sym}} and UR4 experiments on all 127127 qubits of the ibm_sherbrooke device, for pulse intervals of τ=56.8\tau=56.8ns, 2τ2\tau, and 3τ3\tau. The results are shown in Fig. 5, after removing four of the qubits whose measurements were inadvertently performed during a calibration cycle (qubits 20, 21, 56, 63). We find that the oscillations exhibited by both XY4sym{}^{\text{sym}} and UR4 in the 1τ1\tau case entirely disappear in 122122 out of the 123123 qubits (the only exception being qubit 6767) for pulse intervals of 2τ2\tau and 3τ3\tau. After fitting the fidelities to a+bet/TDa+be^{-t/T_{D}}, a small difference in the decay constants remains for 2τ2\tau intervals: TD(UR4)TD(XY4sym)T_{D}(\text{UR}_{4})\geq T_{D}(\text{XY4}^{\text{sym}}) in 59% of the cases. This difference disappears almost entirely for the 3τ3\tau intervals: TD(UR4)TD(XY4sym)T_{D}(\text{UR}_{4})\geq T_{D}(\text{XY4}^{\text{sym}}) in 51% of the cases.

We may thus conclude that the pulse interference effect is significant when pulses are applied back-to-back but strongly diminishes when the pulse interval is doubled, and essentially disappears entirely when it is tripled.

IV Conclusion

This work highlights the critical role of the VZ gate and its interplay with the open system dynamics of quantum processors. We have demonstrated that a symmetric compilation of quantum gates with respect to the VZ gate, especially the YY and X¯\overline{X} gates, significantly improves the fidelity of these gates. In particular, it removes an undesired asymmetry between states in the (x,y)(x,y) plane of the Bloch sphere that is present when an asymmetric gate compilation is used instead. We have experimentally validated the advantage offered by a symmetric gate compilation using our in-house processor MUNINN as well as using the IBM cloud processor ibm_sherbrooke, showing in particular the impact on commonly used DD sequences.

Our findings highlight the need to carefully consider VZ gate compilation in future studies, as well as the impact on previous studies that used asymmetric gate compilations. Specifically, we have shown that asymmetric compilations can lead to unexpected outcomes, such as fidelity asymmetries and incorrect implementations of DD sequences, which can result in misleading interpretations of earlier experimental results. A case in point is that an asymmetric compilation of the YY gate has the effect that the standard XY4 DD sequence is actually an implementation of the UR4 sequence, which does not suppress any undesired XX-type interactions. Conversely, symmetric compilations preserve the intended gate operations and result in a faithful implementation of the desired DD sequences.

Furthermore, we explored the impact of pulse interference, which can introduce coherent errors even in DD sequences that are designed to be robust to such errors. We have demonstrated that by intentionally increasing the pulse interval these effects can be mitigated, highlighting the importance of optimizing the pulse interval for a given quantum processor. These results explain earlier observations where robust sequences resulted in suboptimal performance; this effect can now be attributed to pulse interference effects.

Future studies may focus on refining gate compilation strategies and addressing pulse interference effects to further enhance the fidelity of quantum gates.

Acknowledgement

This work was supported the National Science Foundation Quantum Leap Big Idea under Grant No. OMA-1936388. V.T., A.V. and D.A.L. acknowledge the support from the ARO MURI grant W911NF-22-S-0007. In-house processor was fabricated and provided by the Superconducting Qubits at Lincoln Laboratory (SQUILL) Foundry at MIT Lincoln Laboratory, with funding from the Laboratory for Physical Sciences (LPS) Qubit Collaboratory. We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors and do not reflect the official policy or position of IBM or the IBM Quantum team. This research was conducted using IBM Quantum Systems provided through USC’s IBM Quantum Innovation Center.

References

  • Nielsen and Chuang [2010] M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information (Cambridge University Press, 2010).
  • Lidar and Brun [2013] D. Lidar and T. Brun, eds., Quantum Error Correction (Cambridge University Press, Cambridge, UK, 2013).
  • Suter and Álvarez [2016] D. Suter and G. A. Álvarez, Colloquium: Protecting quantum information against environmental noise, Rev. Mod. Phys. 88, 041001 (2016).
  • Campbell et al. [2017] E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549, 172 EP (2017).
  • Cai et al. [2023] Z. Cai, R. Babbush, S. C. Benjamin, S. Endo, W. J. Huggins, Y. Li, J. R. McClean, and T. E. O’Brien, Quantum error mitigation, Rev. Mod. Phys. 95, 045005 (2023).
  • Mell and Grance [2011] P. Mell and T. Grance, The nist definition of cloud computing, Special Publication (NIST SP) (2011), [Online]. Available: https://doi.org/10.6028/NIST.SP.800-145 (Accessed June 29, 2024).
  • [7] IBM Quantum.
  • Karalekas et al. [2020] P. J. Karalekas, N. A. Tezak, E. C. Peterson, C. A. Ryan, M. P. da Silva, and R. S. Smith, A quantum-classical cloud platform optimized for variational hybrid algorithms, Quantum Science and Technology 5, 024003 (2020).
  • Wurtz et al. [2023] J. Wurtz, A. Bylinskii, B. Braverman, J. Amato-Grill, S. H. Cantu, F. Huber, A. Lukin, F. Liu, P. Weinberg, J. Long, S.-T. Wang, N. Gemelke, and A. Keesling, Aquila: Quera’s 256-qubit neutral-atom quantum computer (2023), arXiv:2306.11727 [quant-ph] .
  • Blinov et al. [2021] S. Blinov, B. Wu, and C. Monroe, Comparison of cloud-based ion trap and superconducting quantum computer architectures, AVS Quantum Science 310.1116/5.0058187 (2021).
  • McKay et al. [2017] D. C. McKay, C. J. Wood, S. Sheldon, J. M. Chow, and J. M. Gambetta, Efficient zz gates for quantum computing, Phys. Rev. A 96, 022330 (2017).
  • Lloyd [1995] S. Lloyd, Almost any quantum logic gate is universal, Physical Review Letters 75, 346 (1995).
  • Barenco et al. [1995] A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Elementary gates for quantum computation, Physical Review A 52, 3457 (1995).
  • Liu et al. [2023] P. Liu, R. Wang, J.-N. Zhang, Y. Zhang, X. Cai, H. Xu, Z. Li, J. Han, X. Li, G. Xue, W. Liu, L. You, Y. Jin, and H. Yu, Performing SU(d)\mathrm{SU}(d) operations and rudimentary algorithms in a superconducting transmon qudit for d=3d=3 and d=4d=4Phys. Rev. X 13, 021028 (2023).
  • Vezvaee et al. [2023] A. Vezvaee, E. Takou, P. Hilaire, M. F. Doty, and S. E. Economou, Avoiding leakage and errors caused by unwanted transitions in lambda systems, PRX Quantum 4, 030312 (2023).
  • Gullans et al. [2024] M. Gullans, M. Caranti, A. Mills, and J. Petta, Compressed gate characterization for quantum devices with time-correlated noise, PRX Quantum 5, 010306 (2024).
  • Tsai et al. [2022] R. B.-S. Tsai, H. Silvério, and L. Henriet, Pulse-level scheduling of quantum circuits for neutral-atom devices, Phys. Rev. Appl. 18, 064035 (2022).
  • Fischer et al. [2022] L. E. Fischer, D. Miller, F. Tacchino, P. K. Barkoutsos, D. J. Egger, and I. Tavernelli, Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space, Phys. Rev. Res. 4, 033027 (2022).
  • Vezvaee et al. [2024] A. Vezvaee, N. Earnest-Noble, and K. Najafi, Quantum simulation of fermi-hubbard model based on transmon qudit interaction (2024), arXiv:2402.01243 [quant-ph] .
  • Kazmina et al. [2024] A. S. Kazmina, I. V. Zalivako, A. S. Borisenko, N. A. Nemkov, A. S. Nikolaeva, I. A. Simakov, A. V. Kuznetsova, E. Y. Egorova, K. P. Galstyan, N. V. Semenin, A. E. Korolkov, I. N. Moskalenko, N. N. Abramov, I. S. Besedin, D. A. Kalacheva, V. B. Lubsanov, A. N. Bolgar, E. O. Kiktenko, K. Y. Khabarova, A. Galda, I. A. Semerikov, N. N. Kolachevsky, N. Maleeva, and A. K. Fedorov, Demonstration of a parity-time-symmetry-breaking phase transition using superconducting and trapped-ion qutrits, Phys. Rev. A 109, 032619 (2024).
  • Viola and Lloyd [1998] L. Viola and S. Lloyd, Dynamical suppression of decoherence in two-state quantum systems, Phys. Rev. A 58, 2733 (1998).
  • Viola et al. [1999] L. Viola, E. Knill, and S. Lloyd, Dynamical decoupling of open quantum systems, Phys. Rev. Lett. 82, 2417 (1999).
  • Zanardi [1999] P. Zanardi, Symmetrizing evolutions, Physics Letters A 258, 77 (1999).
  • Duan and Guo [1999] L.-M. Duan and G.-C. Guo, Suppressing environmental noise in quantum computation through pulse control, Physics Letters A 261, 139 (1999).
  • Vitali and Tombesi [1999] D. Vitali and P. Tombesi, Using parity kicks for decoherence control, Physical Review A 59, 4178 (1999).
  • Viola and Knill [2003] L. Viola and E. Knill, Robust dynamical decoupling of quantum systems with bounded controls, Physical Review Letters 90, 037901 (2003).
  • Viola and Knill [2005] L. Viola and E. Knill, Random decoupling schemes for quantum dynamical control and error suppression, Phys. Rev. Lett. 94, 060502 (2005).
  • Khodjasteh and Lidar [2005] K. Khodjasteh and D. A. Lidar, Fault-tolerant quantum dynamical decoupling, Physical Review Letters 95, 180501 (2005).
  • Uhrig [2007] G. S. Uhrig, Keeping a quantum bit alive by optimized π\pi-pulse sequences, Phys. Rev. Lett. 98, 100504 (2007).
  • Souza et al. [2011] A. M. Souza, G. A. Álvarez, and D. Suter, Robust dynamical decoupling for quantum computing and quantum memory, Physical Review Letters 106, 240501 (2011).
  • Quiroz and Lidar [2013] G. Quiroz and D. A. Lidar, Optimized dynamical decoupling via genetic algorithms, Phys. Rev. A 88, 052306 (2013).
  • Genov et al. [2017] G. T. Genov, D. Schraft, N. V. Vitanov, and T. Halfmann, Arbitrarily accurate pulse sequences for robust dynamical decoupling, Phys. Rev. Lett. 118, 133202 (2017).
  • Pokharel et al. [2018] B. Pokharel, N. Anand, B. Fortman, and D. A. Lidar, Demonstration of fidelity improvement using dynamical decoupling with superconducting qubits, Phys. Rev. Lett. 121, 220502 (2018).
  • Ezzell et al. [2023] N. Ezzell, B. Pokharel, L. Tewala, G. Quiroz, and D. A. Lidar, Dynamical decoupling for superconducting qubits: A performance survey, Phys. Rev. Appl. 20, 064027 (2023).
  • Souza [2021] A. M. Souza, Process tomography of robust dynamical decoupling with superconducting qubits, Quantum Information Processing 2010.1007/s11128-021-03176-z (2021).
  • Tripathi et al. [2022] V. Tripathi, H. Chen, M. Khezri, K.-W. Yip, E. Levenson-Falk, and D. A. Lidar, Suppression of crosstalk in superconducting qubits using dynamical decoupling, Phys. Rev. Appl. 18, 024068 (2022).
  • Tong et al. [2024] C. Tong, H. Zhang, and B. Pokharel, Empirical learning of dynamical decoupling on quantum processors (2024), arXiv:2403.02294 [quant-ph] .
  • Seif et al. [2024] A. Seif, H. Liao, V. Tripathi, K. Krsulich, M. Malekakhlagh, M. Amico, P. Jurcevic, and A. Javadi-Abhari, Suppressing correlated noise in quantum computers via context-aware compiling (2024), arXiv:2403.06852 [quant-ph] .
  • Rahman et al. [2024] A. Rahman, D. J. Egger, and C. Arenz, Learning how to dynamically decouple (2024), arXiv:2405.08689 [quant-ph] .
  • Arute et al. [2019] F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandao, D. A. Buell, B. Burkett, Y. Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, A. Dunsworth, E. Farhi, B. Foxen, A. Fowler, C. Gidney, M. Giustina, R. Graff, K. Guerin, S. Habegger, M. P. Harrigan, M. J. Hartmann, A. Ho, M. Hoffmann, T. Huang, T. S. Humble, S. V. Isakov, E. Jeffrey, Z. Jiang, D. Kafri, K. Kechedzhi, J. Kelly, P. V. Klimov, S. Knysh, A. Korotkov, F. Kostritsa, D. Landhuis, M. Lindmark, E. Lucero, D. Lyakh, S. Mandrà, J. R. McClean, M. McEwen, A. Megrant, X. Mi, K. Michielsen, M. Mohseni, J. Mutus, O. Naaman, M. Neeley, C. Neill, M. Y. Niu, E. Ostby, A. Petukhov, J. C. Platt, C. Quintana, E. G. Rieffel, P. Roushan, N. C. Rubin, D. Sank, K. J. Satzinger, V. Smelyanskiy, K. J. Sung, M. D. Trevithick, A. Vainsencher, B. Villalonga, T. White, Z. J. Yao, P. Yeh, A. Zalcman, H. Neven, and J. M. Martinis, Quantum supremacy using a programmable superconducting processor, Nature 574, 505 (2019).
  • Jurcevic et al. [2021] P. Jurcevic, A. Javadi-Abhari, L. S. Bishop, I. Lauer, D. F. Bogorin, M. Brink, L. Capelluto, O. Günlük, T. Itoko, N. Kanazawa, A. Kandala, G. A. Keefe, K. Krsulich, W. Landers, E. P. Lewandowski, D. T. McClure, G. Nannicini, A. Narasgond, H. M. Nayfeh, E. Pritchett, M. B. Rothwell, S. Srinivasan, N. Sundaresan, C. Wang, K. X. Wei, C. J. Wood, J.-B. Yau, E. J. Zhang, O. E. Dial, J. M. Chow, and J. M. Gambetta, Demonstration of quantum volume 64 on a superconducting quantum computing system, Quantum Sci. Technol. 6, 025020 (2021).
  • Bäumer et al. [2023] E. Bäumer, V. Tripathi, D. S. Wang, P. Rall, E. H. Chen, S. Majumder, A. Seif, and Z. K. Minev, Efficient long-range entanglement using dynamic circuits (2023), arXiv:2308.13065 [quant-ph] .
  • Pokharel and Lidar [2023] B. Pokharel and D. A. Lidar, Demonstration of algorithmic quantum speedup, Phys. Rev. Lett. 130, 210602 (2023).
  • Pokharel and Lidar [2024] B. Pokharel and D. Lidar, Better-than-classical grover search via quantum error detection and suppression, npj Quantum Information 10 (2024).
  • Singkanipa et al. [2024] P. Singkanipa, V. Kasatkin, Z. Zhou, G. Quiroz, and D. A. Lidar, Demonstration of algorithmic quantum speedup for an abelian hidden subgroup problem (2024), arXiv:2401.07934 [quant-ph] .
  • Bäumer et al. [2024] E. Bäumer, V. Tripathi, A. Seif, D. Lidar, and D. S. Wang, Quantum fourier transform using dynamic circuits (2024), arXiv:2403.09514 [quant-ph] .
  • Gaikwad et al. [2024] C. Gaikwad, D. Kowsari, C. Brame, X. Song, H. Zhang, M. Esposito, A. Ranadive, G. Cappelli, N. Roch, E. M. Levenson-Falk, and K. W. Murch, Entanglement assisted probe of the non-markovian to markovian transition in open quantum system dynamics, Phys. Rev. Lett. 132, 200401 (2024).
  • Tripathi et al. [2024a] V. Tripathi, H. Chen, E. Levenson-Falk, and D. A. Lidar, Modeling low- and high-frequency noise in transmon qubits with resource-efficient measurement, PRX Quantum 5, 010320 (2024a).
  • Tripathi et al. [2024b] V. Tripathi, D. Kowsari, K. Saurav, H. Zhang, E. M. Levenson-Falk, and D. A. Lidar, Deterministic benchmarking of quantum gates (2024b), arXiv:2407.09942 [quant-ph] .
  • Maudsley [1986] A. A. Maudsley, Modified carr-purcell-meiboom-gill sequence for nmr fourier imaging applications, Journal of Magnetic Resonance (1969) 69, 488 (1986).
  • Javadi-Abhari et al. [2024] A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta, Quantum computing with qiskit (2024), arXiv:2405.08810 [quant-ph] .
  • Gross et al. [2024] J. A. Gross, E. Genois, D. M. Debroy, Y. Zhang, W. Mruczkiewicz, Z.-P. Cian, and Z. Jiang, Characterizing coherent errors using matrix-element amplification (2024), arXiv:2404.12550 [quant-ph] .
  • Uhrig and Lidar [2010] G. S. Uhrig and D. A. Lidar, Rigorous bounds for optimal dynamical decoupling, Physical Review A 82, 012301 (2010).
  • Peng et al. [2011] X. Peng, D. Suter, and D. A. Lidar, High fidelity quantum memory via dynamical decoupling: theory and experiment, Journal of Physics B: Atomic, Molecular and Optical Physics 44, 154003 (2011).
  • Morong et al. [2023] W. Morong, K. S. Collins, A. De, E. Stavropoulos, T. You, and C. Monroe, Engineering dynamically decoupled quantum simulations with trapped ions, PRX Quantum 4, 010334 (2023).