{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/a6db03b7-f0bb-4820-9ad7-99c0a0bbcfd0\" width=\"1280\" height=\"720\" title=\"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy — 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/a6db03b7-f0bb-4820-9ad7-99c0a0bbcfd0/episode.poster.webp","title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","type":"video","version":"1.0","width":1280}