4 papers · 1 filter
The Exact Communication Threshold for Parallel Repetition
Daiki Suruga
The parallel repetition theorem is a fundamental tool in theoretical computer science, showing that the probability of winning all independent instances of a finite two-player…
Exact Asymptotic Rates and an Exponential Strong Converse for quantum SMP and One-Way Communication
Daiki Suruga
Computing many instances jointly can reduce communication per instance. We ask whether such savings occur in the simultaneous-message-passing (SMP) model and how they depend on qua…
Zero-error expectation equals amortized query complexity
Daiki Suruga
This paper investigates the direct sum question for expected randomized and distributional query complexity. Our main result gives an exact characterization of the amortized expect…
Zero-error information equals amortized communication complexity
Daiki Suruga
The direct sum problem in computational complexity asks whether solving independent instances of a computational task inherently requires times the resources needed to solv…