Cyclic HSP 0 r 2r ℤ/Nℤ
↝ find r in complexity poly ( log N )
G H 1+H 2+H 3+H 4+H 5+H
↝ find H in complexity poly ( log ∣ G ∣ )
↝ O ( log ∣ G ∣ ) entangled coset states
⋂ i = 1 m Ker ρ i = largest normal subgroup of G included in H
↝ Dedekindian Groups
Isomorphic Graphs
A lattice V Vmin
↝ find d using coset sampling
{ 1 } = G 0 ⊲ G 1 ⊲ G 2 ⊲ … ⊲ G m = G where G i + 1 G i is non-trivial simple group.
↝ general HSP if