Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Luowen Qian:

TR23-204 | 17th November 2023
John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen

An efficient quantum parallel repetition theorem and applications

We prove a tight parallel repetition theorem for 3-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We also prove under plausible assumptions that the security of 4-message computationally secure protocols does not generally decrease under parallel repetition. These mirror the classical results of Bellare, Impagliazzo, ... more >>>

TR20-090 | 10th June 2020
Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian

Tight Quantum Time-Space Tradeoffs for Function Inversion

Revisions: 1

In function inversion, we are given a function $f: [N] \mapsto [N]$, and want to prepare some advice of size $S$, such that we can efficiently invert any image in time $T$. This is a well studied problem with profound connections to cryptography, data structures, communication complexity, and circuit lower ... more >>>

ISSN 1433-8092 | Imprint