4 papers
Experimental Workflows for Combinatorial Optimization: Towards Quantum Advantage
Prashanti Priya Angara, Luis F. Rivera, Ulrike Stege +3
Demonstrating quantum advantage for combinatorial optimization requires more than standalone algorithmic results; it calls for end-to-end case studies that integrate problem modell…
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization
Tristan Zaborniak, Prashanti Priya Angara, Vikram Khipple Mulligan +2
We introduce a qubit- and gate-efficient higher-order unconstrained binary optimization (HUBO) encoding for graph partitioning problems requiring label-count minimization. This wid…
SCOOP: A Quantum-Computing Framework for Constrained Combinatorial Optimization
Prashanti Priya Angara, Emily Martins, Ulrike Stege +1
While the ultimate goal of solving computationally intractable problems is to find a provably optimal solutions, practical constraints of real-world scenarios often necessitate foc…
The Art of Avoiding Constraints: A Penalty-free Approach to Constrained Combinatorial Optimization with QAOA
Prashanti Priya Angara, Danylo Lykov, Ulrike Stege +2
The quantum approximate optimization algorithm (QAOA) is designed to determine optimum and near optimum solutions of quadratic (and higher order) unconstrained binary optimization…