QLQiang Li

Qiang Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Qiang Li has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Review on Ansatz Architectures of Variational Quantum Algorithms for Continuous Optimization: From Fixed Structures to Adaptive Evolution

    by Chuanzhou He, Qiang Li, Jun Zhang

    Variational quantum algorithms (VQAs) are a leading framework for realizing quantum advantages in the Noisy Intermediate-Scale Quantum (NISQ) era, with applications spanning discrete combinatorial problems and continuous optimization. While the topologies of parameterized quantum circuits (ansatzes) fundamentally govern both expressibility and trainability in continuous landscapes, existing reviews predominantly focus on static algorithmic classifications or discrete settings, leaving the structural evolution and practical limitations of ansatz architectures insufficiently explored. To address this gap, this review presents a systematic analysis of variational ansatz architectures, tracing their progression from static, pre-defined topologies to adaptive growth mechanisms. Beyond traditional gradient-driven and architecture-search paradigms, we evaluate supplementary strategies such as layerwise training and noise-adaptive construction, revealing inherent vulnerabilities such as local minima entrapment and the compilation overhead induced by calibration drift. The mathematical foundations of VQAs are outlined, and representative fixed ansatz architectures, including hardware-efficient, physics-inspired, and problem-specific designs, are characterized within continuous-domain mappings. Intrinsic limitations arising from barren plateaus (BPs) and noise-induced barren plateaus (NIBPs) are analyzed, revealing the fundamental coupling between circuit depth, parameter scaling, and trainability degradation. Furthermore, adaptive construction strategies and recent advances in automated variational quantum architecture search (VQAS) are examined. Through the synthesis of intrinsic limitations (BPs, NIBPs, and hardware-algorithm coupling) and the evaluation of standardized benchmarking protocols, this review rigorously assesses the resource trade-offs of current VQA frameworks. Ultimately, next-generation ansatz design will adopt hardware–software co-design principles grounded in physical constraints, enabling scalable and noise-resilient quantum optimization.

  • Open Access

    A Rapid Post‐Disaster Restoration Method for Networked Microgrids Based on Adaptive Quantum Particle Swarm Optimization

    by Yunfan Zhang, Qiang Li, Jun Zhang, Chaohuang Xu

    After extreme natural disasters occur, the integration of multiple restoration methods, such as islanding segmentation, network reconfiguration, and repair crew scheduling, can significantly improve the reliability of power supply and increase the efficiency of service restoration in a power system. To achieve the rapid post‐disaster restoration in networked microgrids (NMGs), this paper proposes a rapid post‐disaster restoration method based on the co‐optimization of fault repair and load restoration. First, a multifault repair optimization model of NMGs is presented, which takes into account the optimization of repair time, economic loss, labor cost and repair efficiency. Second, to solve the repair scheduling, an adaptive quantum particle swarm optimization algorithm with a nonlinear adaptive contraction and expansion coefficient is designed, which improves the solution efficiency. Subsequently, a two‐layer co‐optimization model for fault repair and load restoration is proposed. This model guides the repair sequence based on the results of islanding segmentation and network reconfiguration, dynamically updating the network topology according to the repair process. Finally, the feasibility and superiority of the proposed method are verified using post‐disaster restoration scenarios of the modified Institute of Electrical and Electronics Engineers 33‐bus and PG&E 69‐bus NMGs. Compared with existing methods, the resilience index of load retention capacity and the post‐disaster power restoration speed have improved by 6.58% and 15.82%, respectively.

  • Open Access

    Distributed Particle Swarm Optimization with Dimension-Level Interactions for Large-Scale Separable Optimization Problems

    by Tingting Xiao, Qiang Li, Jun Zhang

    Optimization problems for large-scale distributed systems are challenging due to their complexities. In an attempt to solve these problems, centralized intelligence algorithms suffer from large computational costs and slow convergence rates. Therefore, in this paper, a distributed particle swarm optimization (MDPSO) algorithm is proposed. To reduce computational costs, a dimension-level interaction is introduced, and an average consensus operator is incorporated for accelerating convergence rates. In the distributed method, each agent is assigned only a single particle, rather than a subpopulation in traditional PSO. Furthermore, every particle position is decomposed into two sub-vectors that are processed separately, significantly improving convergence rate and solution accuracy. Moreover, a theorem and a corollary are presented, which guarantee the consensus convergence of the proposed method. Finally, three cases are designed. The results show that our method requires only half the number of iterations compared to other methods. Additionally, it finds optima with higher accuracy. More importantly, compared to the variants of PSO, only 1/N of the total particle population is used, which reduces the computational costs significantly.


  • Open Access

    Cooperative Control Method Based on Two-Objective Co-Optimization for MMCs in HVDC Systems

    by Jinli Lv, Jiankang Zhang, Yuan Zhi, Kangping Wang, Pengjiang Ge, Jun Zhang, Qiang Li

    High-voltage direct current (HVDC) systems, with their advantages of large capacity, long distance, high efficiency, and low loss, are becoming the core support of new power systems. However, in conventional droop control, the fixed droop coefficient causes output power disproportionate to the available capacities among converters, as well as a relatively large deviation of DC voltage in HVDC systems. Therefore, in this paper, a two-objective optimization model for droop control is developed and then it is integrated to a cooperative control, which achieves the co-optimization of voltage deviation and power sharing among multiple converters. In the optimization model, there are two objectives, the minimization of voltage deviation and maximization of the capacity utilization rates of converters. Further, a cooperative control method based on the optimization model is proposed, where information on voltage and power in droop-controlled converters is acquired and the co-optimization of voltage deviation and power sharing is performed to obtain the optimal droop coefficients for these converters, which minimizes voltage deviation, and at the same time, makes power mismatches proportional to their available capacities among converters. Finally, a testbed is built in PSCAD/EMTDC and four cases are designed to verify the proposed method under different settings. The simulation results show that compared with conventional droop control, the voltage deviation is reduced by 71.74% and 67.67% under the cases that a converter is out of service and the three-phase ground fault of a converter occurs. Additionally, when large power fluctuations occur twice, the power mismatches are shared proportionally to their available capacities, which results in the capacity utilization rates of the droop-controlled converters increasing by 24.46% and 18.75%, respectively.


  • Open Access

    Cooperative Control Method Based on Two-Objective Optimization for MMCs in HVDC Systems

    by Jinli Lv, Jiankang Zhang, Yuan Zhi, Kangping Wang, Pengjiang Ge, Jun Zhang, Qiang Li

    High voltage direct current (HVDC) systems, with its advantages of large capacity, long distance, high efficiency, and low loss, are becoming the core support of the new power system. However, in conventional droop control, the fixed droop coefficient causes output power disproportionate to their available capacities among converters, as well as relatively large deviation of DC voltage in HVDC systems. Therefore, in this paper a two-objective optimization model for droop control is developed and then it is integrated to a cooperative control, which achieves the co-optimization of voltage deviation and power sharing among multiple converters. In the optimization model, there are two objectives, minimization of voltage deviation and maximization of capacity utilization rates of converters. Further, a cooperative control based on optimization model is proposed, where information of voltage and power in droop-controlled converters is acquired and the co-optimization of voltage deviation and power sharing is performed to obtain the optimal droop coefficients for these converters, which minimizes voltage deviation and at the same time make power mismatches proportional to their available capacities among converters. Finally, a testbed is built in PSCAD/EMTDC and three cases are designed to verify the proposed method under different settings. The simulation results show that compared with conventional droop control, the voltage deviation is reduced by 71.74% and 67.67% under the cases of out of service of a converter and the three-phase ground fault of a converter, respectively. Additionally, when large power fluctuations occur twice, the power mismatches are shared proportionally to their available capacities, which results in the capacity utilization rates of the droop-controlled converters increased by 24.46% and 18.75%, respectively.


  • Distributed Weighted Gradient Descent Method With Adaptive Step Sizes for Energy Management of Microgrids

    by Xinze Zheng, Qiang Li, Juzhong Yuan, Ziyu Chen

    Economic dispatch problems for power systems become more challenging as the system sizes, types and data increase significantly. Facing these complex optimization problems, centralized optimization methods may fall short and appear inefficient. Conversely, distributed optimization methods seem to be a potential and powerful tool for dealing with these more complex problems. However, some widely-used distributed methods suffer from their low convergence rates. Therefore, in this paper, a faster distributed optimization method via gradient descent is proposed, where the weighted matrix and adaptive step sizes are the keys of our method. In the distributed gradient method, the weighted matrix is modified and constructed from the out-degrees and upper limits of the second derivatives of objective functions, which boosts gradients reaching consensus more quickly. Further, the adaptive step sizes are presented to overcome the low convergence rate caused by manual settings of step sizes, where the Hessian matrix are used iteratively to obtain the optimal step sizes, which cooperates with the weighted matrix for gradients to lead to a faster convergence rate. Next, two propositions and a theorem are proved to show the linear convergence feature of the proposed method, which guarantees the fast convergence of our method. Finally, the proposed method is applied to solve the economic dispatch problem that consists of economic and environmental objectives in microgrids. Simulation results show that the number of iterations of our method is only one third or even less than those of some widely used methods. Moreover, when solving economic dispatch problems, our method exhibits superior fault tolerance in comparison to centralized methods.


  • Open Access

    Game‐based distributed energy‐sharing model for prosumers in microgrids considering carbon emissions and its fast equilibrium‐finding method

    by Xinze Zheng, Qiang Li, Juzhong Yuan

    In recent years, energy sharing has attracted a lot of attention. However, the intermediate platforms in centralized energy‐sharing methods cause the rapid growth of communication complexity and the risk of privacy leakage. Unlike complex energy‐sharing market mechanisms, in this paper, a simple and efficient distributed energy sharing for microgrids (MGs) is proposed, where game theory is employed to form flexible prices for prosumers and only local information is used to improve the privacy protection of prosumers. First, prosumers located in different areas are characterized more precisely and a two‐tier carbon emission cost model is built. Next, a game‐theory‐based distributed energy‐sharing model is proposed, where a flexible pricing mechanism is developed to enable prosumers to independently reach price agreements and achieve supply–demand balance within MGs. In the process, optimization models for obtaining equilibrium are formed and only local information is needed. However, solving these optimization models is generally time‐consuming. So, a distributed optimization method based on weighted subgradients is proposed to accelerate the equilibrium‐finding process. Finally, four cases are designed, and simulation results demonstrate that the prosumers' costs of our method are reduced by 7.5%–22.5% compared to the costs obtained by feed‐in tariff. Moreover, in the case of solving the distributed trading model for an MG at a 24‐h time scale, the iteration numbers of our method are only 38.9% and 49.3% of the two traditional solving methods.

  • Open Access

    Unscented Trainable Kalman Filter Based on Deep Learning Method Considering Incomplete Information

    by Yanjie Yu, Qiang Li, Houyi Zhang

    Rapid changes of states and occurrence of data missing in power systems cause accurate state estimation very hard. In this paper, an unscented trainable Kalman filter (UTKF) with a deep learning prediction model is proposed to provide accurate state estimation under incomplete information. First, the CNN-LSTM architecture, a typical deep learning model, is applied to form a trainable prediction model (TPM), which offers more accurate prediction of states. However, sometimes states are incomplete due to data losses in transmissions. To deal with incomplete information, historical time-series states are employed and fed to the TPM in order to develop a missing data filling method. In this way, the prediction errors can be lower through the online training and parameter adjustment of the TPM. Combining with the TPM and the missing data filling method, an unscented trainable Kalman filter (UTKF) is proposed to improve the state estimation of power systems when incomplete information is involved. Finally, three cases are designed, and the simulation results show that for the prediction of states, the root mean square error (RMSE), an indicator of accuracies, is reduced by about 3 multiples, if our missing data filling method is added. Furthermore, the accuracy of state estimation is improved about 5 multiples by the proposed UTKF method, even if incomplete information is involved.


  • Dynamic Weighted-Gradient Descent Method With Smoothing Momentum for Distributed Energy Management of Multi-Microgrids Systems

    by Cong Bai, Qiang Li, Xinze Zheng, Xingpeng Yin, Yingjie Tan

    Distributed optimization methods are powerful tools to deal with complex systems. However, the slow convergence rates of some widely used distributed methods have restricted their applications. In this paper, a dynamic weighted-gradient descent method is proposed to improve the convergence rate significantly, where the construction of the dynamic weighted matrix is the key of our distributed method. To form the matrix, the maximal differences of gradients between neighbor agents are calculated to derive entries of the matrix, which is an effective way to accelerate convergence while the equality constraint is always satisfied. Furthermore, the momentum terms based on the last updates of decision variables are also introduced, which reduce frequent change of gradients and speed up convergence rates further. Next, two propositions and a theorem are proved in the analysis of convergence part, which show the values of objective functions are monotonically decreasing to optima. Finally, simulations are carried out, and the results show that for a given accuracy, the number of iterations of our method are only one fourth of three widely used methods or even less. Additionally, applying our method, the optimal dispatches in a multi-microgird (MMG) system are achieved fast in a distributed manner, and the MMG can still work well, even if agents fail on communication networks.