The iSWAP equality conjecture for complete-graph gadgets
The iSWAP equality conjecture for complete-graph gadgets
Let be the complete graph on vertices, and consider a gadget associated with a family of 2-local gates having parameter in the notation of the paper. Let denote the corresponding second-moment operator for the gadget family, and let denote the convergence gap. The iSWAP equality conjecture. For ,
In particular, gadgets associated with , , or satisfy the stated parameter requirement and are conjectured to attain the fastest convergence toward unitary 2-designs for sufficiently large . 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
Sign in to submit a solution.
No solutions have been posted yet.