{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/bd85e684-c774-4423-9865-ed167c37f522\" width=\"1280\" height=\"720\" title=\"Reducing the Complexity of Matrix Multiplication to O(N 2log 2N) by an Asymptotically Optimal Quantum Algorithm — Paper Radio\" frameborder=\"0\" allow=\"autoplay; fullscreen; picture-in-picture\" allowfullscreen loading=\"lazy\" style=\"border:0;display:block;max-width:100%;\"></iframe>","provider_name":"Paper Radio","provider_url":"https://m.montaan.com/","thumbnail_url":"https://m.montaan.com/media/episodes/bd85e684-c774-4423-9865-ed167c37f522/episode.poster.webp","title":"Reducing the Complexity of Matrix Multiplication to O(N 2log 2N) by an Asymptotically Optimal Quantum Algorithm","type":"video","version":"1.0","width":1280}