Quantum Property Testing

Simple item page
dc.creatorBuhrman, H.
dc.creatorFortnow, L.
dc.creatorNewman, I.
dc.creatorRoehrig, H.
dc.date2002-01-25
dc.date.accessioned2026-07-07T06:03:35Z
dc.date.available2026-07-07T06:03:35Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/quant-ph/0201117
dc.identifierhttp://arxiv.org/abs/quant-ph/0201117
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89996
dc.subjectQuantum Physics
dc.titleQuantum Property Testing
dc.typetext

Files

Collections

arXiv