Solving DC power flow problems using quantum and hybrid algorithms

被引:10
|
作者
Gao, Fang [1 ]
Wu, Guojian
Guo, Suhang
Dai, Wei
Shuang, Feng [1 ]
机构
[1] Guangxi Univ, Guangxi Key Lab Intelligent Control & Maintenance, Nanning 530004, Peoples R China
基金
中国国家自然科学基金;
关键词
DC power flow; Quantum algorithm; Hybrid algorithm; Qubit resources; INSPIRED EVOLUTIONARY ALGORITHM; GENETIC ALGORITHM; REAL; DISPATCH;
D O I
10.1016/j.asoc.2023.110147
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Power flow calculation plays an important role in planning, operation, and control of the power system. The quantum HHL algorithm can achieve theoretical exponential speedup over classical algorithms on DC power flow calculation. Since the qubit resources in the Noisy Intermediate-scale Quantum (NISQ) era are limited, it is important to discuss the performance considering this limitation. The phase estimation of DC power flow problems is imperfect. This work is carried out under the assumption of imperfect phase estimation. The performance of the HHL algorithm is systematically investigated with different accuracy and redundant qubits. In order to further reduce the required qubit resources, a hybrid quantum-classical algorithm is proposed. By comparing errors of the HHL and hybrid algorithms in the DC power flow calculation of the PJM 5-bus system, it is found that the hybrid algorithm can achieve comparable precision with fewer qubits than HHL by increasing the number of phase estimation modules, which may make the hybrid algorithm a feasible route in the NISQ era. (c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 50 条
  • [21] Solving timetabling problems using genetic algorithms
    Karova, M
    27TH INTERNATIONAL SPRING SEMINAR ON ELECTRONICS TECHNOLOGY, BOOKS 1-3, CONFERENCE PROCEEDINGS: MEETING THE CHALLENGES OF ELECTRONICS TECHNOLOGY PROGRESS, 2004, : 96 - 98
  • [22] Solving clusterization problems using groups of algorithms
    A. S. Biryukov
    V. V. Ryazanov
    A. S. Shmakov
    Computational Mathematics and Mathematical Physics, 2008, 48 : 168 - 183
  • [23] Solving Clusterization Problems Using Groups of Algorithms
    Biryukov, A. S.
    Ryazanov, V. V.
    Shmakov, A. S.
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2008, 48 (01) : 168 - 183
  • [24] New Bregman proximal type algorithms for solving DC optimization problems
    Shota Takahashi
    Mituhiro Fukuda
    Mirai Tanaka
    Computational Optimization and Applications, 2022, 83 : 893 - 931
  • [25] New Bregman proximal type algorithms for solving DC optimization problems
    Takahashi, Shota
    Fukuda, Mituhiro
    Tanaka, Mirai
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 83 (03) : 893 - 931
  • [26] Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
    An, LTH
    Tao, PD
    JOURNAL OF GLOBAL OPTIMIZATION, 1997, 11 (03) : 253 - 285
  • [27] Hybrid proximal point and extragradient algorithms for solving equilibrium problems
    Anh P.N.
    Hien N.D.
    Acta Mathematica Vietnamica, 2014, 39 (3) : 405 - 423
  • [28] CRITICALLY COUPLED ALGORITHMS FOR SOLVING THE POWER FLOW EQUATION
    CROUCH, PE
    TYLAVSKY, DJ
    CHEN, H
    JARRIEL, L
    ADAPA, R
    IEEE TRANSACTIONS ON POWER SYSTEMS, 1992, 7 (01) : 451 - 457
  • [29] Solving optimal power flow problems using a probabilistic α-constrained evolutionary approach
    Honorio, L. M.
    Leite da Silva, A. M.
    Barbosa, D. A.
    Delboni, L. F. N.
    IET GENERATION TRANSMISSION & DISTRIBUTION, 2010, 4 (06) : 674 - 682
  • [30] Solving traffic data occlusion problems in computer vision algorithms using DeepSORT and quantum computing
    Frank Ngeni
    Judith Mwakalonge
    Saidi Siuhi
    Journal of Traffic and Transportation Engineering(English Edition), 2024, (01) : 1 - 15