Numerical Exploration of the Pythagorean Theorem Using HOBO Algorithm

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Yasuda, Shoya, Mochida, Naoaki, Sotobayashi, Shunsuke, Garg, Devanshu, Minato, Yuichiro
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913474238480384
author Yasuda, Shoya
Mochida, Naoaki
Sotobayashi, Shunsuke
Garg, Devanshu
Minato, Yuichiro
author_facet Yasuda, Shoya
Mochida, Naoaki
Sotobayashi, Shunsuke
Garg, Devanshu
Minato, Yuichiro
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2408_11076
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Numerical Exploration of the Pythagorean Theorem Using HOBO Algorithm
Yasuda, Shoya
Mochida, Naoaki
Sotobayashi, Shunsuke
Garg, Devanshu
Minato, Yuichiro
Optimization and Control
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.
title Numerical Exploration of the Pythagorean Theorem Using HOBO Algorithm
topic Optimization and Control
url https://arxiv.org/abs/2408.11076