Numerical Exploration of the Pythagorean Theorem Using HOBO Algorithm
Abstract
This paper introduces a novel method for finding integer sets that satisfy the Pythagorean theorem by leveraging the Higher-Order Binary Optimization (HOBO) formulation. Unlike the Quadratic Unconstrained Binary Optimization (QUBO) formulation, which struggles to express complex mathematical equations, HOBO's ability to model higher-order interactions between binary variables makes it well-suited for addressing more complex and expressive problem settings.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.