{
  "@context": "https://schema.org",
  "@id": "https://aggr.aymericbeaumet.com/items/youtube-com-computerphile/2026-07-09-shor-s-algorithm-for-quantum-computing-computerphile/#webpage",
  "@type": [
    "WebPage",
    "ArchiveComponent"
  ],
  "articleBody": "We brought a computer scientist and a physicist together to talk about Shor's algorithm - a famous factorisation algorithm for that can break some currently used encryption techniques if implemented in the quantum realm.\n\nPhil's accompanying blog post: https://muircheartblog.wpcomstaging.com/2026/05/26/quantum-computing-one-universe-is-more-than-enough/\n\nComputerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphile\n\nThis video was filmed and edited by Sean Riley.\n\nComputerphile is a sister project to Brady Haran's Numberphile. More at https://www.bradyharanblog.com\n",
  "authors": [
    "Computerphile"
  ],
  "captured_at": "2026-09-19T21:30:23.395188495+00:00",
  "category": "programming",
  "content_html": "<p>We brought a computer scientist and a physicist together to talk about Shor's algorithm - a famous factorisation algorithm for that can break some currently used encryption techniques if implemented in the quantum realm.</p>\n<p>Phil's accompanying blog post: <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https://muircheartblog.wpcomstaging.com/2026/05/26/quantum-computing-one-universe-is-more-than-enough/\">https://muircheartblog.wpcomstaging.com/2026/05/26/quantum-computing-one-universe-is-more-than-enough/</a></p>\n<p>Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https://jane-st.co/computerphile\">https://jane-st.co/computerphile</a></p>\n<p>This video was filmed and edited by Sean Riley.</p>\n<p>Computerphile is a sister project to Brady Haran's Numberphile. More at <a target=\"_blank\" rel=\"noopener noreferrer\" href=\"https://www.bradyharanblog.com\">https://www.bradyharanblog.com</a></p>\n",
  "content_markdown": "We brought a computer scientist and a physicist together to talk about Shor's algorithm - a famous factorisation algorithm for that can break some currently used encryption techniques if implemented in the quantum realm.\n\nPhil's accompanying blog post: https://muircheartblog.wpcomstaging.com/2026/05/26/quantum-computing-one-universe-is-more-than-enough/\n\nComputerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphile\n\nThis video was filmed and edited by Sean Riley.\n\nComputerphile is a sister project to Brady Haran's Numberphile. More at https://www.bradyharanblog.com\n",
  "dateCreated": "2026-09-19T21:30:23.395188495+00:00",
  "date_created": "2026-07-09T13:57:10+00:00",
  "date_modified": "2026-09-08T13:24:41+00:00",
  "date_published": "2026-07-09T13:57:10+00:00",
  "description": "We brought a computer scientist and a physicist together to talk about Shor's algorithm - a famous factorisation algorithm for that can break some currently used encryption techniques if implemented in the quantum realm. Phil's…",
  "external_url": "https://www.youtube.com/watch?v=k_kyepATqB8",
  "git": {
    "commit": "ebb0941c5c06a2ab2377342d607535262a3e969e",
    "path": "items/youtube-com-computerphile/2026/07/2026-07-09-shor-s-algorithm-for-quantum-computing-computerphile.md",
    "permalink": "https://github.com/aymericbeaumet/aggr-instance/blob/ebb0941c5c06a2ab2377342d607535262a3e969e/items/youtube-com-computerphile/2026/07/2026-07-09-shor-s-algorithm-for-quantum-computing-computerphile.md"
  },
  "id": "urn:aggr:item:25a1c1ce9826c379f37a1390d523e07c8b43200e",
  "isBasedOn": {
    "@id": "https://www.youtube.com/watch?v=k_kyepATqB8"
  },
  "mainEntity": {
    "@id": "https://www.youtube.com/watch?v=k_kyepATqB8",
    "@type": "CreativeWork",
    "archivedAt": {
      "@id": "https://aggr.aymericbeaumet.com/items/youtube-com-computerphile/2026-07-09-shor-s-algorithm-for-quantum-computing-computerphile/#webpage"
    },
    "author": [
      {
        "@type": "Person",
        "name": "Computerphile"
      }
    ],
    "dateModified": "2026-09-08T13:24:41+00:00",
    "datePublished": "2026-07-09T13:57:10+00:00",
    "headline": "Shor's Algorithm for Quantum Computing - Computerphile",
    "timeRequired": "PT1M",
    "url": "https://www.youtube.com/watch?v=k_kyepATqB8",
    "wordCount": 91
  },
  "name": "Archived snapshot: Shor's Algorithm for Quantum Computing - Computerphile",
  "preview": null,
  "reading_minutes": 1,
  "replicated_at": null,
  "source": "youtube-com-computerphile",
  "source_name": "Computerphile",
  "summary": "We brought a computer scientist and a physicist together to talk about Shor's algorithm - a famous factorisation algorithm for that can break some currently used encryption techniques if implemented in the quantum realm. \n\nPhil's accompanying blog post: https://muircheartblog.wpcomstaging.com/2026/05/26/quantum-computing-one-universe-is-more-than-enough/ \n\nComputerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphile\n\nThis video was filmed and edited by Sean Riley.\n\nComputerphile is a sister project to Brady Haran's Numberphile. More at https://www.bradyharanblog.com",
  "tags": [],
  "temporalCoverage": "2026-09-19T21:30:23.395188495+00:00",
  "title": "Shor's Algorithm for Quantum Computing - Computerphile",
  "url": "https://aggr.aymericbeaumet.com/items/youtube-com-computerphile/2026-07-09-shor-s-algorithm-for-quantum-computing-computerphile/",
  "word_count": 91
}