Double-bracket flow quantum algorithm for diagonalization
Marek Gluza
NTU Singapore
slides.com/marekgluza
New quantum algorithm for diagonalization
\hat H \mapsto \hat \mathcal H_\ell = \hat \mathcal U_\ell^\dagger \hat H \hat\mathcal U_\ell
\partial_\ell \hat \mathcal H_\ell = [[A(\hat \mathcal H_\ell),B(\hat \mathcal H_\ell)], \hat \mathcal H_\ell]
no qubit overheads
no controlled-unitaries
0
0
0
0
C
0
0
0
0
Simple
=
Easy
Doesn't spark joy :(
∂ℓH^ℓ=[W^ℓ,H^ℓ]
\partial_\ell \hat H_\ell = [\hat W_\ell, \hat H_\ell]
W^ℓ=[Δ(H^ℓ),σ(H^ℓ)]
\hat W_\ell = [\Delta(\hat H_\ell),\sigma(\hat H_\ell)]
Δ(H^ℓ)
\Delta(\hat H_\ell)
σ(H^ℓ)
\sigma(\hat H_\ell)
Głazek-Wilson-Wegner flow
Restriction to off-diagonal
Restriction to diagonal
∂ℓ∥σ(H^ℓ)∥HS2=−2∥W^ℓ∥HS2≤0
\partial_\ell \|\sigma(\hat H_\ell)\|_{\text{HS}}^2 = -2\|\hat W_\ell\|_{\text{HS}}^2 \le 0
as a quantum algorithm
Unitary U^ℓ such that
\text{Unitary } \hat U_\ell \text{ such that }
W^ℓ=[Δ(H^ℓ),σ(H^ℓ)]
\hat W_\ell = [\Delta(\hat H_\ell),\sigma(\hat H_\ell)]
Głazek-Wilson-Wegner flow
∂ℓ∥σ(H^ℓ)∥HS2=−2∥W^ℓ∥HS2≤0
\partial_\ell \|\sigma(\hat H_\ell)\|_{\text{HS}}^2 = -2\|\hat W_\ell\|_{\text{HS}}^2 \le 0
as a quantum algorithm
H^ℓ=U^ℓH^0U^ℓ†
\hat H_\ell = \hat U_\ell \hat H_0 \hat U_\ell^\dagger
∂ℓH^ℓ=[W^ℓ,H^ℓ]
\partial_\ell \hat H_\ell = [\hat W_\ell, \hat H_\ell]
New quantum algorithm for diagonalization
\hat H \mapsto \hat \mathcal H_\ell = \hat \mathcal U_\ell^\dagger \hat H \hat\mathcal U_\ell
\partial_\ell \hat \mathcal H_\ell = [[A(\hat \mathcal H_\ell),B(\hat \mathcal H_\ell)], \hat \mathcal H_\ell]
0
0
0
0
D^s(J^)=∏μ∈{0,1}×LZ^μe−isJ^/DZ^μ
\hat D_s(\hat J) = \prod_{\mu\in\{0,1\}^{\times L}} \hat Z_\mu e^{-i s \hat J/D} \hat Z_\mu
C^s(J^)=(D^s/K(J^)†eis/KJ^D^s/K(J^)e−is/KJ^)K
\hat C_s(\hat J) = \left( \hat D_{\sqrt{s/K}}(\hat J)^\dagger \;e^{i\sqrt{s/K}\hat J}\;\hat D_{\sqrt{s/K}}(\hat J)\;e^{-i\sqrt{s/K}\hat J}\right)^K
1) Dephasing
2) Group commutator
3) Frame shifting
\partial_\ell \hat \mathcal H_\ell = [[A(\hat \mathcal H_\ell),B(\hat \mathcal H_\ell)], \hat \mathcal H_\ell]
V^k=C^s(J^1)C^s(J^2)…C^s(J^k−1)≈e−sW^1e−sW^2…e−sW^k−1
\hat V_k = \hat C_s(\hat J_{1})\; \hat C_s(\hat J_{2})\ldots \hat C_s(\hat J_{k-1}) \approx e^{-s \hat W_1}\;e^{-s \hat W_2}\ldots e^{-s \hat W_{k-1}}
How to understand the continuous flow?
H^1=esW^1H^e−sW^1
\hat H_1 = e^{s \hat W_1} \hat H e^{-s \hat W_1}
W^1=[Δ(H^),σ(H^)]
\hat W_1 = [\Delta(\hat H),\sigma(\hat H)]
W^k=[Δ(H^k−1),σ(H^k−1)]
\hat W_k = [\Delta(\hat H_{k-1}),\sigma(\hat H_{k-1})]
H^k=esW^kH^k−1e−sW^k
\hat H_k = e^{s \hat W_k} \hat H_{k-1} e^{-s \hat W_k}
H^TFIM=∑i=1L−1X^iX^i+1+∑i=1LZ^i
\hat H_\text{TFIM} = \sum_{i=1}^{L-1}\hat X_i\hat X_{i+1}+\sum_{i=1}^L \hat Z_i
Piece-wise constant discretization
antihermitian
unitary
(iH^)†=−iH^
\left(i\hat H\right)^\dagger = -i \hat H
How to quantum?
Group commutator
\hat H \mapsto \hat \mathcal H_\ell = \hat \mathcal U_\ell^\dagger \hat H \hat\mathcal U_\ell
\partial_\ell \hat \mathcal H_\ell = [[A(\hat \mathcal H_\ell),B(\hat \mathcal H_\ell)], \hat \mathcal H_\ell]
0
0
0
0
Want
H^1=esW^1H^e−sW^1
\hat H_1 = e^{s \hat W_1} \hat H e^{-s \hat W_1}
W^1=[Δ(H^),σ(H^)]
\hat W_1 = [\Delta(\hat H),\sigma(\hat H)]
eisΔ(H^)eisH^e−isΔ(H^)e−isH^=e−s2[Δ(H^),σ(H^)]+E^(GC)
e^{is\Delta(\hat H)}e^{is\hat H}e^{-is\Delta(\hat H)}e^{-is\hat H}= e^{-s^2[\Delta(\hat H),\sigma(\hat H)]} +\hat E^\text{(GC)}
New bound
∥E^(GC)∥≤4∥H^∥∥[Δ(H^),σ(H^)]∥s3
\|\hat E^\text{(GC)}\| \le 4\|\hat H\|\,\|[\Delta(\hat H),\sigma(\hat H)]\| s^3
Group commutator
\hat H \mapsto \hat \mathcal H_\ell = \hat \mathcal U_\ell^\dagger \hat H \hat\mathcal U_\ell
\partial_\ell \hat \mathcal H_\ell = [[A(\hat \mathcal H_\ell),B(\hat \mathcal H_\ell)], \hat \mathcal H_\ell]
0
0
0
0
Want
H^1=esW^1H^e−sW^1
\hat H_1 = e^{s \hat W_1} \hat H e^{-s \hat W_1}
W^1=[Δ(H^),σ(H^)]
\hat W_1 = [\Delta(\hat H),\sigma(\hat H)]
eisΔ(H^)eisH^e−isΔ(H^)e−isH^=e−s2[Δ(H^),σ(H^)]+E^(GC)
e^{is\Delta(\hat H)}e^{is\hat H}e^{-is\Delta(\hat H)}e^{-is\hat H}= e^{- s^2[\Delta(\hat H),\sigma(\hat H)]} +\hat E^\text{(GC)}
How to get ?
D^s(H^)≈eisΔ(H^)
\hat D_s(\hat H) \approx e^{is\Delta(\hat H)}
C^s(J^)=D^s(J^)†eisJ^D^s(J^)e−isJ^≈e−sW^(J^)
\hat C_s(\hat J) = \hat D_{\sqrt{s}}(\hat J)^\dagger \; e^{i\sqrt{s}\hat J}\; \hat D_{\sqrt{s}}(\hat J)\; e^{-i\sqrt{s}\hat J}
\approx e^{-s \hat W(\hat J)}
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0
0
Phase flip unitaries
μ=(
\mu = (
)
)
N
S
N
S
N
S
N
S
Z^
\hat Z
1
\mathbb 1
1
\mathbb 1
⊗
\otimes
⊗
\otimes
⊗
\otimes
⊗
\otimes
⊗
\otimes
⊗
\otimes
⊗
\otimes
Z^
\hat Z
Z^
\hat Z
Z^
\hat Z
1
\mathbb 1
1
\mathbb 1
0,
0,
1,
1,
0,
0,
1,
1,
0,
0,
0,
0,
0,
0,
1
1
μ=(
\mu = (
)
)
1
1
⊗
\otimes
1
\mathbb 1
⊗
\otimes
1
\mathbb 1
⊗
\otimes
Z^
\hat Z
⊗
\otimes
1
1
⊗
\otimes
1
\mathbb 1
⊗
\otimes
Z^
\hat Z
⊗
\otimes
Z^
\hat Z
N
S
N
S
N
S
Phase flip unitaries
Evolution under dephased generators
H^↦H^ℓ=U^ℓ†H^U^ℓ
\hat H \mapsto \hat H_\ell = \hat U_\ell^\dagger \hat H \hat U_\ell
∂ℓH^ℓ=[[A(H^ℓ),B(H^ℓ)],H^ℓ]
\partial_\ell \hat H_\ell = [[A(\hat H_\ell),B(\hat H_\ell)], \hat H_\ell]
0
0
0
0
Z^μe−isJ^Z^μ=e−isZ^μJ^Z^μ
\hat Z_\mu e^{-i s \hat J} \hat Z_\mu = e^{-is \hat Z_\mu \hat J\hat Z_\mu}
D^s(J^)≈∏μ∈RZ^μe−isJ^/DZ^μ
\hat D_s(\hat J) \approx \prod_{\mu\in R} \hat Z_\mu e^{-i s \hat J/D} \hat Z_\mu
We can make it efficient:
Δ(J^)=dim(J^)1∑μ∈{0,1}×LZ^μJ^Z^μ
\Delta(\hat J)= \frac 1 {\dim (\hat J)} \sum_{\mu\in\{0,1\}^{\times L}} \hat Z_\mu \hat J \hat Z_\mu
R⊆{0,1}×L
R \subseteq \{0,1\}^{\times L}
Use unitarity
and repeat many times
New quantum algorithm for diagonalization
\hat H \mapsto \hat \mathcal H_\ell = \hat \mathcal U_\ell^\dagger \hat H \hat\mathcal U_\ell
\partial_\ell \hat \mathcal H_\ell = [[A(\hat \mathcal H_\ell),B(\hat \mathcal H_\ell)], \hat \mathcal H_\ell]
0
0
0
0
D^s(J^)=∏μ∈{0,1}×LZ^μe−isJ^/DZ^μ
\hat D_s(\hat J) = \prod_{\mu\in\{0,1\}^{\times L}} \hat Z_\mu e^{-i s \hat J/D} \hat Z_\mu
C^s(J^)=(D^2s/K(J^)†ei2s/KJ^D^2s/K(J^)e−i2s/KJ^)K
\hat C_s(\hat J) = \left( \hat D_{\sqrt{2s/K}}(\hat J)^\dagger \;e^{i\sqrt{2s/K}\hat J}\;\hat D_{\sqrt{2s/K}}(\hat J)\;e^{-i\sqrt{2s/K}\hat J}\right)^K
V^k=V^k−1C^s(J^k−1)
\hat V_k = \hat V_{k-1}\hat C_s(\hat J_{k-1})
J^k−1=V^k−1†H^V^k−1
\hat J_{k-1} = \hat V_{k-1}^\dagger \hat H \hat V_{k-1}
1) Dephasing
2) Group commutator
3) Frame shifting
\partial_\ell \hat \mathcal H_\ell = [[A(\hat \mathcal H_\ell),B(\hat \mathcal H_\ell)], \hat \mathcal H_\ell]
V^k=C^s(J^1)C^s(J^2)…C^s(J^k−1)≈e−sW^1e−sW^2…e−sW^k−1
\hat V_k = \hat C_s(\hat J_{1})\; \hat C_s(\hat J_{2})\ldots \hat C_s(\hat J_{k-1}) \approx e^{-s \hat W_1}\;e^{-s \hat W_2}\ldots e^{-s \hat W_{k-1}}
What's going on?
Double-bracket flow
Unitary
Satisfies a generalization of the Heisenberg equation
H^ℓ=U^ℓ†H^U^ℓ
\hat H_\ell = \hat U_\ell^\dagger \hat H \hat U_\ell
∂ℓH^ℓ=[[A(H^ℓ),B(H^ℓ)],H^ℓ]
\partial_\ell \hat H_\ell = [[A(\hat H_\ell),B(\hat H_\ell)], \hat H_\ell]
U^ℓ
\hat U_\ell
GWW is a particular example
∂ℓH^ℓ=[[Δ(H^ℓ),σ(H^ℓ)],H^ℓ]
\partial_\ell \hat H_\ell = [[\Delta(\hat H_\ell),\sigma(\hat H_\ell)], \hat H_\ell]
transformation of
H^
\hat H
H^s=esW^(Z)H^e−sW^(Z)
\hat H_s = e^{s \hat W^{(Z)}} \hat H e^{-s \hat W^{(Z)}}
W^(Z)=[Δ(Z)(H^),H^],
\hat W^{(Z)} = [\Delta^{(Z)}(\hat H), \hat H ],
∂s∥σ(H^s)∥HS2=−2⟨W^(Z),W^⟩HS
\partial_s \|\sigma(\hat H_s)\|_{\text{HS}}^2 = -2\langle \hat W^{(Z)},\hat W\rangle_{\text{HS}}
Δ(Z)(H^) - diagonal
\Delta^{(Z)}(\hat H) \text{ - diagonal}
Variational double-bracket flows
that are diagonalizing
∂ℓ∥σ(H^ℓ)∥HS2=−2∥W^ℓ∥HS2≤0
\partial_\ell \|\sigma(\hat H_\ell)\|_{\text{HS}}^2 = -2\|\hat W_\ell\|_{\text{HS}}^2 \le 0
How well does it work?
Variational flow example
Notice the steady increase of diagonal dominance.
Variational vs. GWW flow
Notice that degeneracies limit GWW diagonalization but variational brackets can lift them.
GWW for 9 qubits
Notice the spectrum is almost converged.
How does it work again?
GWW for 9 qubits
Notice that some of them are essentially eigenstates!
What else is there?
Linear programming
Matching optimization
Diagonalization
Sorting
QR decomposition
Toda flow
∂ℓH^ℓ=[[A(H^ℓ),B(H^ℓ)],H^ℓ]
\partial_\ell \hat H_\ell = [[A(\hat H_\ell), B(\hat H_\ell)] , \hat H_\ell]
Double-bracket flow
Runtime-boosting heuristics
Analytical convergence analysis
Group commutator bound
Hasting's conjecture
Relation to other quantum algorithms
Code is available on Github
0
0
0
0
C
Double-bracket flow quantum algorithm for diagonalization
Material science?
0
0
0
0
C
Double-bracket flow quantum algorithm for diagonalization Marek Gluza NTU Singapore slides.com/marekgluza https://arxiv.org/abs/2206.11772
12 min: Double-bracket flow quantum algorithm for diagonalization
By Marek Gluza
12 min: Double-bracket flow quantum algorithm for diagonalization
- 2,049
