Self-testing of quantum circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 72-83

  Magniez, Frédéric ^a   Mayers, Dominic ^b   Mosca, Michele ^c,d   Ollivier, Harold ^d  

^a CNRS   (France)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER CIRCUITS; COMPUTER SIMULATION; POLYNOMIALS;

GATES; QUANTUM CIRCUITS; QUANTUM DEVICES; QUBITS;

QUANTUM THEORY;

EID: 33746352092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_8     Document Type: Conference Paper

References (9)

1. Blum, M., Kanuan, S.: Designing programs that check their work. J. ACM 42 (1995) 269-291
2. Blum, M., Luby, M., Rubinfeld, R.: Self-teating/correcting with applications to numerical problems. J. Computer and System Sciences 47 (1993) 549-595
3. Mayers, D., Yao, A.: Quantum cryptography with imperfect apparatus. In: Proceedings of 39th IEEE FOCS. (1998) 503-509
4. Dam, W., Magniez, F., Mosca, M., Santha, M.: Self-testing of universal and faulttolerant sets of quantum gates. In: Proc. of 32nd ACM STOC. (2000) 688-696
5. Buhrman, H., Fortnow, L., Newmari, L., Röhrig, H.: Quantum property testing. In: Proc. of 14th ACM-SIAM SODA. (2003) 480-488
6. Friedl, K., Magniez, F., Santha, M., Sen, P.: Quantum testers for hidden group properties. In: Proc. of the 28th MFCS. (2003) 419-428
7. Rudolph, T., Grover, L.: A 2-rebit gate universal for quantum computing (2002)
8. Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SLAM J. Computing 25 (1996) 23-32
9. Rubinfeld, R.: On the robustness of functional equations, SIAM J. Computing 28 (1909) 1972-1997