Cover Image

Performance of the Extended Ising Machine for the Quadratic Knapsack Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Akishima, Haruka, Tamura, Hirotaka, Kudo, Kazue
Format:	Preprint
Published:	2025
Subjects:	Statistical Mechanics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Classical Simulation of High Temperature Quantum Ising Models
by: Crosson, Elizabeth, et al.
Published: (2020)

Counting with the quantum alternating operator ansatz
by: Drapeau, Julien, et al.
Published: (2025)

Contraction: a Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
by: Shao, Shuai, et al.
Published: (2019)

Zero-Freeness of the Hard-Core Model with Bounded Connective Constant
by: Chen, Yuan, et al.
Published: (2026)

0-1 Knapsack in Nearly Quadratic Time
by: Jin, Ce
Published: (2023)

A Nearly Quadratic-Time FPTAS for Knapsack
by: Chen, Lin, et al.
Published: (2023)

Knapsack with Small Items in Near-Quadratic Time
by: Bringmann, Karl
Published: (2023)

$(1-ε)$-Approximation of Knapsack in Nearly Quadratic Time
by: Mao, Xiao
Published: (2023)

Online Knapsack Problems with Estimates
by: Balabán, Jakub, et al.
Published: (2025)

Average sensitivity of the Knapsack Problem
by: Kumabe, Soh, et al.
Published: (2024)

Quantum Gibbs states are locally Markovian
by: Chen, Chi-Fang, et al.
Published: (2025)

Fermi-Dirac machines as quantizations of neurons
by: He, Alexander, et al.
Published: (2026)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
by: Dughmi, Shaddin, et al.
Published: (2025)

Fitting an ellipsoid to random points: predictions using the replica method
by: Maillard, Antoine, et al.
Published: (2023)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
by: Chen, Lin, et al.
Published: (2026)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
by: Buchem, Moritz, et al.
Published: (2024)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
by: Lovig, Maxwell, et al.
Published: (2024)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
by: Ma, Will, et al.
Published: (2019)

Online Unbounded Knapsack
by: Böckenhauer, Hans-Joachim, et al.
Published: (2024)

An Exact Solver for Submodular Knapsack Problems
by: Münch, Sabine, et al.
Published: (2025)

Quantum thermodynamics and semi-definite optimization
by: Liu, Nana, et al.
Published: (2025)

Decoded Quantum Interferometry Requires Structure
by: Anschuetz, Eric R., et al.
Published: (2025)

The Overlap Gap Property limits limit swapping in the QAOA
by: Goh, Mark
Published: (2024)

Simple and Faster Algorithms for Knapsack
by: He, Qizheng, et al.
Published: (2023)

Convolution and Knapsack in Higher Dimensions
by: Grage, Kilian, et al.
Published: (2024)

Online General Knapsack with Reservation Costs
by: Burjons, Elisabet, et al.
Published: (2025)

Weakly Approximating Knapsack in Subquadratic Time
by: Chen, Lin, et al.
Published: (2025)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
by: Pensia, Ankit
Published: (2024)

Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
by: Suga, Tatsuhiro, et al.
Published: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
by: Jansen, Klaus, et al.
Published: (2025)

Approximately Counting Knapsack Solutions in Subquadratic Time
by: Feng, Weiming, et al.
Published: (2024)

Fine Grained Lower Bounds for Multidimensional Knapsack
by: Doron-Arad, Ilan, et al.
Published: (2024)

Toward Practical Benchmarks of Ising Machines: A Case Study on the Quadratic Knapsack Problem
by: Ohno, Kentaro, et al.
Published: (2024)

On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms
by: Schlöter, Jens
Published: (2025)

Fair Submodular Maximization over a Knapsack Constraint
by: Li, Lijun, et al.
Published: (2025)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
by: Barak, Zohar, et al.
Published: (2026)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
by: Kar, Debajyoti, et al.
Published: (2026)

Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
by: Gehnen, Matthias, et al.
Published: (2025)

Time Fairness in Online Knapsack Problems
by: Lechowicz, Adam, et al.
Published: (2023)