Exponential-SWAP (eSWAP) is a continuously tunable two-qubit unitary defined as exp(–iθ SWAP) that smoothly interpolates between the identity and full SWAP operation.
It is implemented either directly using a flux pulse on a tunable coupler or via an ancilla-based protocol, achieving gate times around 20–30 ns with fidelities exceeding 98%.
The method generalizes to multi-qubit exchange networks and even to numerical quadrature schemes for near-singular integral evaluations, highlighting its algorithmic and practical versatility.
Exponential-SWAP (eSWAP) denotes, in one usage, the continuous two-qubit unitary family UeSWAP(θ)=e−iθSWAP, which interpolates between the identity and the SWAP gate through a continuously tunable exchange angle. In the cited literature, the same label is also used for an exponential-basis extension of singularity-swap quadrature for nearly singular line integrals on closed curves in two dimensions. The shared acronym is therefore best read contextually: in quantum information it refers to exponentiation of the SWAP operator, whereas in numerical analysis it refers to swapping a target singularity to a point close to the unit circle and evaluating the resulting integral in a complex-exponential basis (Rasmussen et al., 2020, Klinteberg, 2023).
1. Two-qubit definition and algebraic action
For two qubits, the SWAP operator is the unitary
SWAP∣a,b⟩=∣b,a⟩
in the computational basis {∣00⟩,∣01⟩,∣10⟩,∣11⟩}. As a Hermitian involution SWAP2=I, it has two eigenvalues +1 and one eigenvalue −1. By spectral calculus one defines the “exponential-SWAP” family
UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.
Its action is diagonal on ∣00⟩ and ∣11⟩,
UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,
while on the single-excitation subspace it acts as
SWAP∣a,b⟩=∣b,a⟩0
SWAP∣a,b⟩=∣b,a⟩1
Up to the overall phase SWAP∣a,b⟩=∣b,a⟩2, this is exactly a rotation in the SWAP∣a,b⟩=∣b,a⟩3 subspace by angle SWAP∣a,b⟩=∣b,a⟩4, passing continuously from the identity SWAP∣a,b⟩=∣b,a⟩5 to the SWAP gate SWAP∣a,b⟩=∣b,a⟩6 (Rasmussen et al., 2020).
An equivalent description uses a natural two-qubit exchange Hamiltonian. In systems with an XY-type interaction
SWAP∣a,b⟩=∣b,a⟩7
the time evolution
SWAP∣a,b⟩=∣b,a⟩8
coincides, up to local SWAP∣a,b⟩=∣b,a⟩9-phases, with a fractional {∣00⟩,∣01⟩,∣10⟩,∣11⟩}0SWAP on the single-excitation subspace. Setting {∣00⟩,∣01⟩,∣10⟩,∣11⟩}1 realizes the continuously tunable exchange block that underlies the eSWAP construction.
2. Deterministic realization via XY exchange
A direct implementation uses two transmons connected by a tunable coupler. One applies a flux pulse on the coupler that brings the two target qubits into resonance for a duration
{∣00⟩,∣01⟩,∣10⟩,∣11⟩}2
where {∣00⟩,∣01⟩,∣10⟩,∣11⟩}3 is the effective exchange-coupling strength. In a frame that removes the single-qubit energies and absorbs any dynamic {∣00⟩,∣01⟩,∣10⟩,∣11⟩}4-shifts into later calibrated {∣00⟩,∣01⟩,∣10⟩,∣11⟩}5-rotations on each qubit, the time evolution is
{∣00⟩,∣01⟩,∣10⟩,∣11⟩}6
so the native interaction is a fractional {∣00⟩,∣01⟩,∣10⟩,∣11⟩}7SWAP (Rasmussen et al., 2020).
To convert this fractional {∣00⟩,∣01⟩,∣10⟩,∣11⟩}8SWAP into exactly {∣00⟩,∣01⟩,∣10⟩,∣11⟩}9, one inserts local SWAP2=I0-rotations SWAP2=I1 on each qubit before and after the exchange block. In practice one calibrates the net single-qubit phases and performs them in software as virtual SWAP2=I2 gates. The resulting implementation is deterministic, has depth SWAP2=I3, and uses a single flux-pulse window together with two virtual SWAP2=I4’s per side.
The same description gives a concrete duration scale: for SWAP2=I5 MHz one finds SWAP2=I6, so a SWAP2=I7 at SWAP2=I8 is SWAP2=I9 ns. The paper’s central hardware point is that a simple single-flux-pulse on a tunable coupler turns the coupling on for time +10 and directly implements the fractional +11SWAP, which by local +12-rotations can be converted into the eSWAP above.
3. Ancilla-based exponentiation and branch correction
As an alternative, the cited work extends Marvian & Lloyd’s method to cyclic non-Hermitian gates. Since +13, SWAP is a Hermitian involution of cyclic order +14. The protocol introduces one ancilla qubit, prepares it in the superposition
+15
applies one controlled-SWAP (Fredkin) gate controlled by the ancilla and targeting the two data qubits, and then measures the ancilla in the +16-basis +17, with
+18
If the outcome is +19, the two-qubit register is projected onto
−10
so one exactly realizes −11 up to a known global normalization (Rasmussen et al., 2020).
If instead the result is −12, one obtains
−13
which can be converted back to the target −14 by a simple corrective routine, either a second controlled-SWAP or a post-measurement phase flip. The feed-forward for the “−15” branch is described as trivial: because the outcome differs by an extra minus-sign on the SWAP term, a single controlled-−16 or a second controlled-SWAP yields the desired sign flip.
The success probability for the “−17” branch is
−18
For small −19 this is UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.0, and at UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.1 one has UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.2. With one additional Fredkin, or a controlled-UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.3 plus local SWAP, the protocol can be made fully deterministic.
4. Resource counts, fidelity, and simulated performance
The direct and ancilla-based realizations differ in qubit overhead and control primitives, but both were analyzed within the same superconducting-circuit setting. The direct implementation uses UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.4 data qubits, UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.5 flux-pulse window, two virtual UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.6’s per side, depth UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.7, and duration UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.8. The probabilistic implementation uses UeSWAP(θ):=e−iθSWAP=cosθI−isinθSWAP.9 additional ancilla, one controlled-SWAP (Fredkin) gate, two single-qubit rotations on the ancilla, one ancilla readout in the ∣00⟩0-basis, and post-selection or one correction Fredkin for determinism (Rasmussen et al., 2020).
Method
Resources
Performance statement
Direct via coupler pulses
2 data qubits; 1 flux-pulse window; virtual ∣00⟩1 gates
Gate times are ∣00⟩2–∣00⟩3 ns
Ancilla-based
1 ancilla; 1 Fredkin; ancilla rotations and readout
Overall exponentiation fidelities ∣00⟩4 for small ∣00⟩5
The fidelity analysis in Rasmussen and Zinner includes realistic qubit coherence times ∣00⟩6s, flux-pulse shaping to avoid leakage, and random ∣00⟩7–∣00⟩8 fabrication scatter in circuit parameters using QuTiP master-equation simulations. For the bare controlled-∣00⟩9SWAP ∣11⟩0 with ∣11⟩1, the reported process fidelities are above ∣11⟩2 in the noiseless case, and ∣11⟩3 once decoherence is included. Even for up to four controls ∣11⟩4 the average fidelity stays ∣11⟩5 under the same ∣11⟩6 assumptions. A large Monte-Carlo ensemble with ∣11⟩7 jitter in Josephson energies and capacitances still yields ∣11⟩8 of runs above ∣11⟩9 final fidelity.
The same hardware can directly implement the fractional eSWAP via the XY exchange pulse with identical performance numbers. Alternatively, the ancilla-based protocol inherits the underlying controlled-SWAP fidelity UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,0 per Fredkin plus single-qubit gates at UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,1 each, so overall exponentiation fidelities UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,2 are readily within reach for small UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,3.
5. Generalizations and algorithmic relevance
The superconducting-coupler toolbox extends beyond a single pair of qubits. Section IV of the cited work shows how to wire up an all-to-all exchange network with each pair of “swapping” qubits gated by its own ancilla or tunable-bus element. One can build UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,4 or eSWAP operations between any chosen pair, or even three-way or four-way swaps, by the same “turn-on–turn-off” flux control (Rasmussen et al., 2020).
The circuit-based exponentiation protocol also generalizes from SWAP to arbitrary cyclic operators. For a general cyclic gate of order UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,5, satisfying UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,6, the paper shows that one needs UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,7 ancillas and UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,8 controlled-UeSWAP(θ)∣00⟩=e−iθ∣00⟩,UeSWAP(θ)∣11⟩=e−iθ∣11⟩,9 operations, measured in the SWAP∣a,b⟩=∣b,a⟩00 basis. The success probability of the all-plus branch scales as SWAP∣a,b⟩=∣b,a⟩01 for small SWAP∣a,b⟩=∣b,a⟩02, but may be improved by feed-forward. A specific example in the paper is controlled-SWAP∣a,b⟩=∣b,a⟩03SWAP itself, which has order SWAP∣a,b⟩=∣b,a⟩04; accordingly, one may build SWAP∣a,b⟩=∣b,a⟩05 exactly with three ancillas and SWAP∣a,b⟩=∣b,a⟩06 controlled-SWAP∣a,b⟩=∣b,a⟩07SWAPs.
Fractional SWAPs arise in algorithms for quantum walks, Hamiltonian simulation, entanglement distribution and CV-cluster state generation. The cited discussion states that having a native, high-fidelity eSWAP that is continuously tunable in SWAP∣a,b⟩=∣b,a⟩08 can dramatically reduce Trotter-step counts and gate depths in near-term devices. Within that framing, eSWAP is not merely a gate interpolation, but a hardware-level exchange primitive that can be invoked either directly through analog XY coupling or exactly through ancilla-assisted circuit exponentiation.
In a separate numerical-analysis literature, “Exponential-Swap” or eSWAP denotes a quadrature method for evaluating nearly singular line integrals in two dimensions close to periodic boundaries, discretized using the trapezoidal rule. The problem is to evaluate, for a target point SWAP∣a,b⟩=∣b,a⟩09 identified with SWAP∣a,b⟩=∣b,a⟩10 close to a smooth closed curve SWAP∣a,b⟩=∣b,a⟩11, a layer-potential integral
SWAP∣a,b⟩=∣b,a⟩12
with SWAP∣a,b⟩=∣b,a⟩13 parameterized by a SWAP∣a,b⟩=∣b,a⟩14-periodic analytic map SWAP∣a,b⟩=∣b,a⟩15. As SWAP∣a,b⟩=∣b,a⟩16, the integrand ceases to be smooth because there is a nearby singularity at SWAP∣a,b⟩=∣b,a⟩17 satisfying SWAP∣a,b⟩=∣b,a⟩18, and standard trapezoidal-rule convergence deteriorates like SWAP∣a,b⟩=∣b,a⟩19 (Klinteberg, 2023).
The key idea is threefold: find the complex preimage SWAP∣a,b⟩=∣b,a⟩20 via Newton’s method on the Fourier-interpolant of SWAP∣a,b⟩=∣b,a⟩21; swap the singular factor SWAP∣a,b⟩=∣b,a⟩22 for a factor SWAP∣a,b⟩=∣b,a⟩23, leaving a smooth remainder SWAP∣a,b⟩=∣b,a⟩24; and expand SWAP∣a,b⟩=∣b,a⟩25 in the basis SWAP∣a,b⟩=∣b,a⟩26 and evaluate the remaining singular integral analytically using contour integrals on the unit circle. Because SWAP∣a,b⟩=∣b,a⟩27 is smooth and SWAP∣a,b⟩=∣b,a⟩28-periodic, one samples it at SWAP∣a,b⟩=∣b,a⟩29, computes discrete Fourier coefficients by an FFT, and then approximates
SWAP∣a,b⟩=∣b,a⟩30
where the weights
SWAP∣a,b⟩=∣b,a⟩31
are obtained analytically. For SWAP∣a,b⟩=∣b,a⟩32 and SWAP∣a,b⟩=∣b,a⟩33,
SWAP∣a,b⟩=∣b,a⟩34
for SWAP∣a,b⟩=∣b,a⟩35, and SWAP∣a,b⟩=∣b,a⟩36 for SWAP∣a,b⟩=∣b,a⟩37.
The implementation described in the paper precomputes node values SWAP∣a,b⟩=∣b,a⟩38 and SWAP∣a,b⟩=∣b,a⟩39 and their forward FFT’s, finds SWAP∣a,b⟩=∣b,a⟩40 starting from the real node whose SWAP∣a,b⟩=∣b,a⟩41 is closest to SWAP∣a,b⟩=∣b,a⟩42, performs SWAP∣a,b⟩=∣b,a⟩43–SWAP∣a,b⟩=∣b,a⟩44 steps of Newton’s method, forms the regularized samples
SWAP∣a,b⟩=∣b,a⟩45
computes SWAP∣a,b⟩=∣b,a⟩46 by FFT in SWAP∣a,b⟩=∣b,a⟩47, and evaluates the final dot product with the explicit residue-theorem formula for SWAP∣a,b⟩=∣b,a⟩48. The total cost per target is SWAP∣a,b⟩=∣b,a⟩49. To achieve a relative precision SWAP∣a,b⟩=∣b,a⟩50, one needs roughly
SWAP∣a,b⟩=∣b,a⟩51
The theoretical error estimate is
SWAP∣a,b⟩=∣b,a⟩52
because SWAP∣a,b⟩=∣b,a⟩53 is analytic in the strip SWAP∣a,b⟩=∣b,a⟩54 and its Fourier coefficients decay like SWAP∣a,b⟩=∣b,a⟩55. Empirical results on the starfish geometry SWAP∣a,b⟩=∣b,a⟩56 with SWAP∣a,b⟩=∣b,a⟩57 up to SWAP∣a,b⟩=∣b,a⟩58 show that standard trapezoidal-rule suffers SWAP∣a,b⟩=∣b,a⟩59 loss in accuracy as SWAP∣a,b⟩=∣b,a⟩60, whereas eSWAP attains SWAP∣a,b⟩=∣b,a⟩61 accuracy uniformly down to distances as small as SWAP∣a,b⟩=∣b,a⟩62, with exponential convergence in SWAP∣a,b⟩=∣b,a⟩63 independently of distance, and takes SWAP∣a,b⟩=∣b,a⟩64 per target at SWAP∣a,b⟩=∣b,a⟩65 on a laptop. In this usage, eSWAP is therefore a singular quadrature scheme rather than a quantum gate, despite the identical acronym.