~/talk

Verification of BosonSampling Devices

Talkat Quantum Games and Protocols · 2014-02-24..02-28
links:none on file
slides:none on file

BosonSampling uses N identical photons through an M‑mode linear optical network so output probabilities equal the permanent of N×N submatrix amplitudes, giving complexity evidence that exact classical sampling would collapse the polynomial hierarchy. Experiments verify 3–4 photons; scaling stalls because all N photons must arrive simultaneously, but a practical workaround is scattershot boson sampling with many heralded SPDC sources. Verification avoids computing permanents by using row‑norm estimators and collision statistics; main open problems: robust average‑case hardness and interactive verification.

AI-written summary · about

  1. 0:00Introduction
  2. 7:12BosonSampling
  3. 10:48Quantum Interference
  4. 16:54The Catch
  5. 20:16The Experiment
  6. 21:04The Problem
  7. 21:48Exact vs Approximate
  8. 38:22Time of Arrival
  9. 41:47SPDC Source
  10. 47:51Verification
  11. 49:05Response
  12. 54:33Open Problems
~/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.