{
  "annotation_id": "78da4da4-1464-4117-b8cd-8db3ea981e33",
  "date_created": "2026-03-02T18:01:42.694000Z",
  "date_modified": "2026-03-02T18:01:42.694000Z",
  "file_hash": "cccf5c6057358301ec46cee76ee30813476d526dfc3ff78079c726095cebcdff",
  "private": false,
  "record": {
    "abstract": "We analyze the effect of squeezing the channel in binary communication based\non Gaussian states. We show that for coding on pure states, squeezing increases\nthe detection probability at fixed size of the strategy, actually saturating\nthe optimal bound already for moderate signal energy. Using Neyman-Pearson\nlemma for fuzzy hypothesis testing we are able to analyze also the case of\nmixed states, and to find the optimal amount of squeezing that can be\neffectively employed. It results that optimally squeezed channels are robust\nagainst signal-mixing, and largely improve the strategy power by comparison\nwith coherent ones.",
    "arxiv_id": "quant-ph/0104057",
    "authors": [
      "Matteo G. A. Paris"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.64.014304",
    "journal_ref": "Physical Review A vol 4 014304 (2001)",
    "title": "Nearly ideal binary communication in squeezed channels",
    "url": "https://arxiv.org/abs/quant-ph/0104057"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6b320b3c-183f-49d2-92a5-159e00b486aa",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}