Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complete Optimal Control Gate Sets

Updated 5 July 2026
  • Complete optimal control gate sets are families of quantum gate operations enabling universal synthesis while minimizing errors, calibration, and operational time.
  • They integrate circuit synthesis with control-theoretic approaches to achieve native SU(4) coverage and optimized two-qubit interactions in various hardware platforms.
  • Recent studies employ advanced objective functionals and continuous control formulations to enhance robustness, mitigate crosstalk, and achieve time-optimal quantum operations.

Complete optimal control gate sets are gate families or control resources that combine universality with resource optimality under a specified hardware model. In the broad quantum-information sense, a complete or universal gate set is any finite set of gates from which arbitrary unitary transformations on nn qubits can be synthesized; operationally, arbitrary single-qubit rotations together with any entangling two-qubit gate suffice. In a stricter control-theoretic sense, completeness means that the available drift and control Hamiltonians generate the full Lie group SU(2n)SU(2^n) on the computational subspace. Recent work has used the same phrase for several related but distinct objectives: native realization of all of SU(4)SU(4) on two qubits without switching interaction mechanisms, device-wide single-qubit basis coverage coordinated against crosstalk, and continuous parameterized control surfaces that cover one- and two-qubit gate manifolds (Chen et al., 5 Feb 2025, Kairys et al., 2021, Goldschmidt et al., 16 Mar 2026).

1. Completeness and optimality as distinct design criteria

A complete gate set is not necessarily optimal. In the standard circuit model, completeness refers to synthesis capability: arbitrary single-qubit rotations plus any entangling two-qubit gate generate a universal set, and in controllability language a platform is universal if the available controls generate the full Lie group SU(2n)SU(2^n) on the computational subspace (Kairys et al., 2021). By contrast, the two-qubit control literature has sharpened the meaning of optimality: for two-qubit operations, a complete and optimal control gate set is one that is complete in the sense of generating the entire special unitary group SU(4)SU(4) natively, without switching among multiple physical interaction mechanisms or addressing different transitions, and optimal in the sense of minimizing fundamental costs under the available Hamiltonian, notably entangling-gate count for universal synthesis and time-to-target for a given interaction strength and bounded controls (Chen et al., 5 Feb 2025).

This distinction matters because a compiled universal basis can be complete while still being suboptimal in calibration burden, leakage behavior, or execution time. The superconducting transmon literature makes this contrast explicit: traditional native gate sets often switch between distinct entangling mechanisms, such as using the ∣11⟩↔∣20⟩|11\rangle \leftrightarrow |20\rangle avoided crossing for CZ/CNOT-class gates and ∣10⟩↔∣01⟩|10\rangle \leftrightarrow |01\rangle exchange for iSWAP-family gates, whereas unified exchange-plus-drive control seeks full SU(4)SU(4) coverage from a single interaction mechanism (Chen et al., 5 Feb 2025).

A second distinction concerns scope. In the crosstalk-robust gate-set literature, completeness is defined at the device level rather than at the level of native arbitrary two-qubit synthesis. On IBM Eagle with heavy-hex connectivity, a complete gate set consists of II, X\sqrt{X}, XX, and virtual RZ(ϕ)R_Z(\phi), replicated in two colors sufficient for device-wide vertex coloring and coordinated so that parallel operation remains robust anywhere on the chip (Goldschmidt et al., 16 Mar 2026). This usage is compatible with native two-qubit entanglers and virtual phase updates, but it is not identical to native reachability of all of SU(4)SU(4).

2. Controllability, local equivalence, and nonlocal geometry

For two qubits, the nonlocal content of a gate is naturally organized by the KAK, or Cartan, decomposition. Any U∈SU(4)U \in SU(4) can be written as

U=λ(K1⊗K2) Uw(a,b,c) (K3⊗K4),λ∈{1,i},Kℓ∈SU(2),U = \lambda (K_1 \otimes K_2)\, U_w(a,b,c)\, (K_3 \otimes K_4), \qquad \lambda \in \{1,i\}, \quad K_\ell \in SU(2),

with

Uw(a,b,c)=exp⁡[i(a XX+b YY+c ZZ)],U_w(a,b,c) = \exp[i(a\,XX + b\,YY + c\,ZZ)],

