Pith. sign in

REVIEW 1 cited by

HOBOTAN: Efficient Higher Order Binary Optimization Solver with Tensor Networks and PyTorch

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

arxiv 2407.19987 v1 pith:OO2267HX submitted 2024-07-29 cs.MS quant-ph

classification cs.MSquant-ph
keywords hobotanoptimizationtensorsolverbinarycombinatorialdesignedefficient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this study, we introduce HOBOTAN, a new solver designed for Higher Order Binary Optimization (HOBO). HOBOTAN supports both CPU and GPU, with the GPU version developed based on PyTorch, offering a fast and scalable system. This solver utilizes tensor networks to solve combinatorial optimization problems, employing a HOBO tensor that maps the problem and performs tensor contractions as needed. Additionally, by combining techniques such as batch processing for tensor optimization and binary-based integer encoding, we significantly enhance the efficiency of combinatorial optimization. In the future, the utilization of increased GPU numbers is expected to harness greater computational power, enabling efficient collaboration between multiple GPUs for high scalability. Moreover, HOBOTAN is designed within the framework of quantum computing, thus providing insights for future quantum computer applications. This paper details the design, implementation, performance evaluation, and scalability of HOBOTAN, demonstrating its effectiveness.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Variational matrix product states for combinatorial optimization

    quant-ph 2025-12 conditional novelty 6.0 of 10

    Quantum-inspired product/matrix-product-state annealing embedded in iterated local search reports better MaxCut approximations than the ILS, LQA, GCS, and QAOA baselines tested, on graphs up to 50,000 vertices.

Pith tools