Skip to content

A gate specifies how a quantum state should change. A pulse specifies the time-dependent field used to make that change. Converting one into the other requires a model of the device, a phase reference, an amplitude calibration and a schedule. The same gate can therefore require different waveforms on two qubits, or on the same qubit after its frequency has drifted.

We follow this conversion from a driven two-level Hamiltonian to sampled controls and the field actually delivered to the device. A recurring lesson is that a waveform’s samples alone do not specify a gate: units, carrier phase, reconstruction and neighboring operations also matter.

Required background. Circuit representations describe timing and outputs; single-qubit gates define rotations; control and readout introduces the hardware chain; Rabi and Ramsey control explains driven rotations and detuning.

A common finite-dimensional model is

H(t;θ)=H0(θ)+∑k=1Kuk(t)Hk(θ),H(t;\theta) = H_0(\theta) + \sum_{k=1}^{K} u_k(t)H_k(\theta),

where H0H_0 is the drift Hamiltonian, HkH_k are control generators, uk(t)u_k(t) are real control functions, and θ\theta collects device parameters. In a closed model, the propagator satisfies

iℏdU(t)dt=H(t)U(t),U(0)=I,i\hbar\frac{dU(t)}{dt} = H(t)U(t), \qquad U(0)=I,

and hence

U(T)=Texp⁡ ⁣[−iℏ∫0TH(t) dt].U(T) = \mathcal T \exp\!\left[ -\frac{i}{\hbar} \int_0^T H(t)\,dt \right].

The time-ordering symbol T\mathcal T matters whenever Hamiltonians at different times fail to commute. Equal pulse areas then need not imply equal gates. Shape, order, detuning, and concurrent controls can all matter.

For an open model one may instead propagate

dρdt=−iℏ[H(t),ρ]+∑jγj(t)D[Lj]ρ,\frac{d\rho}{dt} = -\frac{i}{\hbar}[H(t),\rho] + \sum_j \gamma_j(t) \mathcal D[L_j]\rho,

with

D[L]ρ=LρL†−12{L†L,ρ}.\mathcal D[L]\rho = L\rho L^\dagger - \frac{1}{2} \left\{ L^\dagger L,\rho \right\}.

Here γj(t)≥0\gamma_j(t)\geq0 gives a time-local Lindblad model with completely positive divisible evolution. This Markovian description is useful but not universal. Colored noise, drift, state-dependent electronics, coherent spectators, and non-Markovian environments may require a larger model. Quantum Channels and Noise develops these distinctions.

The matrices HkH_k are inferred approximations. Their coefficients can depend on drive amplitude, frequency, bias, neighboring excitations, and earlier pulses. Truncating an oscillator or motional Hilbert space can also change the predicted optimum. A waveform optimized against H(t;θ^)H(t;\hat\theta) is a prediction to test against the actual operation.

Carrier phase determines the rotation axis

Section titled “Carrier phase determines the rotation axis”

One common real carrier convention is

s(t)=I(t)cos⁡(ωLOt)−Q(t)sin⁡(ωLOt)=Re⁡[ε(t)eiωLOt].\begin{aligned} s(t)&=I(t)\cos(\omega_{\mathrm{LO}}t) -Q(t)\sin(\omega_{\mathrm{LO}}t)\\ &=\operatorname{Re}\left[\varepsilon(t)e^{i\omega_{\mathrm{LO}}t}\right]. \end{aligned}

Here the complex envelope is

ε(t)=I(t)+iQ(t).\varepsilon(t)=I(t)+iQ(t).

Other sign and phase conventions are equally usable. They are not interchangeable. Mixer wiring, Fourier-transform conventions, local-oscillator phase, and software definitions can reverse the meaning of QQ or of a positive phase shift. Use one explicit convention throughout the control program.

Consider the laboratory-frame two-level model

Hlab(t)ℏ=ωq2σz+Ω(t)cos⁡(ωdt+ϕ)σx.\frac{H_{\mathrm{lab}}(t)}{\hbar} = \frac{\omega_q}{2}\sigma_z + \Omega(t) \cos(\omega_d t+\phi) \sigma_x.

With the rotating-frame transformation

