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

Simulating and mitigating crosstalk

Adam Winick Quantum Benchmark Inc., 51 Breithaupt Street
Suite 100, Kitchener, ON N2H 4C3, Canada
Institute for Quantum Computing, University of Waterloo, Waterloo, Canada
   Joel J. Wallman Quantum Benchmark Inc., 51 Breithaupt Street
Suite 100, Kitchener, ON N2H 4C3, Canada
Institute for Quantum Computing, University of Waterloo, Waterloo, Canada
   Joseph Emerson Quantum Benchmark Inc., 51 Breithaupt Street
Suite 100, Kitchener, ON N2H 4C3, Canada
Institute for Quantum Computing, University of Waterloo, Waterloo, Canada Canadian Institute for Advanced Research, Toronto, Ontario, Canada
Abstract

We describe an efficient and scalable framework for modeling crosstalk effects on quantum information processors. By applying optimal control techniques, we show how to tuneup arbitrary high-fidelity parallel operations on systems with substantial local and nonlocal crosstalk. Simulations show drastically lower error rates for a 2D square array of 100 superconducting transmon qubits. These results suggest that rather than striving to engineer away undesirable interactions during fabrication, we can largely mitigate their effects through careful characterization and control optimization.

Introduction. — The foremost obstacle to realizing practical quantum computing is its innate sensitivity to errors and noise. One facet of the problem is the dichotomy between the implementation of high-fidelity simultaneous one-qubit and high-fidelity two-qubit gates. Fast two-qubit gates require spatially or spectrally nearby qubits, which reduces the constituent subsystems’ addressability because a resonant pulse intended for one qubit can induce rotations on the others Gershenfeld and Chuang (1997); Pioro-Ladrière et al. (2008). Proposed architectures have typically dealt with this crosstalk by attempting to maximize the gap between qubits or by executing local operations asynchronously Schutjens et al. (2013); Piltz et al. (2013); Boixo et al. (2018). The former solution requires the ability to tune couplings or extra engineering, but the added complexity can adversely impact coherence times and requires additional control wires. In the latter approach, depending on the extent to which the control fields affect neighboring subsystems, the time overhead can be significant.

Crosstalk describes a broad range of effects that violate one of two assumptions: spatial locality and independence of operations Rudinger et al. (2019); Sarovar et al. (2019); Abrams et al. (2019). Gates and other operations are supposed to act on disjoint subsets of qubits. However, unintended interactions can couple the qubits, producing nonlocal correlated noise. Even if an operation has a well-defined action on a particular subset of qubits, the effective noise might depend on its context – what operations affect other qubits.

In this Letter, we introduce a scalable framework for accurately modeling idle and operation crosstalk on experimental devices. Our technique exploits the tensor product structure of local (classical) crosstalk to efficiently express its impact on gates. Through a perturbative expansion, we extend our ideas to nonlocal (quantum) crosstalk and capture its effects to arbitrary order. Provided there is a sufficient degree of control, we can try to minimize the effect of these errors. We illustrate our framework’s novel applications through a series of simulations of parallel gates on a square array of 100 superconducting transmon qubits. In our first experiment, we apply gradient-based optimization to the experimentally significant problem of implementing arbitrary elements of SU(2)n\text{SU}(2)^{\otimes n} on superconducting transmon qubits. Despite substantial local crosstalk, we show that error rates near the crosstalk-free limit are possible with modern control hardware. We further show how to tuneup simultaneous cross-resonance gates and, again, obtain dramatically higher error rates. Our results suggest that contrary to prevailing opinions Aude Craik et al. (2017); Neill et al. (2018); Reagor et al. (2018); Murali et al. (2020), crosstalk need not be a prohibitive limitation on noisy intermediate-scale quantum (NISQ) era devices Preskill (2018). Higher quality quantum information processors may be made possible by using our techniques to better balance the tradeoffs in device fabrication and pulse design.

Background. — Prior work has often approached the problem of implementing several operations on a collection of qubits by breaking it into a temporally disjoint sequence of gates. In contrast, Ref. Steffen et al. (2000) analyzed the problem of driving two spins with a homogenous field in the setting of NMR. However, it is unclear how to apply the method to multilevel systems such as transmons or trapped ions. Ref. Theis et al. (2016) studied how to drive two transmons coupled to the same cavity suffering from spectral crowding with simultaneous XX or YY gates with rotation angles π\pi and π/2\pi/2. In either case, these methods do not directly apply to many-qubit systems, nor do they handle nonlocal correlations. It is our objective to develop an efficient and systematic method for optimizing the implementation of nontrivial parallel operations under general crosstalk.

