Quantum Property Testing
Quantum Physics
2007-05-23 v1
Abstract
A language L has a property tester if there exists a probabilistic algorithm that given an input x only asks a small number of bits of x and distinguishes the cases as to whether x is in L and x has large Hamming distance from all y in L. We define a similar notion of quantum property testing and show that there exist languages with quantum property testers but no good classical testers. We also show there exist languages which require a large number of queries even for quantumly testing.
Cite
@article{arxiv.quant-ph/0201117,
title = {Quantum Property Testing},
author = {H. Buhrman and L. Fortnow and I. Newman and H. Roehrig},
journal= {arXiv preprint arXiv:quant-ph/0201117},
year = {2007}
}