数学优化
计算机科学
泡利不相容原理
量子位元
稳健性(进化)
初始化
可扩展性
量子
最优化问题
统计物理学
放松(心理学)
编码(内存)
数学
算法
应用数学
量子计算机
遍历理论
哈密顿量(控制论)
投资组合优化
量化(信号处理)
马尔可夫过程
马尔可夫链
拓扑(电路)
量子态
启发式
代表(政治)
量子算法
拉格朗日松弛
量子退相干
编码
作者
Yoshioka, Takuya,Keita Sasada,Riku Usuki,Yuichiro Nakano,Keisuke FUJII
摘要
Variational quantum algorithms offer a promising route to combinatorial optimization, but their applicability is limited by the challenge of encoding large-scale problems within restricted qubit resources. In this work, we introduce a qubit-efficient variational framework based on Pauli correlation encoding (PCE) and apply it to electric power demand portfolio optimization. Binary variables are represented through expectation values of Pauli correlation operators, which encode multi-body correlations of the quantum state and provide a continuous relaxation enabling compact representations with few qubits. We further propose a two-stage hybrid formulation, in which a time-averaged problem provides initialization for a time-resolved optimization. Numerical simulations demonstrate near-optimal performance across problem sizes ranging from $m=18$ to $10{,}296$, with normalized cost gaps on the order of $10^{-4}$ relative to solutions with certified optimality. We show that the performance is governed by the interplay between continuous relaxation and discretization: the effective resolution of the correlator representation determines how reliably improvements in the continuous loss translate into better discrete solutions, with larger systems exhibiting more consistent behavior. Finally, we demonstrate robustness on a trapped-ion quantum processor, where high-quality solutions are obtained despite noise and finite sampling. These results establish PCE as a physically motivated and qubit-efficient framework for large-scale combinatorial optimization.
科研通智能强力驱动
Strongly Powered by AbleSci AI