R(t)=e−iωdtσz/2,∣ψrot⟩=R†(t)∣ψlab⟩,R(t)=e^{-i\omega_d t\sigma_z/2}, \qquad \lvert\psi_{\mathrm{rot}}\rangle = R^\dagger(t) \lvert\psi_{\mathrm{lab}}\rangle,

and detuning Δ=ωq−ωd\Delta=\omega_q-\omega_d, the rotating-wave approximation removes the rapidly oscillating terms near 2ωd2\omega_d. For a slowly varying envelope with ∣Ω∣,∣Δ∣≪ωd|\Omega|,|\Delta|\ll\omega_d, it gives

Hrot(t)ℏ≃Δ2σz+Ω(t)2σϕ,\frac{H_{\mathrm{rot}}(t)}{\hbar} \simeq\frac{\Delta}{2}\sigma_z+\frac{\Omega(t)}{2}\sigma_\phi,

where the equatorial axis is

σϕ=cos⁡ϕ σx+sin⁡ϕ σy.\sigma_\phi=\cos\phi\,\sigma_x+\sin\phi\,\sigma_y.

On resonance, the envelope area sets the rotation angle:

Rϕ(ϑ)=e−iϑσϕ/2,ϑ=∫0TΩ(t) dt.\begin{aligned} R_\phi(\vartheta)&=e^{-i\vartheta\sigma_\phi/2},\\ \vartheta&=\int_0^T\Omega(t)\,dt. \end{aligned}

This area rule is exact only for the stated effective Hamiltonian. Detuning, counter-rotating terms, amplitude-dependent shifts, leakage levels, and distorted envelopes change it. The Rotating-Wave Approximation page develops the approximation and its validity conditions.

Virtual Z gates and the sign of the phase shift

Section titled “Virtual Z gates and the sign of the phase shift”

The identity

Rϕ(ϑ)=Rz(ϕ)Rx(ϑ)Rz(−ϕ)R_\phi(\vartheta) =R_z(\phi)R_x(\vartheta)R_z(-\phi)

lets us implement ZZ rotations by changing the phases of subsequent controls. To fix the sign, define a stored angle ff by

∣ψlogical⟩=Rz(f)∣ψphysical⟩.|\psi_{\mathrm{logical}}\rangle =R_z(f)|\psi_{\mathrm{physical}}\rangle.

Initially f=0f=0. A requested logical Rz(λ)R_z(\lambda) can be implemented by setting f←f+λf\leftarrow f+\lambda without driving the qubit. A later logical Rϕ(ϑ)R_\phi(\vartheta) must then use physical phase ϕ−f\phi-f, since

Rϕ(ϑ)Rz(f)=Rz(f)Rϕ−f(ϑ).\begin{aligned} R_\phi(\vartheta)R_z(f) &=R_z(f)R_{\phi-f}(\vartheta). \end{aligned}

The stored frame must also transform later interactions and phase-sensitive measurements. Computational-basis measurement is unchanged because it commutes with Rz(f)R_z(f). For a general logical observable OO, use the physical observable Rz(−f)ORz(f)R_z(-f)OR_z(f).

Some control systems define their phase cursor with the opposite sign. Translate their phase-update instruction into the state relation above before assigning a sign to a virtual gate. McKay and colleagues explain the physical use of virtual ZZ gates; the interaction picture gives the general change-of-frame law. A virtual gate needs no separate waveform, but its reference must persist until every dependent operation has been interpreted.

A calibrated pulse can remain an analytic family, with angle, duration, physical qubit and phase as parameters, until it is sampled for the hardware. This retains relationships such as equal pulse areas or shared phases. Record the actual parameters and samples as well: evaluating a symbolic formula with a different grid or normalization can change its action.

For a weakly anharmonic qubit, a short resonant drive also couples the computational transition to nearby levels. A common envelope pair is

ΩI(t)=Af(t),ΩQ(t)≃−1αdΩI(t)dt,\begin{aligned} \Omega_I(t) &= A f(t), \\ \Omega_Q(t) &\simeq -\frac{1}{\alpha} \frac{d\Omega_I(t)}{dt}, \end{aligned}

