no code implementations • 5 Mar 2024 • Andreas Bluhm, Matthias C. Caro, Aadil Oufkir
Our work initiates the study of property testing for quantum Hamiltonians, demonstrating that a broad class of Hamiltonian properties is efficiently testable even with limited quantum capabilities, and positioning Hamiltonian testing as an independent area of research alongside Hamiltonian learning.
no code implementations • 22 Jan 2023 • Omar Fawzi, Aadil Oufkir, Daniel Stilck França
In the adaptive setting, we show a lower bound of $\Omega(2^{2. 5n}\epsilon^{-2})$ for $\epsilon=\mathcal{O}(2^{-n})$, and a lower bound of $\Omega(2^{2n}\epsilon^{-2} )$ for any $\epsilon > 0$.
no code implementations • NeurIPS 2021 • Aadil Oufkir, Omar Fawzi, Nicolas Flammarion, Aurélien Garivier
For a general alphabet size $n$, we give a sequential algorithm that uses no more samples than its batch counterpart, and possibly fewer if the actual distance between $\mathcal{D}_1$ and $\mathcal{D}_2$ is larger than $\epsilon$.
