@inproceedings{3772ed774ddb4503a23428982bc43f5d,

title = "Quantum algorithms for testing properties of distributions",

abstract = "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 L1-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 L1-distance ||p - q||1 can be estimated with a constant precision using only O(N1/2) queries in the quantum settings, whereas classical computers need Ω(N 1-o(1)) queries. We also describe quantum algorithms for testing Uniformity and Orthogonality with query complexity O(N1/ 3). The classical query complexity of these problems is known to be Ω(N1/2). A quantum algorithm for testing Uniformity has been recently independently discovered by Chakraborty et al [14].",

keywords = "Property testing, Quantum computing, Sampling",

author = "Sergey Bravyi and Harrow, {Aram W.} and Avinatan Hassidim",

year = "2010",

doi = "10.4230/LIPIcs.STACS.2010.2450",

language = "אנגלית",

isbn = "9783939897163",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

pages = "131--142",

booktitle = "STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science",

note = "27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010 ; Conference date: 04-03-2010 Through 06-03-2010",

}