where α=ω12−ω01\alpha=\omega_{12}-\omega_{01} in one widespread convention. This is the leading DRAG mnemonic, not a universal formula. Definitions of α\alpha, quadrature sign, carrier phase, Stark-shift correction, truncation, and envelope normalization alter the calibrated coefficient.

The important point is that a nominal Xπ/2X_{\pi/2} may lower to several coordinated actions: an in-phase envelope, a derivative quadrature, a detuning or frame correction, and an updated phase cursor. Omitting one field because another backend calls it metadata can change the gate.

Leakage should be tracked separately from in-subspace fidelity. If PCP_{\mathcal C} projects onto the computational subspace, one state-dependent diagnostic is

pleak(T;ρ0)=1−Tr⁡[PCρ(T)].p_{\mathrm{leak}}(T;\rho_0) = 1- \operatorname{Tr} \left[ P_{\mathcal C}\rho(T) \right].

Postselecting the leaked population away and renormalizing the remainder can make an in-subspace operation look deceptively good. State the leakage metric, the input ensemble, and whether return from leakage is modeled.

Driven two-qubit gates rarely produce only one Pauli interaction. An effective Hamiltonian may be expanded as

Heff(t)ℏ=∑μ,ν∈{I,X,Y,Z}cμν(t)σμ⊗σν.\frac{H_{\mathrm{eff}}(t)}{\hbar} = \sum_{\mu,\nu\in\{I,X,Y,Z\}} c_{\mu\nu}(t) \sigma_\mu\otimes\sigma_\nu.

A target ZXZX, ZZZZ, or exchange term can coexist with local rotations, conditional phases, Stark shifts, leakage couplings, and spectator terms. Echoes, cancellation tones, local frame updates, and pre- or post-rotations may be part of one calibrated gate implementation.

The coefficients can vary nonlinearly with amplitude and simultaneous context. For this reason, pulse lowering should bind a two-qubit gate to an ordered, timed block with declared exclusive resources rather than treating its waveforms as independent decorations on a circuit node. Multi-Qubit Gates explains the ideal gate families; platform pages explain the physical interactions.

A pulse intermediate representation (IR) describes both fields and events. The main objects have simple physical meanings:

Object Meaning Example of a mistake
Port Delivery or acquisition path Treating two names for one DAC as independent
Frame Frequency, phase and reference clock Losing phase after a frequency update
Waveform and play Envelope and the port on which it is emitted Confusing voltage with angular frequency
Delay and alignment Waiting and relative start times Treating an idle as identity dynamics
Acquisition Capture window and processing of a signal Using a bit before classification finishes
Branch Action chosen from a classical result Changing a frame on only one path without tracking it

The OpenQASM pulse specification connects gates to control instructions through defcal and a selected pulse grammar such as OpenPulse. Such definitions bind to physical qubits because calibrations are usually qubit-specific. In the current specification, defcal durations, including branch durations, must be definite at compile time. General pulse-control systems need not impose that same restriction. Quil-T offers another concrete representation; syntax and capabilities must be checked against the system actually used.

Between explicit updates, a physical oscillator reference obeys

