arXiv 2204.045742022-04-10quant-ph

Quantum-Inspired Solvers on Mixed-Integer Linear Programming Problem

Hao Wang, Yu Pan, Wei Cui

英文摘要：

Mixed-integer linear programming (MILP) plays a crucial role in artificial intelligence, biochemistry, finance, cryptography, etc. Notwithstanding popular for decades, the researches of MILP solvers are still limited by the resource consumption caused by complexity and failure of Moore's Law. Quantum-inspired Ising machines, as a new computing paradigm, can be used to solve integer programming problems by reducing them into Ising models. Therefore, it is necessary to understand the technical evolution of quantum inspired solvers to break the bottleneck. In this paper, the concept and traditional algorithms for MILP are introduced. Then, focused on Ising model, the principle and implementations of annealers and coherent Ising machines are summarized. Finally, the paper discusses the challenges and opportunities of miniaturized solvers in the future.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A Quantum-Inspired Classical Solver for Boolean k-Satisfiability Problems

In this paper we detail a classical algorithmic approach to the k-satisfiability (k-SAT) problem that is inspired by the quantum amplitude amplification algorithm. This work falls under the emerging field of quantum-inspired classical algorithms. To propose our modification, we adopt an existing problem model for k-SAT known as Universal SAT (UniSAT), which casts the Boolean satisfiability problem as a non-convex global optimization over a real-valued space. The quantum-inspired modification to UniSAT is to apply a conditioning operation to the objective function that has the effect of "amplif…

2021-09-21quant-ph

Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization

Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their performance for various types of problems. In this study, the performance of four quadratic unconstrained binary optimization problem solvers, namely D-Wave Hybrid Solver Service (HSS), Toshiba Simulated Bifurcation Machine (SBM), Fujitsu DigitalAnnealer (DA), and simulated annealing on a personal computer, was benchmarked. The problems used for…

2021-12-15math.OCquant-ph

关于用于模拟可压缩流动的量子启发求解器的技术报告

Technical report on a quantum-inspired solver for simulating compressible flows

本文提出一种基于张量网络的量子启发求解器，用于二维欧拉方程，在时间和内存上随网格规模多对数级扩展，为解决计算流体动力学中的维度灾难提供了新途径。

2025-06-04physics.comp-phphysics.flu-dynquant-ph

一种用于QUBO问题的新型求解器：性能分析及与最先进算法的比较研究

A Novel Solver for QUBO Problems: Performance Analysis and Comparative Study with State-of-the-Art Algorithms

本文提出量子启发式求解器QIS3，融合分支定界、梯度下降与量子启发策略，在Max-Cut、NAE-3SAT和SK自旋玻璃问题上以统一运行时间预算超越八种最先进求解器，并在94%的Max-Cut实例中达到最优。

2025-06-05quant-ph

混合量子内点方法在线性规划中的实用下界

Practical lower bounds for hybrid quantum interior point methods in linear programming

Strangeworks

本文评估了标准混合量子内点方法在现实问题实例上的实用性，发现量子运行时间下界已超过经典求解器，表明这些方法在实际线性规划问题中无优势。

2026-04-27quant-ph

基于中性原子量子处理器辅助Benders分解的混合整数线性规划求解器

Mixed Integer Linear Programming Solver Using Benders Decomposition Assisted by Neutral Atom Quantum Processor

本研究提出一种经典-量子混合方法，通过Benders分解拆分混合整数线性规划问题，将主问题转化为QUBO模型后用中性原子量子处理器求解，开发了嵌入启发式与脉冲整形变分算法，在小型算例中识别超95%高质量可行解，优于经典方法，是首个相关自动化问题无关框架。

2024-06-17quant-ph

更多相关论文收起更多论文

LightSolver -- A New Quantum-inspired Solver Cracks the 3-Regular 3-XORSAT Challenge

