1 citations · 2 across the 2 of their papers we have counts for
3 papers
Pseudo-deterministic Quantum Algorithms
Hugo Aaronson, Tom Gur, Jiawei Li
We initiate a systematic study of pseudo-deterministic quantum algorithms. These are quantum algorithms that, for any input, output a canonical solution with high probability. Focu…
Quantum Channel Testing in Average-Case Distance
Gregory Rosenthal, Hugo Aaronson, Sathyawageeswar Subramanian +2
We study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel $\mathcal N: \mathbb C^{d_{\mathrm{in}} \times d_{\mathrm{in}…
Distribution-Free Proofs of Proximity
Hugo Aaronson, Tom Gur, Ninad Rajgopal +1
Motivated by the fact that input distributions are often unknown in advance, distribution-free property testing considers a setting where the algorithmic task is to accept function…