Quaternionic gate-net covering conjecture for PSU(2)PSU(2)

Let tNt\in\mathbb{N}^*, let S3R4S^3\subset\mathbb{R}^4 be the unit 33-sphere, and let ν(5t)\nu(5^t) denote the integer solutions of

x12+x22+x32+x42=5t.x_1^2+x_2^2+x_3^2+x_4^2=5^t.

For xν(5t)ν(5t1)x\in\nu(5^t)\cup\nu(5^{t-1}), write x/xx/\sqrt{|x|} for the corresponding normalized point, and let BG(c,r)B_G(c,r) be the ball of radius rr centered at cc for the metric dGd_G. Quaternionic gate-net covering conjecture. Given tNt\in\mathbb{N}^*, S3S^3 can be covered by balls centered at each x/xν^(5t)ν^(5t1)x/\sqrt{|x|}\in\widehat{\nu}(5^t)\cup\widehat{\nu}(5^{t-1}) with radius r=tn5t/4r=t^n\cdot 5^{-t/4}, where nn is a fixed constant:

S3xν(5t)ν(5t1)BG(xx,r).S^3\subset\bigcup_{x\in\nu(5^t)\cup\nu(5^{t-1})}B_G\left(\frac{x}{\sqrt{|x|}},r\right).

This weaker covering statement is presented as sufficient to prove the upper bound K(T)4/3K(T)\leqslant 4/3 for the typical-case compilation exponent. Its resolution is not supplied in the source.

Sources & referencesView supporting material

Primary source

Kingsley Yeon, Steven B. Damelin and Alec Greene, “Typical-Case Gate Approximation and Arithmetic Obstructions in Quaternionic Single-Qubit Compilation”, arXiv:1506.05785 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.