The iSWAP equality conjecture for complete-graph gadgets

From papers

Let KnK_n be the complete graph on nn vertices, and consider a gadget associated with a family of 2-local gates having parameter a=59a=\frac{5}{9} in the notation of the paper. Let T2,KnIG\operatorname{\mathcal{T}}_{2,K_n}^{\operatorname{IG}} denote the corresponding second-moment operator for the gadget family, and let Δ()\Delta(\cdot) denote the convergence gap. The iSWAP equality conjecture. For n5n\geq 5,

Δ ⁣(T2,KnIG)=Δ ⁣(T2,KniSWAP).\Delta\!\left(\operatorname{\mathcal{T}}_{2,K_n}^{\operatorname{IG}}\right)=\Delta\!\left(\operatorname{\mathcal{T}}_{2,K_n}^{\operatorname{\mathsf{iSWAP}}}\right).

In particular, gadgets associated with iSWAP\operatorname{\mathsf{iSWAP}}, B\operatorname{\mathsf{B}}, or CNOT\operatorname{\mathsf{CNOT}} satisfy the stated parameter requirement and are conjectured to attain the fastest convergence toward unitary 2-designs for sufficiently large nn. The paper explains that a stronger spectral statement would imply the conjecture, but that a refined method is needed for a proof.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Linghang Kong, Zimu Li and Zi-Wen Liu, “Convergence efficiency of quantum gates and circuits”, arXiv:2411.04898 (2024).

Solutions 0

No solutions have been posted yet.