What crosstalk Sarovar et al. (2019) acts on physical qubits during idling or the implementation of gates (as opposed to preparation or measurement crosstalk), and how can we efficiently simulate and consequently, try to mitigate it? It is natural to classify crosstalk as either local or nonlocal. Local crosstalk can arise when a semiclassical drive field interacts with several qubits, causing unitary errors on supposedly idle qubits, but not entangling independent subsystems. Nonlocal crosstalk creates correlations that are nonfactorizable over system qubits and may originate from, for example, the residual static coupling between two qubits or miscalibration.

Quantifying and reducing crosstalk requires a figure of merit. Depending on the application, it makes sense to evaluate the average fidelity of one-qubit or two-qubit gates rather than the fidelity per clock cycle. Our ideas work in either case, but we focus on the former situation. Local error measures relate directly to fault-tolerance thresholds, are easier to estimate experimentally, and are more common in the literature. We show that the average local fidelity is especially simple to approximate.

Local crosstalk. — Although local crosstalk (typically) produces correlated noise, it can be factorized and simulated efficiently on a digital computer. The induced correlations are classical and do not entangle the individual subsystems. We model local crosstalk via the Hamiltonian

H(t,x)=kHk(t,x).H(t,\vec{x})=\sum_{k}H_{k}(t,\vec{x})\,. (1)

Each term HkH_{k} acts exclusively on subsystem kk, and x\vec{x} denotes shared classical parameters that result in crosstalk. The vector x\vec{x} may, for example, contain the phases and amplitudes that specify drive fields. The average process fidelity Φ\Phi Nielsen (2002); Carignan-Dugas et al. (2019) between a target operation U=U1UnU=U_{1}\otimes\dots\otimes U_{n} and the noisy implementation U~=U~1U~n\tilde{U}=\tilde{U}_{1}\otimes\dots\otimes\tilde{U}_{n}, where U~k=𝒯exp[i𝑑τHk(τ,x)]\tilde{U}_{k}=\mathcal{T}\exp[-i\int d\tau H_{k}(\tau,\vec{x})], can be expressed as

Φ(U,U~)=kΦ(Uk,U~k).\Phi(U,\tilde{U})=\prod_{k}\Phi(U_{k},\tilde{U}_{k})\,. (2)

The equation holds more generally when {U~k}\{\tilde{U}_{k}\} are CPTP maps, for example, when a dissipative process also affects the system or the control parameters fluctuate over time.

Nonlocal crosstalk. — Unlike local crosstalk, a digital computer cannot usually exactly simulate a large system affected by nonlocal crosstalk. Thus we develop a perturbative technique for simulating nonlocal crosstalk. Our approximation scheme characterizes a noise channel \mathcal{E} by estimating some of the associated Pauli error rates {pa}\{p_{a}\}. The Pauli-twirled noise channel is

𝒫(ρ)\displaystyle\mathcal{E}^{\mathcal{P}}(\rho) =1|𝒫n|a𝒫nPa(PaρPa)Pa\displaystyle=\frac{1}{\absolutevalue{\mathcal{P}^{n}}}\sum_{a\in\mathcal{P}^{n}}P_{a}^{\dagger}\mathcal{E}(P_{a}\rho P_{a}^{\dagger})P_{a} (3)
=a𝒫npaPaρPa,\displaystyle=\sum_{a\in\mathcal{P}^{n}}p_{a}P_{a}\rho P_{a}^{\dagger}\,, (4)

where 𝒫n\mathcal{P}^{n} is the Pauli group on nn qubits. These error rates provide a partial description of the noise affecting a quantum system and can assist in experimental device calibration. On large experimental devices, we can scalably and estimate the parameters in a way that is robust to state preparation and measurement (SPAM) errors Flammia and Wallman (2019). We might also combine the quantities to calculate holistic measures of device performance, such as the average two-qubit fidelity or global fidelity.

It is helpful to sketch our approach using a graphical model of the noise (see, e.g., Ref. Diestel (2005) for basic graph theory definitions). We construct a graph GG where each node is a strongly interacting subsystem during an operation of interest, such as a qubit during a single-qubit gate or a two-qubit pair entangled by a cross-resonance interaction. The entire target operation is factorizable over the tensor product space partitioning defined by the nodes. Edges denote nonlocal crosstalk that couples subsystems, and we only allow two-body coupling. We impose the constraint that the graph has limited connectivity (in a spatial spectral sense) since our approach relies on simulating subsystems. The constraint is satisfied in contemporary architectures where a majority of nodes have a degree of at most four.

