{
  "annotation_id": "a5f8948f-a918-4833-a152-9d5edfb6984a",
  "date_created": "2026-03-02T18:02:24.277000Z",
  "date_modified": "2026-03-02T18:02:24.277000Z",
  "file_hash": "5b2215f83bf4178d63f6e4b8c5924e2ec73436584dd5cdb4a2ca4675185a2aa0",
  "private": false,
  "record": {
    "abstract": "We show that a unitary operation (quantum circuit) secretely chosen from a\nfinite set of unitary operations can be determined with certainty by\nsequentially applying only a finite amount of runs of the unknown circuit. No\nentanglement or joint quantum operations is required in our scheme. We further\nshow that our scheme is optimal in the sense that the number of the runs is\nminimal when discriminating only two unitary operations.",
    "arxiv_id": "quant-ph/0601150",
    "authors": [
      "Runyao Duan",
      "Yuan Feng",
      "Mingsheng Ying"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.98.100503",
    "journal_ref": "Physical Review Letters, vol. 98, no. 10, art. 100503, 2007",
    "title": "Entanglement Is Not Necessary for Perfect Discrimination between Unitary   Operations",
    "url": "https://arxiv.org/abs/quant-ph/0601150"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "84a2288b-a1d4-4267-984a-37fbe7cf73e3",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}