{
  "annotation_id": "ddb1002f-9418-47f8-8949-67fb123794df",
  "date_created": "2026-02-17T05:53:15.889000Z",
  "date_modified": "2026-02-17T05:53:15.889000Z",
  "file_hash": "3ece0f4059aaf419779e58784aa54a716ea58041358acd0da1ad593f666fd0e4",
  "private": false,
  "record": {
    "abstract": "This paper investigates symmetric composite binary quantum hypothesis testing (QHT), where the goal is to determine which of two uncertainty sets contains an unknown quantum state. While asymptotic error exponents for this problem are well-studied, the finite-sample regime remains poorly understood. We bridge this gap by characterizing the sample complexity -- the minimum number of state copies required to achieve a target error level. Specifically, we derive lower bounds that generalize the sample complexity of simple QHT and introduce new upper bounds for various uncertainty sets, including of both finite and infinite cardinalities. Notably, our upper and lower bounds match up to universal constants, providing a tight characterization of the sample complexity. Finally, we extend our analysis to the differentially private setting, establishing the sample complexity for privacy-preserving composite QHT.",
    "arxiv_id": "2601.08588",
    "authors": [
      "Jacob Paul Simpson",
      "Efstratios Palias",
      "Sharu Theresa Jose"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "cs.LG",
      "math.IT",
      "math.ST",
      "stat.TH"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Sample Complexity of Composite Quantum Hypothesis Testing",
    "url": "https://arxiv.org/abs/2601.08588",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7477c8a2-eeb6-4fa6-8874-e7a359536b03",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}