119 citations · 308 across the 9 of their papers we have counts for
3 papers · 1 filter
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,…
Constrained Optimization via Quantum Zeno Dynamics
Dylan Herman, Ruslan Shaydulin, Yue Sun +6
Constrained optimization problems are ubiquitous in science and industry. Quantum algorithms have shown promise in solving optimization problems, yet none of the current algorithms…
Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
Pradeep Niroula, Ruslan Shaydulin, Romina Yalovetzky +4
Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consi…