{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":720,"html":"<iframe src=\"https://montaan.com/embed/video/0548159a-9174-46a1-a186-e4401812ddc0\" width=\"1280\" height=\"720\" title=\"Mirror subspace diagonalization: A real-time quantum Krylov algorithm with near-optimal sampling cost — 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://montaan.com/","thumbnail_url":"https://montaan.com/media/episodes/0548159a-9174-46a1-a186-e4401812ddc0/episode.poster.webp","title":"Mirror subspace diagonalization: A real-time quantum Krylov algorithm with near-optimal sampling cost","type":"video","version":"1.0","width":1280}