{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":720,"html":"<iframe src=\"https://montaan.com/embed/video/bd8c6c0f-ea6c-4883-8249-f30cfeea633b\" width=\"1280\" height=\"720\" title=\"Solving the traveling salesman problem on 2 (N-1)! qubits with a variational quantum Kolmogorov--Arnold network: exact-gradient CVaR training and generalization over time-dependent graphs — 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/bd8c6c0f-ea6c-4883-8249-f30cfeea633b/episode.poster.webp","title":"Solving the traveling salesman problem on 2 (N-1)! qubits with a variational quantum Kolmogorov--Arnold network: exact-gradient CVaR training and generalization over time-dependent graphs","type":"video","version":"1.0","width":1280}