M. Szegedy. Private communication. 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2001) (1 citation) (Correct)
....input bits, which gives the acceptance probability of the algorithm; thus, a quantum property tester for P gives rise to a polynomial that is on all binary inputs between 0 and 1, that is at least 2=3 on inputs with the property P and at most 1=3 on inputs far from having the property P . Szegedy [Sze99] suggested to algebraically characterize the complexity of classical testing by the minimum degree of such polynomials; however, our separation results imply that there are for example properties, for which such polynomials have constant degree, but for which the best classical tester needs eds ....
....input bits, which gives the acceptance probability of the algorithm; thus, a quantum property tester for P gives rise to a polynomial that is on all binary inputs between 0 and 1, that is at least 2=3 on inputs with the property P and at most 1=3 on inputs far from having the property P . Szegedy [Sze99] suggested to algebraically characterize the complexity of classical testing by the minimum degree of such polynomials; as mentioned in the introduction, our results imply that this cannot be the case for classical testers. However, it is an open question whether quantum property testing can be ....
M. Szegedy. Private communication, 1999.
Quantum Property Testing - Buhrman, Fortnow, Newman, Röhrig (2004) (1 citation) (Correct)
No context found.
M. Szegedy. Private communication. 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC