Helmut G. Katzgraber
4 papers in the PaperMetrix corpus
Papers by this author
-
Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches
2016 · Physical Review A
To date, a conclusive detection of quantum speedup remains elusive. Recently, a team by Google Inc. [V. S. Denchev et al., Phys. Rev. X 6, 031015 (2016)] proposed a weak-strong cluster model tailored to have …
-
Scaling overhead of locality reduction in binary optimization problems
2020 · arXiv (Cornell University)
Recently, there has been considerable interest in solving optimization problems by mapping these onto a binary representation, sparked mostly by the use of quantum annealing machines. Such binary representation is reminiscent of a discrete physical …
-
Scaling overhead of embedding optimization problems in quantum annealing
2021 · arXiv (Cornell University)
In order to treat all-to-all connected quadratic binary optimization problems (QUBO) with hardware quantum annealers, an embedding of the original problem is required due to the sparsity of the hardware's topology. Embedding fully-connected graphs - …
-
Explainable AI using expressive Boolean formulas
2023 · arXiv (Cornell University)
We propose and implement an interpretable machine learning classification model for Explainable AI (XAI) based on expressive Boolean formulas. Potential applications include credit scoring and diagnosis of medical conditions. The Boolean formula defines a rule …