where (a,b,c)(a,b,c) lies in the Weyl chamber, a tetrahedron whose vertices are O:(0,0,0)O:(0,0,0), A1:(π/4,π/4,−π/4)A_1:(\pi/4,\pi/4,-\pi/4), A2:(π/4,π/4,π/4)A_2:(\pi/4,\pi/4,\pi/4), and A3:(π/4,0,0)A_3:(\pi/4,0,0). Two unitaries are locally equivalent if and only if they share the same (a,b,c)(a,b,c) (Chen et al., 5 Feb 2025).

This geometry separates mere universality from stronger notions of native expressivity. Any entangling two-qubit gate, combined with arbitrary single-qubit gates, yields a universal gate set. Perfect entanglers form a distinguished subset of SU(4)SU(4): they are exactly those gates capable of creating a maximally entangled state from at least one product input state. In Weyl-chamber coordinates, the perfect-entangler region is the convex polyhedron defined by

c1+c2≥π2,c1−c2≤π2,c2+c3≤π2,c_1 + c_2 \ge \frac{\pi}{2}, \qquad c_1 - c_2 \le \frac{\pi}{2}, \qquad c_2 + c_3 \le \frac{\pi}{2},

and can be characterized by local invariants (g1,g2,g3)(g_1,g_2,g_3). The functional

d(g1,g2,g3)=g3g12+g22−g1d(g_1,g_2,g_3)=g_3\sqrt{g_1^2+g_2^2}-g_1

vanishes on the perfect-entangler boundary, and the piecewise functional D(U)\mathcal{D}(U) introduced for optimal control satisfies D(U)=0\mathcal{D}(U)=0 if and only if UU is a perfect entangler (Watts et al., 2014). This is useful when the control objective is not a single canonical gate but any member of a desirable nonlocal class.

Within this geometry, the BB gate occupies a special role. In canonical coordinates it sits at

B:(a,b,c)=(π4,π8,0),UB=exp⁡ ⁣[i(π4XX+π8YY)].B:(a,b,c)=\left(\frac{\pi}{4},\frac{\pi}{8},0\right), \qquad U_B=\exp\!\left[i\left(\frac{\pi}{4}XX+\frac{\pi}{8}YY\right)\right].

It is unique up to local equivalence in enabling exact synthesis of an arbitrary SU(4)SU(4) unitary using only two applications of BB plus local gates, whereas CNOT or iSWAP require three (Chen et al., 5 Feb 2025). This establishes an entangler-count notion of optimality that is stronger than ordinary universality.

3. Optimal-control formulations and target functionals

Optimal-control gate-set design is shaped by the choice of objective functional. A standard formulation chooses controls α\alpha for a time-dependent Hamiltonian HD(α,t)H_D(\alpha,t) so that

UD(α,Tc)=Texp⁡ ⁣[−(i/ℏ)∫0TcHD(α,τ) dτ]U_D(\alpha,T_c)=\mathcal{T}\exp\!\left[-(i/\hbar)\int_0^{T_c} H_D(\alpha,\tau)\,d\tau\right]

matches a target gate UTU_T up to an allowed equivalence (Kairys et al., 2021). The baseline objective uses

F(U1,U2)=1d2∣Tr(U1†U2)∣2,G0(U1,U2)=1−F(U1,U2),F(U_1,U_2)=\frac{1}{d^2}\left|\mathrm{Tr}(U_1^\dagger U_2)\right|^2, \qquad \mathcal{G}_0(U_1,U_2)=1-F(U_1,U_2),

which is global-phase invariant but penalizes locally equivalent two-qubit entanglers unequally. This is precisely the situation in which more structured objectives become useful.

Two such objectives were introduced to encode local equivalence and echo structure explicitly. The first,

F1(θ,U)=R(θ1) U R(θ2),G1(U1,U2)=min⁡θG0(U1,F1(θ,U2)),\mathcal{F}_1(\theta,U)=R(\theta_1)\,U\,R(\theta_2), \qquad \mathcal{G}_1(U_1,U_2)=\min_\theta \mathcal{G}_0(U_1,\mathcal{F}_1(\theta,U_2)),

rewards any pulse whose two-qubit action can be converted to the target by pre- and post-single-qubit rotations. The second,

