{
  "annotation_id": "a7c2aeb2-92bd-47dc-a544-1cf0c1c94479",
  "date_created": "2026-03-02T18:02:48.353000Z",
  "date_modified": "2026-03-02T18:02:48.353000Z",
  "file_hash": "55a1f6a08074c5187b9a95b208774985b72733d0f962e03505608458c99c6654",
  "private": false,
  "record": {
    "abstract": "We consider the design of self-testers for quantum gates. A self-tester for\nthe gates F_1,...,F_m is a classical procedure that, given any gates\nG_1,...,G_m, decides with high probability if each G_i is close to F_i. This\ndecision has to rely only on measuring in the computational basis the effect of\niterating the gates on the classical states. It turns out that instead of\nindividual gates, we can only design procedures for families of gates. To\nachieve our goal we borrow some elegant ideas of the theory of program testing:\nwe characterize the gate families by specific properties, we develop a theory\nof robustness for them, and show that they lead to self-testers. In particular\nwe prove that the universal and fault-tolerant set of gates consisting of a\nHadamard gate, a c-NOT gate, and a phase rotation gate of angle pi/4 is\nself-testable.",
    "arxiv_id": "quant-ph/9904108",
    "authors": [
      "Wim van Dam",
      "Frederic Magniez",
      "Michele Mosca",
      "Miklos Santha"
    ],
    "categories": [
      "quant-ph",
      "cs.OH"
    ],
    "doi": "10.1145/335305.335402",
    "journal_ref": "Proceedings of the 32nd Annual ACM Symposium on Theory of\n  Computing (STOC2000), pages 688-696",
    "title": "Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates",
    "url": "https://arxiv.org/abs/quant-ph/9904108"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d0e0e13f-2389-4661-ab32-1e67e0baab89",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}