{
  "annotation_id": "5701740f-2436-4017-aa07-401e8a69ac66",
  "date_created": "2026-03-02T18:02:34.383000Z",
  "date_modified": "2026-03-02T18:02:34.383000Z",
  "file_hash": "1f8eed35bb93deeb6c4e31788b397fcddb2c43b7db5bed015eb5a756d6de0875",
  "private": false,
  "record": {
    "abstract": "We introduce schemes for linear-optical quantum state generation. A quantum\nstate generator is a device that prepares a desired quantum state using product\ninputs from photon sources, linear-optical networks, and postselection using\nphoton counters. We show that this device can be concisely described in terms\nof polynomial equations and unitary constraints. We illustrate the power of\nthis language by applying the Grobner-basis technique along with the notion of\nvacuum extensions to solve the problem of how to construct a quantum state\ngenerator analytically for any desired state, and use methods of convex\noptimization to identify bounds to success probabilities. In particular, we\ndisprove a conjecture concerning the preparation of the maximally\npath-entangled |n,0)+|0,n) (NOON) state by providing a counterexample using\nthese methods, and we derive a new upper bound on the resources required for\nNOON-state generation.",
    "arxiv_id": "quant-ph/0612154",
    "authors": [
      "N. M. VanMeter",
      "P. Lougovski",
      "D. B. Uskov",
      "K. Kieling",
      "J. Eisert",
      "Jonathan P. Dowling"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.76.063808",
    "journal_ref": "Phys. Rev. A 76, 063808 (2007)",
    "title": "General linear-optical quantum state generation scheme: Applications to   maximally path-entangled states",
    "url": "https://arxiv.org/abs/quant-ph/0612154"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4e75cc13-6cbe-49ac-833c-48081b794132",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}