F2(θ,U)=R(θ3) U R(θ2) U R(θ1),G2(U1,U2)=min⁡θG0(U1,F2(θ,U2)),\mathcal{F}_2(\theta,U)=R(\theta_3)\,U\,R(\theta_2)\,U\,R(\theta_1), \qquad \mathcal{G}_2(U_1,U_2)=\min_\theta \mathcal{G}_0(U_1,\mathcal{F}_2(\theta,U_2)),

targets single-pass controls that become the desired entangler only when echoed and interleaved with local rotations. In simulation on a three-level-per-transmon microwave-only model, these objectives produced simpler pulses, higher fidelities, and faster convergence than direct infidelity minimization G0\mathcal{G}_0 (Kairys et al., 2021).

A related line of work has generalized the target from a single gate to an entire gate manifold. In continuously parameterized settings, the goal is to learn a map θ↦u(t;θ)\theta \mapsto u(t;\theta) that implements Utarget(θ)U_{\text{target}}(\theta) across a parameter domain. One direct-collocation template minimizes

∣1−F(Z,G)∣+12∑t∥Zt∥R2|1-F(Z,G)| + \frac{1}{2}\sum_t \|Z_t\|^2_R

subject to discretized dynamics and bounds, while a coordinated “direct-sum” problem solves multiple parameter samples jointly with fidelity constraints ∣1−F(Zj,Gj)∣<10−4|1-F(Z_j,G_j)|<10^{-4} (Bhattacharyya et al., 2024). In that framework, pretraining a physics-informed neural network on direct-sum solutions reduced the number of epochs needed to reach $0.9999$ average fidelity from $100$ to $14$ for RZ(θ)R_Z(\theta), and from $731$ to $437$ for RZ(θ)RY(ϕ)R_Z(\theta)R_Y(\phi). The same study also showed that transfer learning could recover average gate fidelity from ∼0.90\sim 0.90–$0.99$ back to ≥0.9999\ge 0.9999 for RZ(θ)R_Z(\theta) with fewer than $10$ calibration points, and to ∼0.999\sim 0.999 for U2(θ,ϕ)U_2(\theta,\phi) with fewer than $25$ points (Bhattacharyya et al., 2024).

These formulations illustrate a recurring principle: optimal-control gate-set design increasingly targets equivalence classes, reachable regions, or continuous manifolds, rather than a single fixed matrix representative. That shift is central to the notion of completeness in realistic hardware settings.

4. Native and coordinated realizations on superconducting hardware

The most explicit experimental realization of a complete optimal control gate set for two qubits is the unified exchange-plus-drive scheme on a transmon–coupler–transmon unit cell. With both qubits tuned into resonance, ω1=ω2=ω\omega_1=\omega_2=\omega, the effective Hamiltonian is

H=Δ (ZI+IZ)/2+g (XX+YY)/2+Ω1XI/2+Ω2IX/2,H=\Delta\,(ZI+IZ)/2 + g\,(XX+YY)/2 + \Omega_1 XI/2 + \Omega_2 IX/2,

where Δ=ω−ωd\Delta=\omega-\omega_d. The operator set {XX+YY,  ZI+IZ,  XI,  IX}\{XX+YY,\; ZI+IZ,\; XI,\; IX\} generates the full Lie algebra su(4)\mathfrak{su}(4), so the controls are fully two-qubit controllable. Experimentally, arbitrary Weyl-chamber points were realized natively without invoking ∣11⟩↔∣20⟩|11\rangle \leftrightarrow |20\rangle, and a broad suite of representative two-qubit unitaries achieved an average XEB fidelity of 99.37±0.07%99.37 \pm 0.07\%. Representative values at g/2π≈6.25g/2\pi \approx 6.25 MHz include iSWAP\sqrt{\text{iSWAP}} at $20$ ns with error ≈0.20%\approx 0.20\%, iSWAP at $40$ ns with error ≈0.41%\approx 0.41\%, a CNOT-class gate at $40$ ns with error ≈0.75%\approx 0.75\%, SWAP at $60$ ns with error ≈0.72%\approx 0.72\%, and the BB gate at $40$ ns with error ≈0.52%\approx 0.52\%. A calibrated BB gate attained an XEB error of 0.41%0.41\%, and two-BB synthesis reconstructed arbitrary Weyl-chamber points with an average error per SU(4)SU(4) of 1.34%1.34\% and a relative spread of approximately 10%10\%. The same control family reduced circuit depth for entangled-state preparation: a $10$-qubit WW state prepared with nine two-qubit gates reached 0.913±0.0120.913 \pm 0.012 fidelity, and a $4$-qubit double-excitation Dicke state D4(2)D_4(2) synthesized with eight SU(4)SU(4) operations reached 0.926±0.0010.926 \pm 0.001, compared with a cited exact CNOT-based construction using $14$ CNOTs (Chen et al., 5 Feb 2025).

