Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
<|reference_start|>Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates: We consider the design of self-testers for quantum gates. A self-tester for the gates F_1,...,F_m is a classical procedure that, given any gates G_1,...,G_m, decides with high probability if each G_i is close to F_i. This decision has to rely only on measuring in the computational basis the effect of iterating the gates on the classical states. It turns out that instead of individual gates, we can only design procedures for families of gates. To achieve our goal we borrow some elegant ideas of the theory of program testing: we characterize the gate families by specific properties, we develop a theory of robustness for them, and show that they lead to self-testers. In particular we prove that the universal and fault-tolerant set of gates consisting of a Hadamard gate, a c-NOT gate, and a phase rotation gate of angle pi/4 is self-testable.<|reference_end|>
@article{van dam1999self-testing,
    title={Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates},
    author={Wim van Dam (1,2) and Frederic Magniez (3) and Michele Mosca (2,4) and
  Miklos Santha (3,5) ((1) CWI Amsterdam (2) CQC Oxford (3) LRI Paris Sud (4) U
  of Waterloo (5) CNRS)},
    journal={Proceedings of the 32nd Annual ACM Symposium on Theory of
  Computing (STOC2000), pages 688-696},
    year={1999},
    doi={10.1145/335305.335402},
    archivePrefix={arXiv},
    eprint={quant-ph/9904108},
    primaryClass={quant-ph cs.OH}
}