4 citations · 5 across the 2 of their papers we have counts for
3 papers
quant-ph2026
Unitary complexity in polynomial space
William Kretschmer, Ewin Tang
We show that if quantum commitments exist, then either there is no polynomial-time solution to the unitary synthesis problem, or . Thus, showing un…
quant-ph2024★ 4 cited
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…
quant-ph2024★ 1 cited
Learning the closest product state
Ainesh Bakshi, John Bostanci, William Kretschmer +5
We study the problem of finding a (pure) product state with optimal fidelity to an unknown -qubit quantum state , given copies of . This is a basic instance of a fundament…