A different superconducting realization addresses completeness at device scale rather than at the level of native arbitrary SU(4)SU(4). Crosstalk-Robust Gate Sets are a complete, colored single-qubit basis for heavy-hex hardware, containing II, X\sqrt{X}, XX, and virtual RZ(ϕ)R_Z(\phi), with two colors sufficient for device-wide vertex coloring. The coordinated optimal-control problem minimizes a sum of pairwise crosstalk susceptibilities over graph edges while enforcing F0≈0.9999\mathcal{F}_0 \approx 0.9999 gate fidelity constraints. On IBM Eagle, this device-wide gate set eliminated the fitted ZZ oscillation in XY4 dynamical decoupling and reduced the eight-qubit decay rate to γ=0.0386±0.0004\gamma=0.0386 \pm 0.0004 MHz, compared with 0.131±0.0060.131 \pm 0.006 MHz for Gaussian gates and 0.163±0.0090.163 \pm 0.009 MHz for default gates. In simultaneous four-qubit random Clifford circuits, it achieved p=0.9981±0.0001p=0.9981 \pm 0.0001 versus 0.9864±0.00070.9864 \pm 0.0007 for Gaussian gates, and the abstract reported a 16%16\% (1.016×1.016\times) improvement in gate fidelity for simultaneous four-qubit random Clifford circuits. In a four-qubit TFIM Hamiltonian simulation, CRGS and detuning-robust controls were approximately 50×50\times more accurate after a single Trotter step than Gaussian gates and delivered a median approximately 4×4\times algorithmic improvement across repetitions. Pulse-level simulations further indicated that stronger coupling can be exploited when the single-qubit gate set is optimized: at J=2×J=2\times, CRGS yielded approximately 3.4×3.4\times higher fidelity than detuning-robust controls and approximately 11.3×11.3\times higher than Gaussian controls, supporting the statement that optimized gate sets can enable larger qubit–qubit coupling strengths that cut two-qubit gate times in half (Goldschmidt et al., 16 Mar 2026).

Earlier superconducting work already exhibited many ingredients now associated with complete optimal-control gate sets. For inductively coupled flux qubits at the sweet spot, Krotov optimization produced single-qubit XX and ZZ gates in $0.8$–$0.9$ ns and CNOT in approximately $2.0$ ns, with decoherence-including errors ηD≈(2.3\eta_D \approx (2.3–3.8)×10−63.8)\times 10^{-6} for single-qubit gates and ηD≈1.42×10−5\eta_D \approx 1.42\times 10^{-5} for CNOT (Huang et al., 2014). Heavy-fluxonium control with automatic differentiation realized XX, HH, and TT in $60$ ns with closed-system fidelities 99.94%99.94\%, 99.933%99.933\%, and 99.933%99.933\%, and a $60$ ns CZ with closed-system fidelity 99.4%99.4\% and open-system fidelity 99.0%99.0\% (Abdelhafez et al., 2019). Neighboring optimal control applied to a universal TRP gate set reduced one-qubit gate error probabilities to approximately 10−810^{-8} and a two-qubit modified controlled-phase gate to 5.21×10−55.21\times 10^{-5}, below a target threshold of 10−410^{-4} (Peng et al., 2014).

5. Continuous, multilevel, and multi-qubit extensions

Complete optimal control gate sets are not restricted to discrete qubit libraries. One major extension is the continuous gate-set viewpoint, in which a parameter-indexed family U(θ)U(\theta) is synthesized directly rather than decomposed into a small fixed basis. In a superconducting model with local X/YX/Y control and exchange coupling, a physics-informed neural-network framework learned control surfaces for RZ(θ)R_Z(\theta), RZ(θ)RY(ϕ)R_Z(\theta)R_Y(\phi), U2(θ,ϕ)U_2(\theta,\phi), and the entangling family