Figure 1: Graphical model depicting a system of 20 qubits on a grid with nearest-neighbor nonlocal crosstalk. We highlight 1 of 31 (there are 31 edges; one for each nonlocal interaction) noise simulations needed to estimate all marginal weight-2 Pauli error probabilities with the approximation (d,o)=(1,2)(d,o)=(1,2). The blue and green nodes denote the target subsystem and the environment.

A pair of positive integers (d,o)(d,o) specifies the expansion order of the noise approximation; dd designates the ‘environment’ distance and oo the maximum component order. We consider the set 𝒢o\mathcal{G}_{o} of all components of all induced subgraphs of GG such that the order of every component is less than or equal to oo, and any component with an order less than oo has the same edges as in GG. I.e., we do not look at induced components with order less than oo. The idea of the simulation scheme is to calculate the Pauli errors that occur on each component.

We approximate the behavior of a component C𝒢oC\in\mathcal{G}_{o} by evolving it along with all vertices of distance at most dd, generating a map C,d\mathcal{E}_{C,d}. Next, we compute the diagonal of the Pauli-Liouville representation of the channel fC,df_{C,d}. A Walsh-Hadamard transformation WW relates fc,df_{c,d} to the Pauli probability vector p~C,d\tilde{p}_{C,d}, with fC,d=Wp~C,df_{C,d}=W\tilde{p}_{C,d} Flammia and Wallman (2019). The vector p~C,d\tilde{p}_{C,d} is the error probability distribution for a Pauli twirled copy of C,d\mathcal{E}_{C,d}. Marginalizing the error distribution over the environment produces an estimate of the local error distribution p~C\tilde{p}_{C} on the target component. After calculating the marginal distributions for all of the components in 𝒢o\mathcal{G}_{o}, we can use the theory of probabilistic graphical models Koller and Friedman (2009) to construct an estimate of the entire Pauli error distribution up to some specified error weight. By truncating the distribution at some error weight, the size of the distribution scales polynomially in the number of qubits.

In practice, including the nearest environmental nodes is sufficient to compute the local error distribution with high relative precision. We can intuitively understand the limited-depth requirement from the fact that intermediate systems must mediate the influence of one subsystem on a nonadjacent subsystem. One may formally bound these effects with Lieb-Robinson bounds Lieb and Robinson (1972).

Single-qubit gate engineering. — We review a typical implementation of single-qubit operations on transmons. A local oscillator acts as a single tone microwave source outputting a constant signal cos(ωt)\cos(\omega^{\prime}t) that is shaped by an arbitrary waveform generator via an IQ mixer. A good description of a transmon qubit is an anharmonic oscillator driven by microwave pulses. In the lab frame, the relevant Hamiltonian is

H=ωn^+α2(n^1)n^+Ω(t)cos(ωt+γ)(a^+a^)H=\omega\hat{n}+\frac{\alpha}{2}(\hat{n}-1)\hat{n}+\Omega(t)\cos(\omega^{\prime}t+\gamma)(\hat{a}+\hat{a}^{\dagger}) (5)

where a^\hat{a} is the annihilation operator of the oscillator, n^=a^a^\hat{n}=\hat{a}^{\dagger}\hat{a}, α\alpha is the anharmonicity, γ\gamma is the drive phase, ω\omega is the oscillator’s resonant frequency, Ω(t)\Omega(t) specifies the drive envelope, and we set =1\hbar=1.

The lowest two energy levels form the qubit subspace. Including the third energy level models the leading-order effect of leakage provided the anharmonicity is sufficiently large. After making a rotating wave approximation (RWA) and moving into the rotating frame of the qubit, the Hamiltonian projected into the qubit subspace is

H=12Ω(t)ei[γ+(ωω)t]|01|+h.c.H=\frac{1}{2}\Omega(t)e^{-i[\gamma+(\omega^{\prime}-\omega)t]}\outerproduct{0}{1}+\text{h.c.} (6)

