Ryan O’Donnell

Quantum Approximate Counting with Nonadaptive Grover Iterations

2021 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

Approximate Counting refers to the problem where we are given query access to a function f : [N] → {0,1}, and we wish to estimate K = #{x : f(x) = 1} to within a …

Efficient quantum tomography II

2016 · arXiv (Cornell University)

Following [OW16], we continue our analysis of: (1) "Quantum tomography", i.e., learning a quantum state, i.e., the quantum generalization of learning a discrete probability distribution; (2) The distribution of Young diagrams output by the RSK …