arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.12925math.OC
收藏

从量子到量子启发式:LogQ算法作为一种非线性连续松弛变量方法

From quantum to quantum-inspired: the LogQ algorithm as a non-linear continuous relaxation of variables method

TotalEnergies(道达尔能源)

Jérémie Messud, Yagnik Chatterjee

AI总结:

LogQ算法通过非线性连续松弛变量方法实现经典启发式,解决量子退火中的Pauli分解和测量开销问题,开创量子启发式方法新途径。

摘要:

LogQ算法编码二次无约束二元优化问题,常用于工业领域如投资组合优化、车队优化等。该算法在量子计算框架下开发,旨在通过减少所需量子比特和量子电路深度来实现实用的量子组合优化。尽管LogQ最近已被改造成梯度启发式方法,大大提高了参数优化效率,但仍面临Pauli分解和测量开销的挑战。本文证明LogQ可以完全在经典框架内重新表述,有效消除了Pauli分解的需要,并彻底绕过了测量挑战。这最终导致基于非线性连续松弛变量的经典启发式方法,据我们所知是新颖的。LogQ的故事展示了量子计算如何启发经典算法,从而产生所谓的'量子启发式'方法。

英文摘要:

The LogQ algorithm encodes Quadratic Unconstrained Binary Optimization (QUBO) problems, which are often encountered in the industry (portfolio optimization, fleet optimization, charging stations, etc.). It was developed within the framework of quantum computing, designed as a pragmatic approach to quantum combinatorial optimization that drastically reduces the number of required qubits and quantum circuit depth. While LogQ has recently been made compliant with gradient-inspired methods, greatly improving parameter optimization efficiency, it still faced hurdles regarding Pauli decomposition and measurement overhead. We here demonstrate that LogQ can be fully reformulated within a classical framework, which effectively eliminates the need for Pauli decomposition and bypasses the measurement challenges altogether. This finally leads to a classical heuristic based on a non-linear continuous relaxation of variables and is, to the best of our knowledge, novel. The LogQ story illustrates how quantum computing can inspire classical algorithms, leading to so-called "quantum-inspired" methods.

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

↑