54 citations · 109 across the 5 of their papers we have counts for
8 papers
Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms
Shouvanik Chakrabarti, Pierre Minssen, Romina Yalovetzky +1
Mixed Integer Programs (MIPs) model many optimization problems of interest in Computer Science, Operations Research, and Financial Engineering. Solving MIPs is NP-Hard in general,…
A Convergence Theory for Over-parameterized Variational Quantum Eigensolvers
Xuchen You, Shouvanik Chakrabarti, Xiaodi Wu
The Variational Quantum Eigensolver (VQE) is a promising candidate for quantum applications on near-term Noisy Intermediate-Scale Quantum (NISQ) computers. Despite a lot of empiric…
Sublinear classical and quantum algorithms for general matrix games
Tongyang Li, Chunhao Wang, Shouvanik Chakrabarti +1
We investigate sublinear classical and quantum algorithms for matrix games, a fundamental problem in optimization and machine learning, with provable guarantees. Given a matrix $A\…
A Threshold for Quantum Advantage in Derivative Pricing
Shouvanik Chakrabarti, Rajiv Krishnakumar, Guglielmo Mazzola +3
We give an upper bound on the resources required for valuable quantum advantage in pricing derivatives. To do so, we give the first complete resource estimates for useful quantum d…
On the Principles of Differentiable Quantum Programming Languages
Shaopeng Zhu, Shih-Han Hung, Shouvanik Chakrabarti +1
Variational Quantum Circuits (VQCs), or the so-called quantum neural-networks, are predicted to be one of the most important near-term quantum applications, not only because of the…
Quantum Wasserstein Generative Adversarial Networks
Shouvanik Chakrabarti, Yiming Huang, Tongyang Li +2
The study of quantum generative models is well-motivated, not only because of its importance in quantum machine learning and quantum chemistry but also because of the perspective o…