Quantum property testing

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

Quantum property testing

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

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

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.

Original language	English
Pages	480-488
Number of pages	9
State	Published - 2003
Event	Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: 2 Nov 1998 → 3 Nov 1998

Conference

Conference	Configuralble Computing: Technology and Applications
Country/Territory	United States
City	Boston, MA
Period	2/11/98 → 3/11/98

ASJC Scopus subject areas

Software
General Mathematics

Cite this

@conference{4a17bcdf6dc04a758d0c1e9c5b67de83,

title = "Quantum property testing",

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.",

author = "Harry Buhrman and Lance Fortnow and Ilan Newman and Hein R{\"o}hrig",

year = "2003",

language = "English",

pages = "480--488",

note = "Configuralble Computing: Technology and Applications ; Conference date: 02-11-1998 Through 03-11-1998",

}

TY - CONF

T1 - Quantum property testing

AU - Buhrman, Harry

AU - Fortnow, Lance

AU - Newman, Ilan

AU - Röhrig, Hein

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0038077522&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0038077522

SP - 480

EP - 488

T2 - Configuralble Computing: Technology and Applications

Y2 - 2 November 1998 through 3 November 1998

ER -

Quantum property testing

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this