Reichardt diagonalizing sequence convergence conjecture

From papers

Let nNn\in\mathbb{N}, set p=2n+1p=2n+1 and θp=πp\theta_p=\frac{\pi}{p}, and let Dj(θp)=diag(λj0,λj1)D_j(\theta_p)=\operatorname{diag}(\lambda_{j0},\lambda_{j1}) for j=1,,nj=1,\ldots,n, where

λj0=ω(1)jj,λj1=(1)j+1ω(1)j+1j,ω=eiθp/2.\lambda_{j0}=\omega^{(-1)^j j},\qquad \lambda_{j1}=(-1)^{j+1}\omega^{(-1)^{j+1}j},\qquad \omega=e^{i\theta_p/2}.

For U0U(2)U_0\in\operatorname{U}(2), define the diagonalizing sequences recursively by

Uk+1(n)=Ap(Uk;θp)=QnUk(1)nPn,U_{k+1}^{(n)}=A_p(U_k;\theta_p)=Q_nU_k^{(-1)^n}P_n,

where P0=Q0=IP_0=Q_0=I and

Pj+1=Dj+1(θp)Uk(1)jPj,Qj+1=QjUk(1)jDj+1(θp).P_{j+1}=D_{j+1}(\theta_p)U_k^{(-1)^j}P_j,\qquad Q_{j+1}=Q_jU_k^{(-1)^j}D_{j+1}(\theta_p).

Diagonalizing sequence conjecture. For every U0U(2)U_0\in\operatorname{U}(2), the sequences satisfy

(Uk+1(n))21=bk+1(n)=bk(n)2n+1=bk(n)p.\left|(U_{k+1}^{(n)})_{21}\right|=\left|b_{k+1}^{(n)}\right|=\left|b_k^{(n)}\right|^{2n+1}=\left|b_k^{(n)}\right|^p.

This exact-power relation would establish the claimed rapid diagonalization of arbitrary single-qubit unitaries by the recursively constructed sequences. The supplied text does not state whether the conjecture has been proved or disproved.

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

Colton Griffin and Shawn X. Cui, “Constructing Approximately Diagonal Quantum Gates”, arXiv:2109.05138 (2022).

Solutions 0

No solutions have been posted yet.