Quantum property testing

Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Röhrig

Research output: Contribution to conferencePaperpeer-review


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.

Original languageEnglish
Number of pages9
StatePublished - 2003
EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
Duration: 2 Nov 19983 Nov 1998


ConferenceConfiguralble Computing: Technology and Applications
Country/TerritoryUnited States
CityBoston, MA

ASJC Scopus subject areas

  • Software
  • General Mathematics


Dive into the research topics of 'Quantum property testing'. Together they form a unique fingerprint.

Cite this