Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exponential-SWAP (eSWAP) Gate

Updated 15 July 2026
  • 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(θ)=eiθSWAPU_{\mathrm{eSWAP}}(\theta)=e^{-i\theta\,\mathrm{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

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle

in the computational basis {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}. As a Hermitian involution SWAP2=I\mathrm{SWAP}^2=I, it has two eigenvalues +1+1 and one eigenvalue 1-1. By spectral calculus one defines the “exponential-SWAP” family

UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.

Its action is diagonal on 00|00\rangle and 11|11\rangle,

UeSWAP(θ)00=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,

while on the single-excitation subspace it acts as

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle0

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle1

Up to the overall phase SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle2, this is exactly a rotation in the SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle3 subspace by angle SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle4, passing continuously from the identity SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle5 to the SWAP gate SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle6 (Rasmussen et al., 2020).

An equivalent description uses a natural two-qubit exchange Hamiltonian. In systems with an XY-type interaction

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle7

the time evolution

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle8

coincides, up to local SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle9-phases, with a fractional {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}0SWAP on the single-excitation subspace. Setting {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}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}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}2

where {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}3 is the effective exchange-coupling strength. In a frame that removes the single-qubit energies and absorbs any dynamic {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}4-shifts into later calibrated {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}5-rotations on each qubit, the time evolution is

{00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}6

so the native interaction is a fractional {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}7SWAP (Rasmussen et al., 2020).

To convert this fractional {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}8SWAP into exactly {00,01,10,11}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}9, one inserts local SWAP2=I\mathrm{SWAP}^2=I0-rotations SWAP2=I\mathrm{SWAP}^2=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=I\mathrm{SWAP}^2=I2 gates. The resulting implementation is deterministic, has depth SWAP2=I\mathrm{SWAP}^2=I3, and uses a single flux-pulse window together with two virtual SWAP2=I\mathrm{SWAP}^2=I4’s per side.

The same description gives a concrete duration scale: for SWAP2=I\mathrm{SWAP}^2=I5 MHz one finds SWAP2=I\mathrm{SWAP}^2=I6, so a SWAP2=I\mathrm{SWAP}^2=I7 at SWAP2=I\mathrm{SWAP}^2=I8 is SWAP2=I\mathrm{SWAP}^2=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 +1+10 and directly implements the fractional +1+11SWAP, which by local +1+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 +1+13, SWAP is a Hermitian involution of cyclic order +1+14. The protocol introduces one ancilla qubit, prepares it in the superposition

+1+15

applies one controlled-SWAP (Fredkin) gate controlled by the ancilla and targeting the two data qubits, and then measures the ancilla in the +1+16-basis +1+17, with

+1+18

If the outcome is +1+19, the two-qubit register is projected onto

1-10

so one exactly realizes 1-11 up to a known global normalization (Rasmussen et al., 2020).

If instead the result is 1-12, one obtains

1-13

which can be converted back to the target 1-14 by a simple corrective routine, either a second controlled-SWAP or a post-measurement phase flip. The feed-forward for the “1-15” branch is described as trivial: because the outcome differs by an extra minus-sign on the SWAP term, a single controlled-1-16 or a second controlled-SWAP yields the desired sign flip.

The success probability for the “1-17” branch is

1-18

