9 citations · 9 across the 2 of their papers we have counts for
4 papers
Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method
Uchenna Chukwu, Raouf Dridi, Jesse Berwald +5
Graph partitioning is one of an important set of well-known compute-intense (NP-hard) graph problems that devolve to discrete constrained optimization. We sampled solutions to the…
QCI Qbsolv Delivers Strong Classical Performance for Quantum-Ready Formulation
Michael Booth, Jesse Berwald, Uchenna Chukwu +5
Many organizations that vitally depend on computation for their competitive advantage are keen to exploit the expected performance of quantum computers (QCs) as soon as quantum adv…
The Mathematics of Quantum-Enabled Applications on the D-Wave Quantum Computer
Jesse J. Berwald
In this article we cover the canonical problem formulation necessary to program the D-Wave quantum processing unit (QPU) and discuss how such a problem is compiled onto the QPU. We…
Computing Wasserstein Distance for Persistence Diagrams on a Quantum Computer
Jesse J. Berwald, Joel M. Gottlieb, Elizabeth Munch
Persistence diagrams are a useful tool from topological data analysis which can be used to provide a concise description of a filtered topological space. What makes them even more…