You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Main question -- what can be done in the case of a hypergraph. Something may be doable for a surface code; big question with more general LDPC codes. Perhaps some tensor contraction protocol would work?
make it mode=2 with some submode
Hashimoto matrix construction Q
Case of k=1. Identify two boundaries to calculate matrix elements with
Calculate the sum (out| Q^n |in) from n=d and up to some nmax
Main question -- what can be done in the case of a hypergraph. Something may be doable for a surface code; big question with more general LDPC codes. Perhaps some tensor contraction protocol would work?
mode=2with somesubmodeQk=1. Identify two boundaries to calculate matrix elements with(out| Q^n |in)fromn=dand up to somenmax