1 citations · 1 across the 3 of their papers we have counts for
Showing 2026 · quant-phShow all
2 papers · 2 filters
quant-ph2026
Random-Oracle Unitary Synthesis is Impossible
Andrew Huang, Akshar Ramkumar, John Wright
A major open problem in quantum complexity is the question of unitary synthesis---namely, is it possible to efficiently implement any unitary, given the ability to evaluate any cla…
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…