1 citations · 1 across the 2 of their papers we have counts for
2 papers
quant-ph2023
Toward Computing Bounds for Ramsey Numbers Using Quantum Annealing
Joel E. Pion, Susan M. Mniszewski
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems…
quant-ph2022★ 1 cited
Quantum Computing for a Profusion of Postman Problem Variants
Joel E. Pion, Christian F. A. Negre, Susan M. Mniszewski
In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing p…