To see how the control induces single-qubit gates, consider a resonant pulse (ω=ω\omega=\omega^{\prime}), and λ=0\lambda=0, which corresponds to an ideal sufficiently long pulse. The control generates XX and YY gates by modulating the coupling between the zero and one states, while the drive phase fixes the rotation axis in the XYXY-plane, and the pulse area sets the rotation angle. Rotations about the remaining ZZ-axis correspond to a change in the relative phase between the states. Rather than manipulating the transmon’s state, it is equivalent to rotate the control with respect to the state, realizing a virtual-ZZ gate Knill et al. (2000, 2008); McKay et al. (2017). We accomplish this physically by adding a phase offset to all subsequent gates. A pulse with an area 𝑑tΩ(t)=π/2\int dt\Omega(t)=\pi/2 and a relative phase offset γ\gamma generates the unitary V(γ)=ZγXπ/2ZγV(\gamma)=Z_{-\gamma}X_{\pi/2}Z_{\gamma} with the notation Aθ=exp(iθA/2)A_{\theta}=\exp(-i\theta A/2). Combining two of these phase-offset π/2\pi/2 pulses and a final virtual-ZZ realizes any element of SU(2)\text{SU}(2) McKay et al. (2017).

\begin{overpic}[width=411.93767pt]{large-single-qubit} \put(48.0,-4.0){$t_{\pi/2}$ (ns)} \put(-4.0,34.0){\rotatebox{90.0}{$\log_{10}r_{\text{avg}}$}} \end{overpic}
Figure 2: Plots illustrating a significant improvement in the average single-qubit process infidelity as a function of the time for a π/2\pi/2 gate (the total simulation time is 2tπ/22t_{\pi/2}). There are 100 qubits in a square 2D array, and each qubit implements a random element of SU(2)\text{SU}(2) via two π/2\pi/2 pulses with intermediate phase offsets. The red diamonds denote the infidelity of the qubits with half-derivative DRAG corrections and no crosstalk. The blue points are infidelities obtained under the same control with crosstalk. Circles, squares, and triangles denote several relative crosstalk strengths βij\beta_{ij}, that are sampled from a normal distribution with mean zero and standard deviations σ=0.05\sigma=0.05, σ=0.1\sigma=0.1, and σ=0.25\sigma=0.25 respectively. The green markers have identical crosstalk as their blue counterpart, but with optimized control parameters.

Consider the problem of implementing an arbitrary element of SU(2)n\text{SU}(2)^{\otimes n} concurrently on an ensemble of qubits where their respective drive fields weakly interact with other qubits. The semiclassical Hamiltonian governing transmon kk with local drive crosstalk is

Hk=ωkn^+αk2(n^1)n^+jβjkΩj(t)cos(ωjt+ϕj+θjk)(a^+a^).\begin{split}H_{k}&=\omega_{k}\hat{n}+\frac{\alpha_{k}}{2}(\hat{n}-1)\hat{n}\\ &+\sum_{j}\beta_{jk}\Omega_{j}(t)\cos(\omega_{j}^{\prime}t+\phi_{j}+\theta_{jk})(\hat{a}+\hat{a}^{\dagger})\,.\end{split} (7)

The parameters β\beta and θ\theta characterize the crosstalk affecting the system. We focus on the case where each transmon has a local drive. The crosstalk parameters are n×nn\times n matrices, and we can set βkk\beta_{kk} = 1 and θkk\theta_{kk} = 0 without loss of generality by modifying Ωk\Omega_{k} and ϕk\phi_{k}. These constraints lead us to interpret β\beta as the relative drive strength, and θ\theta as the phase lag. Experimental data supports the model Xia et al. (2015); Magesan and Gambetta (2018); Xue et al. (2019), and one can efficiently estimate the parameters with standard Rabi and Ramsey experiments.

We simulate a system of n=100n=100 transmons that evolve under (7) and include the first three energy levels. The qubits are on a square grid with βjk\beta_{jk} nonzero only for neighboring qubits. Qubits have a frequency of either ω/2π=3\omega/2\pi=3 GHz or ω/2π=3.1\omega/2\pi=3.1 GHz, and no two adjacent qubits have the same frequency. All qubits have anharmonicity α/2π=330\alpha/2\pi=-330 MHz. In each iteration of the experiment, the target gate is chosen randomly from SU(2)n\text{SU}(2)^{\otimes n}. The crosstalk phase lag parameter θjk\theta_{jk} are sampled randomly from the interval [0,2π)[0,2\pi), and we draw βjk\beta_{jk} from a normal distribution centered at zero. There are two discrete periods of successive evolution, each taking time tπ/2t_{\pi/2}. It is necessary to pick pulse shapes. On the one hand, we want pulses that yield error rates near the decoherence limit for short gate times. On the other hand, there are experimental realities, such as power-bandwidth constraints and the degree of calibration needed to implement complicated pulses accurately. Balancing these constraints, we pick Gaussian pulses with stdΩ(x)=tπ/2/4\operatorname{\text{std}}\Omega^{(x)}=t_{\pi/2}/4, and half-derivative DRAG corrections Ω(y)=Ω˙(x)/2α\Omega^{(y)}=-\dot{\Omega}^{(x)}/2\alpha Motzoi et al. (2009); Gambetta et al. (2011); Chen et al. (2016).

