{
  "docId": "019dd923-5ca1-7489-b638-9365824f1309",
  "docSlug": "9d464cc3f934c322",
  "documentTitle": "Quantum Technology Monitor",
  "authorId": "McKinsey",
  "authorName": "McKinsey",
  "documentKindSlug": "consulting-deck",
  "documentKindLabel": "Consulting deck",
  "sourceTypeSlug": "strategy_consulting",
  "sourceTypeLabel": "Strategy consulting",
  "presentationDate": null,
  "orientation": "landscape",
  "aspectRatio": 1.414,
  "pageNumber": 32,
  "pageCount": 54,
  "prevPage": 31,
  "nextPage": 33,
  "slideType": "industry_trends",
  "function": "present_framework",
  "density": "dense",
  "nDataPoints": 0,
  "notes": "The charts are conceptual/illustrative representations of computational complexity classes.",
  "elementsJson": [
    "line_chart",
    "paragraph"
  ],
  "metadataConfidence": 1,
  "imagePath": null,
  "slideHref": "/slides/019dd923-5ca1-7489-b638-9365824f1309/32",
  "deckHref": "/decks/019dd923-5ca1-7489-b638-9365824f1309",
  "deckJsonHref": "/decks/019dd923-5ca1-7489-b638-9365824f1309.json",
  "deckAnchorHref": "/decks/019dd923-5ca1-7489-b638-9365824f1309#slide-32",
  "components": [
    {
      "bbox": null,
      "kind": "callout",
      "text": "The different natures of classical and quantum algorithms lead to inherent computation advantages in different problems.",
      "attrs": null,
      "subkind": null,
      "toolName": "Visual emphasis",
      "toolSlug": "visual-emphasis",
      "confidence": null,
      "componentId": "019dd951-d3bc-73c4-a2b0-b29bb542ec47",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.25,
        "w": 0.45,
        "x": 0.05,
        "y": 0.25
      },
      "kind": "chart",
      "text": "Polynomial speedup",
      "attrs": null,
      "subkind": "line",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "70706d98-8b0a-46ad-a722-d35de9309778",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.25,
        "w": 0.45,
        "x": 0.05,
        "y": 0.55
      },
      "kind": "chart",
      "text": "Exponential speedup",
      "attrs": null,
      "subkind": "line",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "fbd96a92-ff46-4911-ac09-e142cfb82490",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.6,
        "w": 0.45,
        "x": 0.5,
        "y": 0.2
      },
      "kind": "list",
      "text": "Algorithm complexity: The different natures of classical and quantum algorithms lead to inherent computation advantages in different problems.\nExecution time: The total computation time is highly dependent on the different hardware and architecture.\nProblem size: The practicality of the quantum algorithm is also dependent on the problem size.",
      "attrs": null,
      "subkind": "bullet",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "1f0061bb-432b-4528-92aa-fb5048158549",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": null,
      "kind": "metric",
      "text": "Runtime",
      "attrs": null,
      "subkind": "primary",
      "toolName": "Quantification",
      "toolSlug": "quantification",
      "confidence": null,
      "componentId": "019dd951-d3bc-73c4-a2b0-b6adb1ad6cec",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.1,
        "w": 0.9,
        "x": 0.05,
        "y": 0.85
      },
      "kind": "source-note",
      "text": "Two quantum algorithms are considered with slightly different speedups for illustrative purposes. 'Speedup' is how much faster quantum computing solves a problem as compared to classical computing. Problem in consideration is generic and imaginary for illustrative purposes. Source: Expert interviews",
      "attrs": null,
      "subkind": null,
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "c756e57e-81c8-4e64-ac9b-e44aa67e9679",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.1,
        "w": 0.9,
        "x": 0.05,
        "y": 0.05
      },
      "kind": "title",
      "text": "Economic value is unlocked through speedup, which depends on algorithm complexity, execution time, and problem size.",
      "attrs": null,
      "subkind": "headline",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "16ea3191-1a08-450e-b72d-e9f5bc0dba7a",
      "frameworkName": null,
      "frameworkSlug": null
    }
  ],
  "metrics": [],
  "tools": [],
  "frameworks": [],
  "arcBeats": [
    {
      "to": 54,
      "from": 6,
      "beatId": "71fae6aa-b632-40b0-92b0-f8b03f5ed987",
      "arcName": "Monroe's Motivated Sequence",
      "arcSlug": "monroes-sequence",
      "beatName": "Satisfaction",
      "beatSlug": "monroes-sequence-satisfaction",
      "evidence": "The report provides a comprehensive overview of the quantum technology landscape, satisfying the reader's need for information.",
      "position": 2,
      "confidence": 0.8,
      "parentBeatName": "Turn",
      "parentBeatSlug": "turn"
    }
  ],
  "loops": [],
  "imagePathAlt": null,
  "thumbSrc": null,
  "thumbSrcAlt": null,
  "locked": true
}