{
  "$schema": "https://themachinepress.com/schemas/story-v1.schema.json",
  "schema_version": "1.0.0",
  "document_type": "machine_press_story",
  "story": {
    "story_id": "mp-2026-09-28-015",
    "source_story_id": "tmp-sidebar-photonic-emitter-reduction",
    "edition_id": "mp-2026-09-28-morning-0081",
    "edition_url": "https://themachinepress.com/edition/2026-09-28",
    "position": 17,
    "story_type": "ticker",
    "section": "research",
    "editorial_classification": "editorial",
    "headline": "Photonic Graph States Needed Up to 30% Fewer Emitters",
    "slug": "photonic-graph-states-needed-up-to-30-fewer-emitters",
    "dek": "Four polynomial heuristics optimized emission order for random graphs.",
    "summary": "Four polynomial heuristics optimized emission order for random graphs.",
    "body_text": "The algorithms target linear-rank-width structure to reduce the number of quantum emitters needed for deterministic photonic graph-state generation. Numerical tests report reductions up to 30% on random graphs, with about 20% further gate savings when combined with earlier optimizers. These are heuristic results, not proofs of minimum hardware for every graph family.",
    "why_it_matters": "Four polynomial heuristics optimized emission order for random graphs.",
    "limitations": [
      "These are heuristic results, not proofs of minimum hardware for every graph family."
    ],
    "importance": 7,
    "canonical_url": "https://themachinepress.com/story/mp-2026-09-28-015/photonic-graph-states-needed-up-to-30-fewer-emitters",
    "json_url": "https://themachinepress.com/story/mp-2026-09-28-015.json",
    "first_published_at": "2026-09-28T09:00:00.000-04:00",
    "modified_at": "2026-09-28T09:00:00.000-04:00",
    "content_status": "new",
    "is_carryover": false,
    "carryover_reason": null,
    "key_claims": [
      {
        "claim_id": "claim-mp-2026-09-28-015-001",
        "text": "Four polynomial heuristics optimized emission order for random graphs.",
        "source_ids": [
          "source-2026-09-28-017"
        ],
        "qualification": "These are heuristic results, not proofs of minimum hardware for every graph family."
      }
    ],
    "source_ids": [
      "source-2026-09-28-017"
    ],
    "tags": [
      "photonic computing",
      "graph states",
      "quantum emitters"
    ],
    "image_url": null,
    "corrections": []
  },
  "sources": [
    {
      "source_id": "source-2026-09-28-017",
      "title": "arXiv preprint 2609.30400",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.30400",
      "canonical_url": "https://arxiv.org/abs/2609.30400",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-24T14:04:39.000-04:00",
      "accessed_at": "2026-09-28T08:26:00.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-28-015-001"
      ]
    }
  ],
  "corrections": [],
  "publisher": {
    "name": "The Machine Press",
    "url": "https://themachinepress.com",
    "description": "A daily newspaper for the age of artificial intelligence."
  },
  "cite_this_report": {
    "title": "Photonic Graph States Needed Up to 30% Fewer Emitters",
    "publisher": "The Machine Press",
    "published_at": "2026-09-28T09:00:00.000-04:00",
    "canonical_url": "https://themachinepress.com/story/mp-2026-09-28-015/photonic-graph-states-needed-up-to-30-fewer-emitters"
  }
}