1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
quant-ph2026
Lower Bounds for Preprocessing Attacks on Quantum Cryptography
Fangqi Dong, Alex Lombardi
We prove near-optimal lower bounds for preprocessing attacks on quantum cryptography in the random oracle model. Specifically, we show that a -query adversary with qubits of…
quant-ph2026
Explicit Separations for One-Query Unitary Synthesis
Fangqi Dong, Alex Lombardi, Fermi Ma
The unitary synthesis problem (Aaronson-Kuperberg, CCC 2007) asks whether every -qubit unitary is computable by efficient quantum circuits relative to some classical oracle…
quant-ph2026
Quantum Lazy Sampling and Path Recording for Any Group
Ben Foxman, Alex Lombardi, Fermi Ma +2
A central challenge in quantum algorithms and cryptography is reasoning about algorithms with oracle access to a random group element (e.g. a random function, permutation, or unita…