A^12(θ)=exp⁡ ⁣(iθ2(X1Y2−Y1X2)).\hat A_{12}(\theta)=\exp\!\left(i\frac{\theta}{2}(X_1Y_2-Y_1X_2)\right).

Across $4500$ random test points, the learned RZ(θ)R_Z(\theta) surface reached mean infidelity ∼8.1×10−5\sim 8.1\times 10^{-5} with pretraining or ∼9.2×10−5\sim 9.2\times 10^{-5} without it, and direct pulse-level implementation of A^12(θ)\hat A_{12}(\theta) achieved comparable fidelity in approximately $10$ ns rather than the $27.8$–$32.8$ ns required by a standard-basis decomposition into $3$ CNOTs and $2$–$3$ single-qubit π/2\pi/2 rotations, a $2.78$–3.28×3.28\times reduction in pulse-schedule duration (Bhattacharyya et al., 2024).

A related meta-optimization program treated continuous gate sets as parameter-conditioned pulse families. There, the learned single-qubit families

R1(θ)=(cos⁡(θ/2)−sin⁡(θ/2)sin⁡(θ/2)cos⁡(θ/2)),R2(θ)=diag(e−i(θ−π),ei(θ−π))R_1(\theta)= \begin{pmatrix} \cos(\theta/2) & -\sin(\theta/2) \\ \sin(\theta/2) & \cos(\theta/2) \end{pmatrix}, \qquad R_2(\theta)=\mathrm{diag}(e^{-i(\theta-\pi)},e^{i(\theta-\pi)})

were combined with direct CNOT synthesis and a continuous entangling family CR(θ)=exp⁡(iθZ⊗X)CR(\theta)=\exp(i\theta Z\otimes X). For R2(θ)R_2(\theta), the average infidelity was below 10−410^{-4} across the tested ranges, and for two-qubit CR(θ)CR(\theta) the learned controls maintained on-average infidelities ≲10−3\lesssim 10^{-3}–10−410^{-4}. The same work reported that a discrete CNOT-based decomposition of CR(π/2)CR(\pi/2) can be approximately 7×7\times slower than a direct continuous implementation (Preti et al., 2022).

A second extension concerns multilevel systems. In ultracold 87^{87}Rb, complete single-qutrit control in SU(3)SU(3) was demonstrated using only two resonant microwave tones. The primitive single-tone rotations UAU_A and UBU_B, together with a virtually implemented diagonal phase gate Uθ(η,ϵ)U_\theta(\eta,\epsilon), form one complete gate set; a second replaces one single-tone pulse by the dual-tone synthesized coupling

UAB(α,β),U_{AB}(\alpha,\beta),

which effects a direct ∣0⟩↔∣2⟩|0\rangle \leftrightarrow |2\rangle rotation in a Λ\Lambda-scheme at

tAB=2π∣ΩA∣2+∣ΩB∣2.t_{AB}= \frac{2\pi}{\sqrt{|\Omega_A|^2+|\Omega_B|^2}}.

Using both constructions, the Walsh–Hadamard Fourier transform was implemented with similar final-state fidelity and purity (2208.00045).

A third extension elevates the primitive itself from two-body to multi-qubit control. On neutral-atom Rydberg hardware, Krotov optimization produced one-step multi-qubit controlled-phase gates, controlled-rotation implementations of controlled-NOT family gates, and a three-qubit Fredkin gate. The amplitude-plus-phase-shaped Fredkin pulse reached 99.74%99.74\% fidelity while accounting for spontaneous emission, laser fluctuations, and Doppler dephasing. Its average time-integrated Rydberg population was Tˉr≈0.2 μs\bar T_r \approx 0.2\,\mu\text{s}, compared with 2.4 μs2.4\,\mu\text{s} for an $8$-CNOT decomposition cited in the same study. For the optimized C2C_2-ZZ gate, Tˉr≈0.018 μs\bar T_r \approx 0.018\,\mu\text{s}, implying spontaneous-emission error of approximately 10−410^{-4} from ∣70S⟩|70S\rangle (Abedi et al., 27 Nov 2025). These results broaden the meaning of completeness from a universal two-local basis to a hardware-native set that already contains useful multi-qubit primitives.

