Quantum property testing

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

doi:10.1137/S0097539704442416

Quantum property testing

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

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

A language L has a property tester if there exists a probabilistic algorithm that given an input x queries only 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 good 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 (from-to)	1387-1400
Number of pages	14
Journal	SIAM Journal on Computing
Volume	37
Issue number	5
DOIs	https://doi.org/10.1137/S0097539704442416
State	Published - 2007

Keywords

Property testing
Quantum computing

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1137/S0097539704442416

Cite this

@article{c0c0a7c709c946219cb7c418f6e34a1a,

title = "Quantum property testing",

abstract = "A language L has a property tester if there exists a probabilistic algorithm that given an input x queries only 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 good 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.",

keywords = "Property testing, Quantum computing",

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

year = "2007",

doi = "10.1137/S0097539704442416",

language = "English",

volume = "37",

pages = "1387--1400",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "5",

}

TY - JOUR

T1 - Quantum property testing

AU - Buhrman, Harry

AU - Fortnow, Lance

AU - Newman, Ilan

AU - Röhrig, Hein

PY - 2007

Y1 - 2007

N2 - A language L has a property tester if there exists a probabilistic algorithm that given an input x queries only 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 good 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 queries only 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 good 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.

KW - Property testing

KW - Quantum computing

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

U2 - 10.1137/S0097539704442416

DO - 10.1137/S0097539704442416

M3 - Article

AN - SCOPUS:55249099800

SN - 0097-5397

VL - 37

SP - 1387

EP - 1400

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 5

ER -

Quantum property testing

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this