~/talk

Quantum 4

links:none on file
slides:none on file

Quantum commitments and many other primitives can plausibly exist without one-way functions: oracle separations show pseudorandom state implies commitments and that quantum commitments exist relative to quantum or classical oracles even if BQP = QMA or P = NP, respectively. Constructions go from quantum one-way states to one-way puzzle -> commitments by converting many-state copies into classical shadows and proving inversion remains hard. A separate line reduces average-case hardness of output probabilities (permanent / boson sampling / random circuits) to one-way puzzles. Open: base commitments on weaker worst-case assumptions (e.g., P ≠ PSPACE).

AI-written summary · about

  1. 0:00Quantum cryptography assumptions
  2. 2:33Quantum key distribution
  3. 4:01Pseudorandom states in quantum
  4. 16:50Quantum cryptographic primitives
  5. 23:31One-way state generators
  6. 37:49One-way puzzles in quantum
  7. 43:48Building puzzles from quantum advantage
  8. 53:14Open problems in quantum crypto
~/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.