Fig. 2 shows the average single-qubit process infidelity ravg=1Φkr_{\text{avg}}=1-\expectationvalue{\Phi_{k}} as a function of tπ/2t_{\pi/2}. Green diamonds denote the raw infidelity for a crosstalk-free system (βjk=δjk\beta_{jk}=\delta_{jk}, where δjk\delta_{jk} is the Kronecker delta). The blue markers are infidelities obtained using the crosstalk-free control scheme but with various strengths of drive crosstalk. The red markers are infidelities obtained with optimized control and the same drive crosstalk as the blue markers. We optimize control pulses with the method of Ref. Machnes et al. (2018). Applying the protocol requires the selection of appropriate optimization parameters. Sticking to our simple control ansatz, we tune the overall magnitude of the resonant Ω(x)\Omega^{(x)} quadrature, off-resonant Ω(y)\Omega^{(y)} quadrature and the carrier signal phase ϕ\phi, for a total of 7n7n parameters. We observe approximately two orders of magnitude improvement in the infidelity with our crosstalk minimization technique.

In real experimental devices, decoherence significantly reduces the average error rates. Moreover, decoherence errors grow with time, whereas control errors typically decrease. These contrasting effects imply that there is an optimal gate time that minimizes their combined errors. We repeat the simulation implementing SU(2)n\text{SU}(2)^{\otimes n} with decoherence added to the model. Table 1 presents data showing the potential benefit of our methods.

Crosstalk Original Opt., tπ/2=2t_{\pi/2}=2 ns Opt., tπ/2=5t_{\pi/2}=5 ns
stdβjk\operatorname{\text{std}}\beta_{jk} ravgr_{\text{avg}} ravgr_{\text{avg}} ravgr_{\text{avg}}
0.05 6.02e-4 1.00e-4 1.86e-4
0.1 7.13e-4 1.03e-4 1.91e-4
0.25 2.13e-3 1.15e-4 1.84e-4
0.5 1.77e-2 1.07e-4 1.81e-4
Table 1: Data highlighting a dramatic reduction in the average single-qubit process infidelity for a simulation with realistic decoherence on a square array of 100 qubits and various levels of crosstalk (stdβjk\operatorname{\text{std}}\beta_{jk}). We model the same system considered in Fig. 2, but with T1𝒩(40 μs,5 μs)T_{1}\sim\mathcal{N}(40\text{ $\mu$s},5\text{ $\mu$s}) for each qubit, and T2=3T1/2T_{2}=3T_{1}/2. Naturally, there is an optimal gate time that minimizes the combined incoherent (increasing) and coherent (approximately decreasing) effects. We optimize the controls for tπ/2=1,2,,50t_{\pi/2}=1,2,\dots,50 ns. The ‘Original’ column corresponds to the optimal tπ/2t_{\pi/2} without control tuneup. For all values of stdβj,k\operatorname{\text{std}}\beta_{j,k}, ravgr_{\text{avg}} is minimized at tπ/2=2t_{\pi/2}=2 ns. On contemporary experimental devices, tπ/2=2t_{\pi/2}=2 ns exceeds accesible bandwidths, so we also report ravgr_{\text{avg}} for tπ/2=5t_{\pi/2}=5 ns.

Two-qubit gate engineering. — We continue our simulations using the ideal system of fixed-frequency transmons and the parameter values specified above. Our aim is to implement parallel cross-resonance gates Rigetti et al. (2005); Chow et al. (2011); Sheldon et al. (2016); Magesan and Gambetta (2018); Allen et al. (2019), which are equivalent to CNOTs up to single-qubit operations. Constant capacitive coupling provides a mechanism for implementing entangling operations. Assuming equal coupling between all neighboring qubits in the system, the corresponding interaction Hamiltonian is

Hint=Jj,k=1ajak+ajak,H_{\text{int}}=J\sum_{\langle j,k\rangle=1}a_{j}a_{k}^{\dagger}+a_{j}^{\dagger}a_{k}\,, (8)

