Quantum property testing

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1387-1400

  Buhrman, Harry ^a,b   Fortnow, Lance ^c,d   Newman, Ilan ^e   Röhrig, Hein ^a,f  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c NEC LABORATORIES AMERICA   (United States)

^d THE UNIVERSITY OF CHICAGO   (United States)

^e UNIVERSITY OF HAIFA   (Israel)

^f GOOGLE INC   (United States)

Author keywords

Property testing; Quantum computing

Indexed keywords

PROBABILISTIC ALGORITHMS; PROPERTY TESTERS; PROPERTY TESTING; QUANTUM COMPUTING; QUANTUM PROPERTIES;

HAMMING DISTANCE; LINGUISTICS; QUANTUM COMPUTERS;

QUERY LANGUAGES;

EID: 55249099800     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704442416     Document Type: Article

References (40)

1. N. ALON, Testing subgraphs in large graphs, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 434-441.
2. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
3. N. ALON, S. DAR, M. PARNAS, AND D. RON, Testing of clustering, SIAM J. Discrete Math., 16 (2003), pp. 393-417.
4. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, in Proceeding's of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 656-666.
5. N. ALON, I. NEWMAN, M. KRIVELEVICH, AND M. SZEGEDY, Regular languages are testable with a constant number of queries, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 645-655.
6. N. ALON AND A. SHAPIRA, Testing subgraphs in directed graphs, J. Comput. System Sci., 69 (2004), pp. 354-382.
7. N. ALON AND A. SHAPIRA, A characterization of the (natural) graph properties testable with one-sided error, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 429-438.
8. N. ALON AND A. SHAPIRA, Every monotone graph property is testable, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 128-137.
9. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., Wiley-Interscience, New York, 2000.
10. R. BEALS, H. BUHRMAN, R. CLEVE, M. MOSCA, AND R. DE WOLF, Quantum lower bounds by polynomials, J. ACM, 48 (2001), pp. 778-797.
11. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIRANI, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26 (1997), pp. 1510-1523.
12. E. BERNSTEIN AND U. VAZIRANI, Quantum complexity theory, SIAM J. Comput., 26 (1997), pp. 1411-1473.
13. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing and self-correcting programs, with applications to numerical programs, J. Comput. System Sci., 47 (1993), pp. 549-595.
14. G. BRASSARD AND P. HOYER, An exact quantum, polynomial-time algorithm for Simon's problem, in Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems (ISTCS'97), IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 12-23.
15. H. BUHRMAN, L. FORTNOW, I. NEWMAN, AND H. RÖHRIG, Quantum property testing, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 480-488.
16. A. CZUMAJ AND C. SOHLER, Abstract combinatorial programs and efficient property testers. SIAM J. Comput., 34 (2005), pp. 580-615.
17. W. VAN DAM, F. MAGNIEZ, M. MOSCA, AND M. SANTHA, Self-testing of universal and fault-tolerant sets of quantum gates, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 688-696.
18. F. ERGÜN, S. KANNAN, S. KUMAR, R. RUBINFELD, AND M. VISHWANATHAN, Spot-checkers, J. Comput. System Sci., 60 (2000), pp. 717-751.
19. E. FISCHER, The art of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
20. E. FISCEIER, Testing graphs for colorability properties, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 873-882.
21. E. FISCHER, G. KINDLER, D. RON, S. SAFRA, AND A. SAMORODNITSKY, Testing juntas, J. Comput. System Sci., 68 (2004), pp. 753-787.
22. E. FISCHER AND I. NEWMAN, Testing of matrix properties, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 286-295.
23. K. FRIEDL, F. MAGNIEZ, M. SANTHA, AND P. SEN, Quantum testers for hidden group properties, in Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, 2003.
24. O. GOLDREICH, Combinatorial property testing (a survey), in Randomization Methods in Algorithm Design, AMS, Providence, RI, 1999, pp. 45-59.
25. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
26. O. GOLDREICH AND D. RON, Property testing in bounded-degree graphs, Algorithmica, 32 (2002), pp. 302-343.
27. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 460-469.
28. L. K. GROVER, A fast quantum mechanical algorithm for database search, in Proceedings of the 28th ACM Symposium on Theory of Computing, 1996, pp. 212-219.
29. L. HALES AND S. HALLGREN, An improved quantum Fourier transform algorithm, and applications, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 515-525.
30. P. HØYER, Fourier Sampling, private communication, 2001.
31. D. MAYERS AND A. YAO, Quantum cryptography with imperfect apparatus, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 503-509.
32. M. A. NIELSEN AND I. L. CHUANG, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
33. M. PARNAS AND D. RON, Testing the diameter of graphs, Random Structures Algorithms, 20 (2002), pp. 165-183.
34. D. RON, Property testing, in Handbook of Randomized Computing, Comb. Optim. 9, S. Rajasckaran, P. M. Pardalos, J. H. Reif, and J. D. P. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
35. R. RUBINFELD AND M. SUDAN, Robust characterizations of 'polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
36. P. W. SHOR, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput., 26 (1997), pp. 1484-1509.
37. D. R. SIMON, On the power of quantum, computation, SIAM J. Comput., 26 (1997), pp. 1474-1483.
38. R. SOLOVAY AND A. YAO, Quantum Circuit Complexity and Universal Quantum Turing Machines, manuscript, 1996.
39. M. SZEGEDY, private communication, 1999.
40. A. C.-C. YAO, Probabilistic computations: Toward a unified measure of complexity, in Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, 1977, pp. 222-227.