1 citations · 1 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2023
A one-query lower bound for unitary synthesis and breaking quantum cryptography
Alex Lombardi, Fermi Ma, John Wright
The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any -qubit unitary can be implemented by an efficient quantum algorithm augmented with an oracle tha…
quant-ph2022★ 1 cited
Succinct Classical Verification of Quantum Computation
James Bartusek, Yael Tauman Kalai, Alex Lombardi +5
We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in th…