2026-07-22T06:30:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2450 2024-03-06T10:33:21Z ddc:004 open_access

Quantum Algorithms for Testing Properties of Distributions Bravyi, Sergey Harrow, Aram W. Hassidim, Avinatan Quantum computing property testing sampling Suppose one has access to oracles generating samples from two unknown probability distributions $p$ and $q$ on some $N$-element set. How many samples does one need to test whether the two distributions are close or far from each other in the $L_1$-norm? This and related questions have been extensively studied during the last years in the field of property testing. In the present paper we study quantum algorithms for testing properties of distributions. It is shown that the $L_1$-distance $\|p-q\|_1$ can be estimated with a constant precision using only $O(N^{1/2})$ queries in the quantum settings, whereas classical computers need $\Omega(N^{1-o(1)})$ queries. We also describe quantum algorithms for testing Uniformity and Orthogonality with query complexity $O(N^{1/3})$. The classical query complexity of these problems is known to be $\Omega(N^{1/2})$. A quantum algorithm for testing Uniformity has been recently independently discovered by Chakraborty et al. \cite{CFMW09}. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sergey Bravyi and Aram W. Harrow and Avinatan Hassidim 2010 Is Part Of LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2010.2450 urn:nbn:de:0030-drops-24502 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2450 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode