AI 中文总结
研究用于电网优化问题的混合量子-经典算法，考虑两种候选算法，在随机生成的AC-OPF-UC实例上基准测试，结果表明高效量子比特混合方法不优于均匀采样，大系统规模测试超出计算能力，分支定界方法的量子版本或更有前景。
AI 中文摘要
交流最优潮流机组组合（AC-OPF-UC）是一个困难的混合整数非线性优化问题，它将二元发电机组合决策与非凸连续交流潮流约束相结合。在这项工作中，我们研究混合量子-经典变分算法相对于经典方法能否改善单周期AC-OPF-UC的解决方案。据我们所知，这是首次直接评估用于完整AC-OPF-UC问题的量子或混合量子-经典算法的研究。我们考虑了两种相对于纯经典方法在理想量子硬件上提高AC-OPF-UC解决方案质量的候选算法。第一种将QAOA直接应用于问题的完全离散化公式，通过惩罚项和松弛变量纳入等式和不等式约束。第二种方法在量子计算机上仅对二元发电机状态变量进行编码，同时针对每个采样比特串经典地优化连续潮流变量。我们在具有5到13个发电机的随机生成的AC-OPF-UC实例上对该方法进行基准测试，并将其与SCIP、SMAC和均匀随机采样进行比较。我们的模拟表明，高效量子比特混合方法并不优于均匀采样。这些结果表明，为了确定这里考虑的变分混合策略相对于最佳经典算法的潜在优势（如果有的话），需要测试大得多的系统规模（25个以上发电机），这超出了我们的计算能力。或者，不同的方法，如分支定界方法的量子版本可能更有前景。
英文摘要
Alternating Current Optimal Power Flow Unit Commitment (AC-OPF-UC) is a difficult mixed-integer nonlinear optimization problem that combines binary generator commitment decisions with nonconvex continuous AC power-flow constraints. In this work, we investigate whether hybrid quantum-classical variational algorithms can improve the solution of single-period AC-OPF-UC relative to classical approaches. To the best of our knowledge, this is the first study to directly evaluate quantum or hybrid quantum-classical algorithms for the full AC-OPF-UC problem. We consider two candidate algorithms for improving AC-OPF-UC solution quality relative to purely classical methods on ideal quantum hardware. The first applies QAOA directly to a fully discretized formulation of the problem, with equality and inequality constraints incorporated through penalty terms and slack variables. Although conceptually straightforward, this approach requires a prohibitively large number of qubits even for small instances. The second, qubit-efficient approach encodes only the binary generator status variables on a quantum computer, while optimizing the continuous power-flow variables classically for each sampled bitstring. We benchmark this method on randomly generated AC-OPF-UC instances with 5 to 13 generators and compare it against SCIP, SMAC, and uniform random sampling. Our simulations show that the qubit-efficient hybrid method does not outperform uniform sampling. These results suggest that in order to establish potential advantage of the variational hybrid strategy considered here over the best classical algorithms, if any, much larger system sizes (25+ generators) need to be tested, which is beyond our computational capacity. Alternatively, different approaches, such as quantum versions of branch-and-bound methods, may be more promising.