where j,k=1\langle j,k\rangle=1 denotes a sum over all adjacent qubit pairs. The entire system evolves under Hint+kHkH_{\text{int}}+\sum_{k}H_{k}.

The basic idea of the cross resonance effect is that if we define the qubits in a dressed basis, local microwave drive fields drive both single and two-qubit gates. For two ideal coupled qubits, in the dressed basis, a drive applied to qubit 1 at the frequency of qubit 2 yields the effective Hamiltonian

Hd=Ω(t)(X1JΔZ1X2),H_{d}=\Omega(t)\left(X_{1}-\frac{J}{\Delta}Z_{1}X_{2}\right)\,, (9)

where Δ=ω1ω2\Delta=\omega_{1}-\omega_{2} is the difference of qubit frequencies and we made an RWA. Although we can decouple the direct qubit coupling, higher-levels of the transmon lead to additional terms in the effective Hamiltonian Magesan and Gambetta (2018). We can use the Z1X2Z_{1}X_{2} term to generate a maximally entangling gate.

\begin{overpic}[width=411.93767pt]{large-two-qubit} \put(48.0,-4.0){$t_{\text{CR}}$ (ns)} \put(-4.0,26.0){\rotatebox{90.0}{$\log_{10}\expectationvalue{1-\Phi_{\text{CR}}}$}} \end{overpic}
Figure 3: Plots showing a massive improvement in the average two-qubit process infidelity for a square array of transmons implementing 50 simultaneous maximally entangling gates via CR interactions. Each two-qubit pair approximates a CNOT-gate up to local operations. The red diamonds correspond to CR gate infidelities obtained without drive crosstalk or subsystem coupling. The blue squares are infidelities obtained with the same controls as the green diamonds but with drive crosstalk as in the single-qubit example (σ=0.1\sigma=0.1) and constant nonlocal coupling between all adjacent qubits. The green triangles have the same crosstalk as the above model, but with optimized control parameters.

Again, we simulate a system of n=100n=100 transmons on a grid and include the first three energy levels of each. We group adjacent qubits in pairs and try to implement 50 simultaneous maximally entangling gates using the CR effect. Our qubits have 8 distinct frequencies (3.0,3.1,,3.73.0,3.1,\dots,3.7 GHz) to ensure each CR pair is addressable. We set the frequencies so that no two neighbors of one qubit have the same frequency. The target CNOT equivalent is determined using Cartan’s KAK decomposition Tucci (2005) and is invariant to local operations. The qubit coupling strength is J/2π=3.8J/2\pi=3.8 MHz. We realize qubit control with the same drives as above but with variable drive detuning and phase offset. We independently parameterize the resonant Ω(x)\Omega^{(x)} and off-resonant Ω(y)\Omega^{(y)} control envelopes with the first three Hanning window functions

ΩH(t)=k=13ck[1cos(2πkttCR)].\Omega_{H}(t)=\sum_{k=1}^{3}c_{k}\left[1-\cos(\frac{2\pi kt}{t_{\text{CR}}})\right]\,. (10)

There are a total of 8n8n parameters that determine the nn drive fields.

Fig. 3 shows the average two-qubit process infidelity of each entangling gate as a function of the gate duration tCRt_{\text{CR}}. We compute all points with optimized pulse parameters Machnes et al. (2018) but under different system models. Red diamonds denote the infidelity obtained using a drive-crosstalk-free model and no undesirable JJ coupling. The blue squares are infidelities calculated using the crosstalk-free optimal control but with added drive crosstalk (σ=0.1\sigma=0.1) and nonlocal coupling. The green triangles are infidelities obtained with controls tuned up under the crosstalk model. We approximate the nonlocal crosstalk effects with d=1d=1. The deviation caused by including additional neighbors is unresolvable on the plot.

Conclusion. — We have described techniques to efficiently model and minimize crosstalk that occurs during qubit idling and gates. Compared to other quantum control methods such as dynamical decoupling Viola et al. (1999), which attempts to echo out undesirable interactions, we change parameters so the effects do not appear in the first place. Our results show how to mitigate such effects on transmons using a fast control tuneup procedure on a digital computer. We hope that these methods aid in understanding the role of crosstalk on NISQ devices and validate improved pulse shapes. We plan to extend our simulation capabilities to other platforms such as trapped ions and apply our methods to improve the performance of experimental platforms.

Acknowledgments. — We thank Ian Hincks and Dar Dahlen for helpful discussions and feedback on the manuscript. This research was supported by the U.S. Army Research Office through grant W911NF-14-1-0103 and Quantum Benchmark Inc.

References