{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/ce55b6a9-3815-4028-92a2-bcaa8d070b79\" width=\"1280\" height=\"720\" title=\"Solving larger Travelling Salesman Problem networks with a penalty-free Variational 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/ce55b6a9-3815-4028-92a2-bcaa8d070b79/episode.poster.webp","title":"Solving larger Travelling Salesman Problem networks with a penalty-free Variational Quantum Algorithm","type":"video","version":"1.0","width":1280}