Fig. 5: Comparison of walk orders with m = n.
Greedy(MHS) (Greedy(Sorted)) uses MHS Linear (Sorted) as the initial ordering. Each data point is averaged over 1000 random states.
Fig. 5: Comparison of walk orders with m = n. | npj Quantum Information
Greedy(MHS) (Greedy(Sorted)) uses MHS Linear (Sorted) as the initial ordering. Each data point is averaged over 1000 random states.
