{
  "$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-24-007",
    "source_story_id": "tmp-story-logarithmic-time-quantum-fault-tolerance",
    "edition_id": "mp-2026-09-24-morning-0077",
    "edition_url": "https://themachinepress.com/edition/2026-09-24",
    "position": 7,
    "story_type": "dispatch",
    "section": "research",
    "editorial_classification": "editorial",
    "headline": "Quantum Fault Tolerance Lost Its Extra Time Factor",
    "slug": "quantum-fault-tolerance-lost-its-extra-time-factor",
    "dek": "A proof reaches logarithmic time overhead while keeping space overhead constant.",
    "summary": "A proof reaches logarithmic time overhead while keeping space overhead constant.",
    "body_text": "Two theoretical constructions show how fault-tolerant quantum computation can use constant space overhead with strictly logarithmic time overhead, removing subpolylogarithmic factors from earlier bounds. One route uses transversal logical CCZ gates on quantum locally testable codes; another recursively protects a fixed magic-state distillation circuit. This is a complexity result, not a hardware demonstration or near-term performance forecast.",
    "why_it_matters": "A proof reaches logarithmic time overhead while keeping space overhead constant.",
    "limitations": [
      "This is a complexity result, not a hardware demonstration or near-term performance forecast."
    ],
    "importance": 9,
    "canonical_url": "https://themachinepress.com/story/mp-2026-09-24-007/quantum-fault-tolerance-lost-its-extra-time-factor",
    "json_url": "https://themachinepress.com/story/mp-2026-09-24-007.json",
    "first_published_at": "2026-09-24T09:00:00.000-04:00",
    "modified_at": "2026-09-24T09:00:00.000-04:00",
    "content_status": "new",
    "is_carryover": false,
    "carryover_reason": null,
    "key_claims": [
      {
        "claim_id": "claim-mp-2026-09-24-007-001",
        "text": "A proof reaches logarithmic time overhead while keeping space overhead constant.",
        "source_ids": [
          "source-2026-09-24-007"
        ],
        "qualification": "This is a complexity result, not a hardware demonstration or near-term performance forecast."
      }
    ],
    "source_ids": [
      "source-2026-09-24-007"
    ],
    "tags": [
      "fault tolerance",
      "quantum codes",
      "complexity"
    ],
    "image_url": null,
    "corrections": []
  },
  "sources": [
    {
      "source_id": "source-2026-09-24-007",
      "title": "arXiv preprint 2609.28461",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2609.28461",
      "canonical_url": "https://arxiv.org/abs/2609.28461",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-09-23T13:53:01.000-04:00",
      "accessed_at": "2026-09-24T08:17:17.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-09-24-007-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": "Quantum Fault Tolerance Lost Its Extra Time Factor",
    "publisher": "The Machine Press",
    "published_at": "2026-09-24T09:00:00.000-04:00",
    "canonical_url": "https://themachinepress.com/story/mp-2026-09-24-007/quantum-fault-tolerance-lost-its-extra-time-factor"
  }
}