论文标题
混合量子古典单元承诺
Hybrid Quantum-Classical Unit Commitment
论文作者
论文摘要
本文提出了一种混合量子古典算法,以解决称为单位承诺(UC)的基本功率系统问题。 UC问题被分解为二次子问题,一个二次无约束的二进制优化(QUBO)子问题以及无约束的二次子问题。经典优化求解器求解了第一个和第三个子问题,而QUBO子问题是通过称为量子近似优化算法(QAOA)的量子算法求解的。然后,使用三个块交替的乘数算法的方法进行迭代协调三个子问题。在IBM Q系统上使用Qiskit作为仿真环境,模拟结果证明了所提出的算法解决UC问题的有效性。
This paper proposes a hybrid quantum-classical algorithm to solve a fundamental power system problem called unit commitment (UC). The UC problem is decomposed into a quadratic subproblem, a quadratic unconstrained binary optimization (QUBO) subproblem, and an unconstrained quadratic subproblem. A classical optimization solver solves the first and third subproblems, while the QUBO subproblem is solved by a quantum algorithm called quantum approximate optimization algorithm (QAOA). The three subproblems are then coordinated iteratively using a three-block alternating direction method of multipliers algorithm. Using Qiskit on the IBM Q system as the simulation environment, simulation results demonstrate the validity of the proposed algorithm to solve the UC problem.