The increasing complexity of required computational tasks alongside the inherent limitations in conventional computing calls for disruptive innovation. LightSolver devised a new quantum-inspired computing paradigm, which utilizes an all-optical platform for solving hard optimization problems. In this work, LightSolver introduces its digital simulator and joins the 3-Regular 3-XORSAT (3R3X) challenge, which aims to map the best available state-of-the-art classical and quantum solvers. So far, the challenge has resulted in a clear exponential barrier in terms of time-to-solution (TTS), preventin…

2022-07-19cs.ETquant-ph

QICS：量子信息锥求解器

QICS: Quantum Information Conic Solver

本文提出开源 Python 原对偶内点求解器 QICS，用于求解量子相对熵、算子凸函数非交换视角及相关优化问题，并支持稀疏半定规划与 Hermitian 矩阵，实验表明其性能优于现有量子相对熵规划求解器，且与先进半定规划求解器相当。

2025-07-06math.OCquant-ph

利用图稀疏化作为 MaxCut QUBO 求解器的预处理

Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver

本文提出将图稀疏化用作 maxcut QUBO 求解的预处理，以减少云端量子及量子启发求解器处理稠密图时的通信开销，并验证其可获得接近最优的目标值。

2024-01-23cs.DCmath.OCquant-ph

用于模拟材料变形的量子启发式求解器

Quantum-Inspired Solver for Simulating Material Deformations

本文探讨了在线性弹性框架下应用张量网络（TNs）模拟材料变形，成功求解数十亿自由度的线性弹性方程，在内存和计算时间上实现指数级缩减，证明了TNs作为执行量子启发式算法的高效经典后端的实用可行性。

2025-02-02cs.NAmath.NAquant-ph

快速且灵活的量子启发式微分方程求解器与数据集成

Fast and Flexible Quantum-Inspired Differential Equation Solvers with Data Integration

Department of Computer Science, University of Copenhagen（哥本哈根大学计算机科学系）；AWS Center for Quantum Computing（AWS量子计算中心）

本文提出基于量化张量列的量子启发式方法，高效准确求解高维PDEs，实现内存和计算成本对数缩放，并引入数据驱动学习技术，结合神经网络适应性提升精度并减少训练时间。

2025-05-15cs.LGcs.NAmath.NA

Quantum-Inspired Approximations to Constraint Satisfaction Problems

Applied Research Laboratories, The University of Texas at Austin（德克萨斯大学奥斯汀分校应用研究实验室）

Two contrasting algorithmic paradigms for constraint satisfaction problems are successive local explorations of neighboring configurations versus producing new configurations using global information about the problem (e.g. approximating the marginals of the probability distribution which is uniform over satisfying configurations). This paper presents new algorithms for the latter framework, ultimately producing estimates for satisfying configurations using methods from Boolean Fourier analysis. The approach is broadly inspired by the quantum amplitude amplification algorithm in that it maxima…

2022-12-08cs.AIquant-ph

量子启发的空间-时间PDE求解器与动态模式分解

Quantum-inspired space-time PDE solver and dynamic mode decomposition

Technology Innovation Institute（技术创新研究所）；Hamburg University of Technology（汉堡工业大学）；Khalifa University of Science and Technology（哈利法科学与技术大学）

本文提出基于量子启发的MPS空间-时间求解器和MPS-DMD算法，用于高效求解PDEs及预测非线性系统长期动态，通过张量网络实现高精度与低复杂度的结合。

2026-10-30cs.NAmath.NAphysics.comp-ph

iSTAR：量子启发式连续伊辛求解器中变分约简的代数坍缩框架

iSTAR: an algebraic-collapse framework for variational reduction in quantum-inspired continuous Ising solvers

eBay Inc.（eBay公司）；School of Mathematical Sciences, Shanghai Jiao Tong University（上海交通大学数学科学学院）

研究连续伊辛求解器密集交互评估成本高的问题，提出iSTAR算法，利用后期模拟分岔时轨迹坍缩特性，检测稳定坐标并仅在活动尾部继续，实现变分约简，在G集基准上平均去除64.4%的密集交互工作。

2026-07-08cs.NAmath.NAmath.OC