We prove the first quantum-classical separation for a sampling problem over a continuous domain. For a class of Gibbs states $p\propto e^{-\beta E}$ on the torus $\mathbb{T}^d$ with smooth ($s$-Gevrey) potential and barrier amplitude $\alpha=e^{\beta\Delta}$, where $\Delta = \max E-\min E$, every classical algorithm qu...
Enrico Olivucci, Mariia Sobchuk, Sehmimul Hoque et al.· 1 citation
We prove the first quantum--classical separation for a sampling problem over a continuous domain. For a class of Gibbs states $p\propto e^{-\beta E}$ on the torus $\mathbb{T}^d$ with smooth ($s$-Gevrey) potential and barrier amplitude $\alpha=e^{\beta\Delta}$, where $\Delta = \max E-\min E$, every classical algorithm--...
Enrico Olivucci, Mariia Sobchuk, Sehmimul Hoque et al.· 1 citation
This work shows that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration and introduces high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical...
Masoud Mohseni, Artur Scherer, K. Johnson et al.· arXiv.org· 121 citations· ⚡9
This work uses Gevrey regularity to analyze a quantum algorithm for solving general linear partial differential equations (PDEs) with periodic boundary conditions and extends the solver to PDEs with Dirichlet boundary conditions using thin Gevrey collars and a regularized inverse.
Pooya Ronagh, Mariia Sobchuk, Xiaoran Li et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
