~/talk

On Polytopes and Convex Sets Associated with Graphical Models in Classical and Quantum...

links:none on file
slides:none on file

Defines the local marginal polytope and shows it is typically strictly larger than the true marginal polytope, proves that points in the larger set correspond to valid configurations in graph covers (double, triple, n‑fold; one toy double cover yields 32 edge choices), and connects that gap to why the sum-product algorithm (loopy belief propagation) gives good but suboptimal decodings used for LDPC codes in 5G. Extends the same polytope/cover machinery to normal factor graphs and quantum mass functions to reframe Bell‑type paradoxes and decoherence.

AI-written summary · about

  1. 0:00Introduction and motivation
  2. 1:55Marginal polytopes
  3. 5:05Local marginal polytopes
  4. 8:11Comparing polytopes
  5. 11:24Graphical models
  6. 17:32Data communication and coding
  7. 20:44Sum-product algorithm
  8. 26:06Graph covers
  9. 33:45Quantum information processing
  10. 37:12Quantum correlations and summary
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.