~/talk

Entanglement Spread in Communication Complexity and Many-Body Physics

Talkat Quantum Wave in Computing Reunion 2021 · on Thursday, 2021-07-15
links:none on file
slides:none on file

Defines entanglement spread as the operational width of a Schmidt-weight distribution and proves it both upper- and lower-bounds the qubit communication needed to (unitarily) prepare or test a pure state, with cost given by an L∞ earth mover distance between entanglement distributions. Example: a superposition of product and N‑EPR components requires ~N/2 qubits to make from EPRs. Testing a maximally entangled state uses O(log 1/ε) qubits via quantum expanders. Shows ground‑state spread ≤ boundary size / gap (and a neighborhood √ bound), and that exotic helpers (except embezzlers) don’t beat EPR reducibility for standard communication complexity.

AI-written summary · about

  1. 0:00Start
  2. 0:04Super Selection Principle for Entanglement
  3. 4:13Super Selection Rules
  4. 4:30Analog for Entanglement
  5. 20:52Outcome Measurement
  6. 28:07Upper Bound
  7. 30:49Quantum Expander
  8. 33:35Arial Laws and Communication Complexity
  9. 37:36The Proof
  10. 44:45Upper Bounds on the Entanglement Spread of the Ground State
~/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.