REVIEW 1 cited by
Tensor Network Based HOBO Solver
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In the field of quantum computing, combinatorial optimization problems are typically addressed using QUBO (Quadratic Unconstrained Binary Optimization) solvers. However, these solvers are often insufficient for tackling higher-order problems. In this paper, we introduce a novel and efficient solver designed specifically for HOBO (Higher-Order Binary Optimization) problem settings. Our approach leverages advanced techniques to effectively manage the complexity and computational demands associated with high-dimensional optimization tasks. The proposed solver is a promising tool with significant potential for future extensions in terms of formulation. This solver holds promising potential for a wide range of applications in quantum computing.
Forward citations
Cited by 1 Pith paper
-
Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
Any finite combinatorial problem with a known logical circuit can be encoded as a tensor network whose contraction defines an explicit, though generally inefficient, solution equation.
Discussion (0). Continue with ORCID to comment.