Quaternionic gate-net covering conjecture for
Quaternionic gate-net covering conjecture for
Let , let be the unit -sphere, and let denote the integer solutions of
For , write for the corresponding normalized point, and let be the ball of radius centered at for the metric . Quaternionic gate-net covering conjecture. Given , can be covered by balls centered at each with radius , where is a fixed constant:
This weaker covering statement is presented as sufficient to prove the upper bound 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.