{
  "docId": "019de076-987e-7112-a237-ae8ed7de0063",
  "docSlug": "c1ee63aa5036389f08fa0708199fe7c5",
  "documentTitle": "D-Wave | Investor Day Presentation Deck | 133 slides",
  "authorId": "d-wave",
  "authorName": "D-Wave",
  "documentKindSlug": "conference-presentation",
  "documentKindLabel": "Conference presentation",
  "sourceTypeSlug": "investor_relations",
  "sourceTypeLabel": "Investor relations",
  "presentationDate": "2024-01-01 00:00:00",
  "orientation": "landscape",
  "aspectRatio": 1.7777778,
  "pageNumber": 62,
  "pageCount": 132,
  "prevPage": 61,
  "nextPage": 63,
  "slideType": "problem_statement",
  "function": "frame_problem",
  "density": "overcrowded",
  "nDataPoints": 0,
  "notes": "Includes a definition of NP complexity and practical applications of TSP.",
  "elementsJson": null,
  "metadataConfidence": 1,
  "imagePath": null,
  "slideHref": "/slides/019de076-987e-7112-a237-ae8ed7de0063/62",
  "deckHref": "/decks/019de076-987e-7112-a237-ae8ed7de0063",
  "deckJsonHref": "/decks/019de076-987e-7112-a237-ae8ed7de0063.json",
  "deckAnchorHref": "/decks/019de076-987e-7112-a237-ae8ed7de0063#slide-62",
  "components": [
    {
      "bbox": {
        "h": 0.3,
        "w": 0.45,
        "x": 0.03,
        "y": 0.62
      },
      "kind": "image",
      "text": null,
      "attrs": null,
      "subkind": "illustration",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "8b1ac98b-8e1c-4425-ad93-f54d318f2fd9",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.55,
        "w": 0.35,
        "x": 0.62,
        "y": 0.25
      },
      "kind": "list",
      "text": "Optimization in Logistics and Planning: TSP is crucial for logistics, planning, and route optimization. Complexity and Computation: TSP is an NP-hard problem. Real-World Applications: Beyond theoretical interest, TSP has practical applications. Advancements in Computing: Solving TSP can benefit from advanced computing techniques like quantum computing.",
      "attrs": null,
      "subkind": "bullet",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "56afb7cb-0729-4f41-881a-e7691c123378",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.1,
        "w": 0.45,
        "x": 0.03,
        "y": 0.51
      },
      "kind": "paragraph",
      "text": "Applying D-Wave's quantum computing in TSP can optimize route planning for experiential marketing tours, ensuring efficient logistics and resource management.",
      "attrs": null,
      "subkind": "paragraph",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "2191a493-d794-444c-999b-fe245d2ae1b8",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.15,
        "w": 0.45,
        "x": 0.03,
        "y": 0.25
      },
      "kind": "paragraph",
      "text": "The Traveling Salesman Problem (TSP) is a classic algorithmic problem in computer science and operations research. It's about finding the most efficient route for a salesman who needs to visit multiple cities and return to the starting point.",
      "attrs": null,
      "subkind": "paragraph",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "5b903543-a963-4ac8-9a68-6efe911401ea",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.1,
        "w": 0.35,
        "x": 0.62,
        "y": 0.82
      },
      "kind": "subtitle",
      "text": "NP: This stands for \"Non-deterministic Polynomial-time.\" In computational complexity theory, NP is a class of problems for which, if a solution exists, it can be verified quickly (in polynomial time). However, finding the solution is usually not fast.",
      "attrs": null,
      "subkind": null,
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "4e092793-0db0-45d2-89bd-d8fec5c762b5",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.04,
        "w": 0.5,
        "x": 0.03,
        "y": 0.11
      },
      "kind": "title",
      "text": "The Traveling Salesman Problem + Quantum Computing",
      "attrs": null,
      "subkind": "action-title",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "be83d107-25e6-4c60-a3c2-64ae80a260af",
      "frameworkName": null,
      "frameworkSlug": null
    },
    {
      "bbox": {
        "h": 0.03,
        "w": 0.35,
        "x": 0.03,
        "y": 0.07
      },
      "kind": "title",
      "text": "MOMENTUM & D-WAVE TOUR PLANNING PROJECT OVERVIEW",
      "attrs": null,
      "subkind": "headline",
      "toolName": null,
      "toolSlug": null,
      "confidence": null,
      "componentId": "3a7d806a-82c1-48dc-bdd7-d79786d95cf2",
      "frameworkName": null,
      "frameworkSlug": null
    }
  ],
  "metrics": [],
  "tools": [
    {
      "name": "Problem Statement Canvas",
      "slug": "problem-statement-canvas",
      "agent": "Architect",
      "layer": "slide",
      "matchId": "abc0dd0d-aff5-449e-9c7d-5b7ca60f35d4",
      "evidence": "Optimization in Logistics and Planning: TSP is crucial for logistics, planning, and route optimization. Complexity and Computation: TSP is an NP-hard problem. Real-World Applications: Beyond theoretical inte",
      "confidence": 0.7
    }
  ],
  "frameworks": [],
  "arcBeats": [],
  "loops": [],
  "imagePathAlt": null,
  "thumbSrc": null,
  "thumbSrcAlt": null,
  "locked": true
}