6. Robustness, asymptotic optimality, and unresolved questions

The literature uses several inequivalent optimality criteria. In analog and pulse-level control, optimality often means minimum time, minimum entangler count, minimum sensitivity to crosstalk or detuning, or minimum calibration complexity. In fault-tolerant synthesis, by contrast, optimality is usually measured by non-Clifford resource count. For most multi-qubit controlled SU(2)SU(2) operations in the Clifford+TT model, the best known upper bound is

T≤3log⁡2(1/ε)+O(2nlog⁡(1/ε))+o(log⁡(1/ε))T \le 3\log_2(1/\varepsilon) + O(\sqrt{2^n\log(1/\varepsilon)}) + o(\log(1/\varepsilon))

with high probability, and this matches the lower bound

T≥3log⁡2(1/ε)−o(log⁡(1/ε))T \ge 3\log_2(1/\varepsilon) - o(\log(1/\varepsilon))

when almost-controlled approximations are prohibited. The same framework gives ancilla-free SU(4)SU(4) synthesis with

T≤9log⁡2(1/ε)+o(log⁡(1/ε)),T \le 9\log_2(1/\varepsilon) + o(\log(1/\varepsilon)),

improving over a cited KAK-based scaling of 21log⁡2(1/ε)+o(log⁡(1/ε))21\log_2(1/\varepsilon) + o(\log(1/\varepsilon)) (Yamazaki et al., 15 Mar 2026). This is an optimal-control gate-set result in a different sense from time-optimal analog synthesis, but it addresses the same question: what constitutes a complete set of control primitives at minimal cost?

Robustness has likewise been formalized beyond ad hoc pulse tuning. A recent geometric framework defines a chance-constrained robust optimal control problem in which the Hamiltonian undergoes stochastic switching,

Hj(t;ξ)=αj(t;ξ)H^j+(1−αj(t;ξ))H˘j,H_j(t;\xi)=\alpha_j(t;\xi)\hat H_j + (1-\alpha_j(t;\xi))\breve H_j,

and seeks controls minimizing a risk functional Rξ(T)\mathcal{R}_\xi(T) subject to

Pξ ⁣[∥U(T)−Uˉ∥∞≤η]≥1−β.\mathbb{P}_\xi\!\left[\|U(T)-\bar U\|_\infty \le \eta\right] \ge 1-\beta .

Within that framework, robust completeness means that density of the reachable set must persist under bounded perturbations or stochastic switching, while robust gate complexity is defined by the minimal sequence length meeting an accuracy target with high probability (Aspman et al., 2024). This provides a common language for comparing device-level crosstalk-robust sets, offset-charge-randomized pulse families, and fault-tolerant discrete synthesis.

Two recurring misconceptions are clarified by this body of work. First, universality alone does not imply native maximal expressivity: a single perfect entangler plus local gates is universal, yet it does not mean that the platform natively reaches all of SU(4)SU(4) in one entangling pulse. Second, native completeness at one layer does not guarantee completeness at another: a device-wide single-qubit basis such as CRGS is complete for parallel one-qubit moments on its topology, but it remains compatible with rather than equivalent to native arbitrary two-qubit control (Chen et al., 5 Feb 2025, Goldschmidt et al., 16 Mar 2026).

Several open directions remain explicit in the literature. Unified exchange-plus-drive control identifies formal global proofs of time-optimality under realistic amplitude constraints and scaling to multi-qubit networks with concurrent resonant blocks as open problems (Chen et al., 5 Feb 2025). Crosstalk-robust gate-set design identifies robust two-qubit envelopes, DRAG-like cancellation tones, reduced parametric control families, and improved crosstalk metrics as next steps (Goldschmidt et al., 16 Mar 2026). Continuous gate-surface methods point to region-aware interpolation for fractured minimum-time manifolds and to memory limits of direct-sum coordination as system size grows (Bhattacharyya et al., 2024). Together, these issues indicate that complete optimal control gate sets are best understood not as a single fixed object, but as a family of architecture-specific solutions balancing controllability, calibration, robustness, and the relevant cost metric for the computational layer of interest.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Complete Optimal Control Gate Sets.