4 citations · 4 across the 2 of their papers we have counts for
5 papers · 1 filter
Quantum-Computable One-Way Functions without One-Way Functions
William Kretschmer, Luowen Qian, Avishay Tal
We construct a classical oracle relative to which but quantum-computable quantum-secure trapdoor one-way functions exist. This is a substantial strengthe…
An efficient quantum parallel repetition theorem and applications
John Bostanci, Luowen Qian, Nicholas Spooner +1
We prove a tight parallel repetition theorem for -message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We als…
Unitary Complexity and the Uhlmann Transformation Problem
John Bostanci, Yuval Efron, Tony Metger +3
State transformation problems such as compressing quantum information or breaking quantum commitments are fundamental quantum tasks. However, their computational difficulty cannot…
Tight Quantum Time-Space Tradeoffs for Function Inversion
Kai-Min Chung, Siyao Guo, Qipeng Liu +1
In function inversion, we are given a function , and want to prepare some advice of size , such that we can efficiently invert any image in time . This is…
Lower Bounds for Function Inversion with Quantum Advice
Kai-Min Chung, Tai-Ning Liao, Luowen Qian
Function inversion is the problem that given a random function , we want to find pre-image of any image in time . In this work, we revisit this probl…