2 citations · 2 across the 2 of their papers we have counts for
3 papers
quant-ph2026
Noisy Quantum Query Complexity via Fractional Block Sensitivity
Mehil Agarwal, Shravas Rao, Fang Song
We study quantum query complexity under several models of imperfect oracle access, and develop lower bounds through a common framework based on fractional block sensitivity ($\oper…
quant-ph2025
NISQ Security and Complexity via Simple Classical Reasoning
Alexandru Cojocaru, Juan Garay, Qipeng Liu +1
We give novel lifting theorems for security games in the quantum random oracle model (QROM) in Noisy Intermediate-Scale Quantum (NISQ) settings such as the hybrid query model, the…
quant-ph2025★ 2 cited
Improved Quantum Lifting by Coherent Measure-and-Reprogram
Alexandru Cojocaru, Juan Garay, Qipeng Liu +1
We give a tighter lifting theorem for security games in the quantum random oracle model. At the core of our main result lies a novel measure-and-reprogram framework that we call co…