ϕf(t)=ϕf(t0)+∫t0tωf(t′) dt′.\phi_f(t)=\phi_f(t_0)+\int_{t_0}^{t}\omega_f(t')\,dt'.

Changing frequency therefore changes subsequent phase accumulation. Changing phase directly changes the reference immediately. These are different instructions, even when both are instantaneous software updates.

Frequency may mean cycles per second or radians per second. Phase may be stored in radians, turns, or fixed-point accumulator units. Envelope amplitude may be a normalized DAC fraction, a voltage, an optical power parameter, a magnetic field, a flux, or an effective angular frequency. Time may be seconds or an integer number of device ticks.

Unit conversion must therefore be explicit. The equality

ω=2πf\omega=2\pi f

is elementary, yet confusing ω\omega and ff creates a factor-2π2\pi pulse error. A type system should reject, or at least loudly diagnose, an operation that adds a phase to a frequency or interprets a duration as a sample count without a clock domain.

Let u[n]u[n] be digital samples on a grid tn=nΔtt_n=n\Delta t. The commanded continuous envelope can be modeled as

ucmd(t)=∑nu[n] b(t−nΔt),u_{\mathrm{cmd}}(t) = \sum_n u[n]\, b(t-n\Delta t),

where b(t)b(t) is the reconstruction kernel. A zero-order hold, linear interpolation, numerically controlled oscillator, and vendor-specific digital upconverter do not produce the same waveform from the same numbers.

The sample rate alone does not settle realizability. One must also specify:

  • amplitude and phase quantization;
  • allowed duration and start-time granularity;
  • waveform-memory and instruction-memory limits;
  • interpolation and digital filtering;
  • carrier generation and image rejection;
  • trigger, skew, and jitter specifications;
  • clipping, saturation, and accumulator overflow behavior.

Nyquist reasoning is necessary for band-limited reconstruction but does not guarantee that mixers, filters, amplifiers, or the device coupling preserve the intended spectrum.

If a duration TT must lie on a grid Δt\Delta t, the materialized duration is

T′=NΔt,N∈N.T'=N\Delta t, \qquad N\in\mathbb N.

Rounding TT while leaving amplitude fixed changes pulse area. Rescaling the amplitude to preserve area changes peak power and spectral content. Changing the shape can invalidate a calibration entirely. The compiler must apply the declared policy and record the result; silently rounding each instruction is not semantics preserving.

Pulse scheduling is a resource-constrained timing problem. Dependencies from the circuit remain, but additional conflicts appear:

  • two logical channels may share one DAC, oscillator, beam, resonator, or amplifier;
  • a calibrated block may reserve neighboring spectators even when it emits no waveform on them;
  • frame updates and waveform plays on one channel must have a defined order;
  • measurement stimulus, ring-up, integration, classification, and reset occupy different resources for different intervals;
  • feedback can begin only after the relevant classical result reaches the sequencer that consumes it.

For a serial timing model, acquisition starts at tat_a, lasts TaT_a, classification then takes TcT_c, and transport plus branch dispatch takes TbT_b. A dependent pulse cannot begin before

tready≥ta+Ta+Tc+Tb.t_{\mathrm{ready}} \ge t_a+T_a+T_c+T_b.

This is a data-availability bound for that serial model. If integration, classification and transport overlap in a streaming implementation, use the actual critical path instead of adding their full durations. In either case, the branch must wait until its required result is available.

Concurrency also changes physics. A schedule with no port conflicts may still be invalid because simultaneous drives alter Stark shifts, activate crosstalk, saturate a shared element, or heat the device. Error-Aware Compilation compares schedules using measured crosstalk and calibration uncertainty. Pulse scheduling must expose enough resource and context information for that ranking to be meaningful.

During suitable waiting intervals, dynamical decoupling may reduce dephasing. Its extra pulses must fit the available interval and preserve the intended operation, including accumulated phase.

The digital envelope is not the field at the device. In a linear multi-input approximation,

uidev(t)=∑j∫hij(t−t′)ujcmd(t′) dt′.u_i^{\mathrm{dev}}(t) = \sum_j \int h_{ij}(t-t') u_j^{\mathrm{cmd}}(t')\,dt'.

The diagonal terms describe each path’s filtering and delay; off-diagonal terms describe classical crosstalk. In frequency space,

Udev(ω)=H(ω)Ucmd(ω).\mathbf U_{\mathrm{dev}}(\omega) = \mathbf H(\omega) \mathbf U_{\mathrm{cmd}}(\omega).

Predistortion seeks a command whose delivered field approaches a target. A naive inverse H−1(ω)\mathbf H^{-1}(\omega) can amplify noise or demand impossible amplitude near small singular values. Regularization, bandwidth limits, and experimental validation are required.

Measure the transfer behavior where possible, and retain the delay and predistortion settings used for the pulse. Gustavsson and colleagues used a qubit itself to detect microwave pulse distortion, illustrating why a command measured upstream need not describe the field at the device.

A pulse can continue after the command stops

Section titled “A pulse can continue after the command stops”

Take a causal first-order response h(t)=e−t/τ/τh(t)=e^{-t/\tau}/\tau for t≥0t\geq0, and zero for t<0t<0. For a rectangular command of amplitude AA on 0≤t<T0\leq t<T, convolution gives, during the command,

udev(t)=A(1−e−t/τ).u_{\mathrm{dev}}(t)=A(1-e^{-t/\tau}).

After it ends, for t≥Tt\geq T,

udev(t)=A(1−e−T/τ)e−(t−T)/τ.u_{\mathrm{dev}}(t)=A(1-e^{-T/\tau})e^{-(t-T)/\tau}.

A rectangular command ends at four response times, while the delivered drive rises gradually and continues with a decaying tail.

Finite response time rounds the leading edge and produces a tail after the command ends. Here T=4τT=4\tau. The total area is preserved by this unit-gain linear filter, but part arrives too late to belong to the nominal gate.

In the commuting resonant model, the rotation angle is the delivered area. At the nominal end time,

ϑ(T)=A[T−τ(1−e−T/τ)].\vartheta(T)=A[T-\tau(1-e^{-T/\tau})].

The missing area Aτ(1−e−T/τ)A\tau(1-e^{-T/\tau}) arrives in the tail; the total area out to infinite time is ATAT. This does not make the distortion harmless: the next pulse or measurement may begin while the unwanted tail is still present. A different rotation axis or detuning also invalidates a comparison based on area alone.

Comparing the implemented operation with the target

Section titled “Comparing the implemented operation with the target”

First check units, supported sample grids, amplitude limits, shared resources and feedback timing. These checks establish that a pulse can run; they do not establish which quantum operation it performs.

For a model prediction, propagate the dispatched samples through the reconstruction and delivery model. Increase the Hilbert-space truncation and reduce the integration time step until the observables of interest converge. Test plausible detuning, gain and spectator states as well as the nominal parameters. Optimal control explains how waveforms are optimized against such models.

For a trace-preserving channel on a dd-dimensional space, the average gate fidelity relative to a target unitary UU is

Favg(E,U)=dFe(U†∘E)+1d+1.F_{\mathrm{avg}}(\mathcal E,U) =\frac{dF_e(U^\dagger\circ\mathcal E)+1}{d+1}.

Here FeF_e is the entanglement fidelity for the maximally mixed input, equivalently the overlap obtained by applying the error channel to one half of a normalized maximally entangled state. Nielsen derives this relation. It does not apply unchanged to projection followed by renormalization: projection onto the qubit space is generally trace decreasing, and input-dependent renormalization is nonlinear. Retain leakage outcomes or report their probability separately.

On the device, repeated-pulse experiments can expose coherent errors, benchmarking tests a specified ensemble of operations, and leakage measurements test escape from the computational space. Check simultaneous operation and use independent data to assess a pulse tuned on earlier measurements. Changed device frequencies, gains or delivery paths can require recalibration; calibration loops describes that process.

Consider a target Xπ/2X_{\pi/2} rotation under the resonant effective model

Heffℏ=Ω2σx\frac{H_{\mathrm{eff}}}{\hbar} = \frac{\Omega}{2}\sigma_x

for a duration T=20 nsT=20\,\mathrm{ns}. A constant-envelope arithmetic model gives

ΩT=π2,\Omega T = \frac{\pi}{2},

so

Ω2π=14T=12.5 MHz.\frac{\Omega}{2\pi} = \frac{1}{4T} = 12.5\,\mathrm{MHz}.

At a 2 GSa/s2\,\mathrm{GSa/s} envelope rate, Δt=0.5 ns\Delta t=0.5\,\mathrm{ns} and the duration occupies

N=TΔt=40N = \frac{T}{\Delta t} = 40

sample intervals. This count refers to forty held sample intervals, not necessarily forty endpoint values in an interpolation scheme. The amplitude must still be converted from a Rabi rate to the calibrated hardware units. The abrupt rectangular envelope is useful for arithmetic but usually poor as a literal command because its broad spectrum excites unwanted dynamics; an actual calibration would commonly use shaped edges or a smooth envelope.

Suppose the delivered gain is high by a fractional amount ϵ\epsilon. In the same simplified model, the angle error is

δϑ=ϵπ2.\delta\vartheta = \epsilon\frac{\pi}{2}.

For a unitary overrotation about the correct axis, the one-qubit average gate fidelity is

Favg=2+cos⁡δϑ3≃1−δϑ26.F_{\mathrm{avg}} = \frac{2+\cos\delta\vartheta}{3} \simeq 1-\frac{\delta\vartheta^2}{6}.

With ϵ=0.01\epsilon=0.01, this model predicts 1−Favg≃4.1×10−51-F_{\mathrm{avg}}\simeq4.1\times10^{-5}. That number is not a hardware specification. Detuning, leakage, pulse distortion, decoherence, state preparation and measurement, and repeated coherent accumulation are absent. Use the calculation to check units and scale, then measure the implemented operation rather than treating this idealized infidelity as a specification.

A resonant effective Hamiltonian is H/ℏ=Ωσx/2H/\hbar=\Omega\sigma_x/2. Find the constant Ω/(2π)\Omega/(2\pi) needed for an XπX_\pi gate in 40 ns40\,\mathrm{ns}. Explain the error made by entering that number as an angular frequency in radians per second.

Solution

The area condition is

ΩT=π.\Omega T=\pi.

Therefore

Ω2π=12T=12.5 MHz.\frac{\Omega}{2\pi} = \frac{1}{2T} = 12.5\,\mathrm{MHz}.

The angular frequency is

Ω=2π×12.5 MHz.\Omega = 2\pi\times12.5\,\mathrm{MHz}.

Entering 12.5×10612.5\times10^6 as though it were Ω\Omega under-rotates by a factor of 2π2\pi. The numerical field must be typed as cyclic frequency or angular frequency rather than inferred from context.

Using the carrier and rotating-frame conventions on this page, show that a drive proportional to cos⁡(ωdt+ϕ)\cos(\omega_d t+\phi) produces the RWA axis cos⁡ϕ σx+sin⁡ϕ σy\cos\phi\,\sigma_x+\sin\phi\,\sigma_y.

Solution

For R(t)=e−iωdtσz/2R(t)=e^{-i\omega_d t\sigma_z/2},

R†σxR=cos⁡(ωdt)σx−sin⁡(ωdt)σy.R^\dagger\sigma_xR = \cos(\omega_dt)\sigma_x - \sin(\omega_dt)\sigma_y.

Multiply by

cos⁡(ωdt+ϕ)=cos⁡(ωdt)cos⁡ϕ−sin⁡(ωdt)sin⁡ϕ.\cos(\omega_dt+\phi)=\cos(\omega_dt)\cos\phi -\sin(\omega_dt)\sin\phi.

The terms oscillating at 2ωd2\omega_d average away under the RWA. The surviving products have averages 1/21/2, giving

Ω(t)2(cos⁡ϕ σx+sin⁡ϕ σy).\frac{\Omega(t)}{2} \left( \cos\phi\,\sigma_x + \sin\phi\,\sigma_y \right).

Changing the rotating-frame or I/Q sign convention can change the displayed sign, which is why the convention belongs in the target profile.

Starting with f=0f=0, a program requests Rx(π/2)R_x(\pi/2), then a virtual Rz(λ)R_z(\lambda), then another Rx(π/2)R_x(\pi/2). Which physical phase must the second pulse use? Show how the final frame recovers the desired operation.

Solution

The first pulse has phase zero. After the virtual gate, f=λf=\lambda, so the second physical pulse has phase −λ-\lambda and axis cos⁡λ X−sin⁡λ Y\cos\lambda\,X-\sin\lambda\,Y. With a=π/2a=\pi/2, the physical evolution is R−λ(a)Rx(a)R_{-\lambda}(a)R_x(a). Interpreting the final state in frame ff gives

Rz(λ)R−λ(a)Rx(a)=Rx(a)Rz(λ)Rx(a),R_z(\lambda)R_{-\lambda}(a)R_x(a) =R_x(a)R_z(\lambda)R_x(a),

which is the requested sequence in right-to-left matrix order. Forgetting the final frame would lose the logical ZZ action even if the drive phase were correct. A computational-basis measurement is frame invariant, but a later equatorial measurement must use the transformed axis.

A calibrated pulse has T=21.3 nsT=21.3\,\mathrm{ns}, while a backend requires Δt=0.5 ns\Delta t=0.5\,\mathrm{ns}. Compare rounding to 21.5 ns21.5\,\mathrm{ns} while holding amplitude fixed with rescaling amplitude to preserve area.

Solution

The nearest supported duration is 4343 ticks, or 21.5 ns21.5\,\mathrm{ns}. Holding amplitude fixed increases area by

21.521.3−1≃9.39×10−3.\frac{21.5}{21.3}-1 \simeq 9.39\times10^{-3}.

To preserve area in a commuting model, multiply amplitude by

21.321.5≃0.99070.\frac{21.3}{21.5} \simeq 0.99070.

Neither operation is automatically calibration preserving. The first changes angle; the second changes amplitude-dependent shifts, leakage, and spectral response. The correct policy is to select or recalibrate a supported member of the waveform family and record the materialized parameters.

At one frequency, suppose

H=(10.080.051).\mathbf H = \begin{pmatrix} 1 & 0.08\\ 0.05 & 1 \end{pmatrix}.

Find the command vector that would produce the target delivered vector (1,0)T(1,0)^{\mathsf T} in this linear model. Why is this calculation not yet a safe predistortion policy?

Solution

The inverse is

H−1=11−0.004(1−0.08−0.051).\mathbf H^{-1} = \frac{1}{1-0.004} \begin{pmatrix} 1 & -0.08\\ -0.05 & 1 \end{pmatrix}.

Thus

Ucmd=H−1(10)=10.996(1−0.05)≃(1.0040−0.0502).\begin{aligned} \mathbf U_{\mathrm{cmd}} &=\mathbf H^{-1}\begin{pmatrix}1\\0\end{pmatrix}\\ &=\frac{1}{0.996}\begin{pmatrix}1\\-0.05\end{pmatrix}\\ &\simeq\begin{pmatrix}1.0040\\-0.0502\end{pmatrix}. \end{aligned}

This is only a single-frequency, linear, perfectly known inversion. A usable policy must consider the full bandwidth, uncertainty, small singular values, amplitude limits, causality, nonlinear response, and experimental validation.

A pulse leaves probability 0.020.02 outside the computational subspace. After projecting onto the computational subspace and renormalizing, the remaining state has squared overlap 0.9990.999 with a pure target in that subspace. Why is reporting only 0.9990.999 misleading?

Solution

The reported number conditions on no leakage and discards two percent of the outcomes. Because the target lies entirely in the computational subspace, its unconditional squared overlap is exactly

(1−0.02)×0.999=0.97902(1-0.02)\times0.999 = 0.97902

for this input and final state, even if there are coherences between the subspaces. Leakage can persist, return with uncontrolled phase, affect spectators, and violate the assumptions of later gates or error correction. Report the leakage probability and the conditional in-subspace metric separately.

An acquisition begins at 1.20 μs1.20\,\mu\mathrm{s}, integrates for 400 ns400\,\mathrm{ns}, then takes 180 ns180\,\mathrm{ns} to classify, and takes another 120 ns120\,\mathrm{ns} to reach the consuming sequencer. What is the earliest legal start of a conditional pulse?

Solution

The result becomes available at

tready=1.20 μs+0.40 μs+0.18 μs+0.12 μs=1.90 μs.\begin{aligned} t_{\mathrm{ready}} &= 1.20\,\mu\mathrm{s} +0.40\,\mu\mathrm{s} +0.18\,\mu\mathrm{s} +0.12\,\mu\mathrm{s}\\ &= 1.90\,\mu\mathrm{s}. \end{aligned}

The pulse may need to start later if its channel has a coarser alignment grid or another resource remains occupied. Starting before 1.90 μs1.90\,\mu\mathrm{s} is not merely optimistic scheduling; the branch value is unavailable.

Using the worked example, compute the small-error infidelity for a 2%2\% gain error. Why can a long sequence reveal a larger effect than this one-gate number suggests?

Solution

The angle error is

δϑ=0.02π2=0.01π.\delta\vartheta = 0.02\frac{\pi}{2} = 0.01\pi.

Therefore

1−Favg≃(0.01π)26≃1.64×10−4.1-F_{\mathrm{avg}} \simeq \frac{(0.01\pi)^2}{6} \simeq 1.64\times10^{-4}.

This is a coherent overrotation. Repetitions with aligned error axes can add angles before probabilities are formed, producing oscillation or roughly quadratic early growth rather than independent stochastic accumulation. Repeated-error amplification is therefore useful for calibration, while a single average number can obscure the mechanism.

For the first-order response example with T=4τT=4\tau, what fraction of the intended resonant rotation arrives after TT? Does waiting another 4τ4\tau recover the entire angle?

Solution

The fraction arriving after TT is

τ(1−e−T/τ)T=1−e−44≃0.2454.\frac{\tau(1-e^{-T/\tau})}{T} =\frac{1-e^{-4}}4\simeq0.2454.

After another 4τ4\tau, the remaining fraction is (1−e−4)e−4/4≃0.00450(1-e^{-4})e^{-4}/4\simeq0.00450. An exponential tail never becomes exactly zero at a finite time. Whether this remainder is acceptable depends on the requested operation and what follows it. Waiting also exposes the state to decoherence, which the simple delivery model omits.

Compare an xx pulse followed by a yy pulse with their reverse order. Both have area π/2\pi/2 on each axis. Apply the two sequences to ∣0⟩|0\rangle.

Solution

The first order gives

Ry(π/2)Rx(π/2)∣0⟩∼∣0⟩−i∣1⟩2,R_y(\pi/2)R_x(\pi/2)|0\rangle \sim\frac{|0\rangle-i|1\rangle}{\sqrt2},

where ∼\sim permits a global phase. Reversing the pulses gives

Rx(π/2)Ry(π/2)∣0⟩∼∣0⟩+∣1⟩2.R_x(\pi/2)R_y(\pi/2)|0\rangle \sim\frac{|0\rangle+|1\rangle}{\sqrt2}.

Their Bloch vectors point along −y-y and +x+x, respectively. Equal area on each control channel does not remove the noncommutativity of XX and YY.

  • T. Alexander et al., “Qiskit Pulse: Programming quantum computers through the cloud with pulses,” Quantum Science and Technology 5, 044006 (2020), doi:10.1088/2058-9565/aba404.
  • A. W. Cross et al., “OpenQASM 3: A broader and deeper quantum assembly language,” ACM Transactions on Quantum Computing 3, 12 (2022), doi:10.1145/3505636.
  • D. D’Alessandro, Introduction to Quantum Control and Dynamics, 2nd ed., CRC Press (2021), doi:10.1201/9781003051268.
  • S. Gustavsson et al., “Improving quantum gate fidelities by using a qubit to measure microwave pulse distortions,” Physical Review Letters 110, 040502 (2013), doi:10.1103/PhysRevLett.110.040502.
  • E. Magesan and J. M. Gambetta, “Effective Hamiltonian models of the cross-resonance gate,” Physical Review A 101, 052308 (2020), doi:10.1103/PhysRevA.101.052308.
  • S. Sheldon, E. Magesan, J. M. Chow, and J. M. Gambetta, “Procedure for systematically tuning up cross-talk in the cross-resonance gate,” Physical Review A 93, 060302(R) (2016), doi:10.1103/PhysRevA.93.060302.
  • D. C. McKay, C. J. Wood, S. Sheldon, J. M. Chow, and J. M. Gambetta, “Efficient ZZ gates for quantum computing,” Physical Review A 96, 022330 (2017), doi:10.1103/PhysRevA.96.022330.
  • F. Motzoi, J. M. Gambetta, P. Rebentrost, and F. K. Wilhelm, “Simple pulses for elimination of leakage in weakly nonlinear qubits,” Physical Review Letters 103, 110501 (2009), doi:10.1103/PhysRevLett.103.110501.
  • M. A. Nielsen, “A simple formula for the average gate fidelity of a quantum dynamical operation,” Physics Letters A 303, 249–252 (2002), doi:10.1016/S0375-9601(02)01272-0.
  • OpenQASM contributors, OpenQASM Language Specification: Pulse-Level Descriptions of Gates and Measurement, current and versioned specification, official specification.
  • R. S. Smith, M. J. Curtis, and W. J. Zeng, “A practical quantum instruction set architecture,” (2016), arXiv:1608.03355; see also the current Quil specification.