For small 1-19 this is UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.0, and at UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.1 one has UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.2. With one additional Fredkin, or a controlled-UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{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(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.4 data qubits, UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.5 flux-pulse window, two virtual UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.6’s per side, depth UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.7, and duration UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.8. The probabilistic implementation uses UeSWAP(θ)eiθSWAP=cosθIisinθSWAP.U_{\mathrm{eSWAP}}(\theta)\coloneqq e^{-i\theta\,\mathrm{SWAP}} = \cos\theta\,I - i\sin\theta\,\mathrm{SWAP}.9 additional ancilla, one controlled-SWAP (Fredkin) gate, two single-qubit rotations on the ancilla, one ancilla readout in the 00|00\rangle0-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|00\rangle1 gates Gate times are 00|00\rangle2–00|00\rangle3 ns
Ancilla-based 1 ancilla; 1 Fredkin; ancilla rotations and readout Overall exponentiation fidelities 00|00\rangle4 for small 00|00\rangle5

The fidelity analysis in Rasmussen and Zinner includes realistic qubit coherence times 00|00\rangle6s, flux-pulse shaping to avoid leakage, and random 00|00\rangle7–00|00\rangle8 fabrication scatter in circuit parameters using QuTiP master-equation simulations. For the bare controlled-00|00\rangle9SWAP 11|11\rangle0 with 11|11\rangle1, the reported process fidelities are above 11|11\rangle2 in the noiseless case, and 11|11\rangle3 once decoherence is included. Even for up to four controls 11|11\rangle4 the average fidelity stays 11|11\rangle5 under the same 11|11\rangle6 assumptions. A large Monte-Carlo ensemble with 11|11\rangle7 jitter in Josephson energies and capacitances still yields 11|11\rangle8 of runs above 11|11\rangle9 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=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,0 per Fredkin plus single-qubit gates at UeSWAP(θ)00=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,1 each, so overall exponentiation fidelities UeSWAP(θ)00=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,2 are readily within reach for small UeSWAP(θ)00=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,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=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,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=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,5, satisfying UeSWAP(θ)00=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,6, the paper shows that one needs UeSWAP(θ)00=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,7 ancillas and UeSWAP(θ)00=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,8 controlled-UeSWAP(θ)00=eiθ00,UeSWAP(θ)11=eiθ11,U_{\mathrm{eSWAP}}(\theta)|00\rangle = e^{-i\theta}|00\rangle,\qquad U_{\mathrm{eSWAP}}(\theta)|11\rangle = e^{-i\theta}|11\rangle,9 operations, measured in the SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle00 basis. The success probability of the all-plus branch scales as SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle01 for small SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle02, but may be improved by feed-forward. A specific example in the paper is controlled-SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle03SWAP itself, which has order SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle04; accordingly, one may build SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle05 exactly with three ancillas and SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle06 controlled-SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle07SWAPs.

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 SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle08 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.

6. Distinct numerical-analysis usage: exponential-swap quadrature

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 SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle09 identified with SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle10 close to a smooth closed curve SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle11, a layer-potential integral

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle12

with SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle13 parameterized by a SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle14-periodic analytic map SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle15. As SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle16, the integrand ceases to be smooth because there is a nearby singularity at SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle17 satisfying SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle18, and standard trapezoidal-rule convergence deteriorates like SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle19 (Klinteberg, 2023).

The key idea is threefold: find the complex preimage SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle20 via Newton’s method on the Fourier-interpolant of SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle21; swap the singular factor SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle22 for a factor SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle23, leaving a smooth remainder SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle24; and expand SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle25 in the basis SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle26 and evaluate the remaining singular integral analytically using contour integrals on the unit circle. Because SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle27 is smooth and SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle28-periodic, one samples it at SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle29, computes discrete Fourier coefficients by an FFT, and then approximates

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle30

where the weights

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle31

are obtained analytically. For SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle32 and SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle33,

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle34

for SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle35, and SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle36 for SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle37.

The implementation described in the paper precomputes node values SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle38 and SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle39 and their forward FFT’s, finds SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle40 starting from the real node whose SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle41 is closest to SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle42, performs SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle43–SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle44 steps of Newton’s method, forms the regularized samples

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle45

computes SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle46 by FFT in SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle47, and evaluates the final dot product with the explicit residue-theorem formula for SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle48. The total cost per target is SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle49. To achieve a relative precision SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle50, one needs roughly

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle51

The theoretical error estimate is

SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle52

because SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle53 is analytic in the strip SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle54 and its Fourier coefficients decay like SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle55. Empirical results on the starfish geometry SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle56 with SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle57 up to SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle58 show that standard trapezoidal-rule suffers SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle59 loss in accuracy as SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle60, whereas eSWAP attains SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle61 accuracy uniformly down to distances as small as SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle62, with exponential convergence in SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle63 independently of distance, and takes SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle64 per target at SWAPa,b=b,a\mathrm{SWAP}\,|a,b\rangle = |b,a\rangle65 on a laptop. In this usage, eSWAP is therefore a singular quadrature scheme rather than a quantum gate, despite the identical acronym.

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 Exponential-SWAP (eSWAP).