Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2207.04263 · Journal of the Franklin Institute

Efficient depth selection for the implementation of noisy quantum approximate optimization algorithm

Yu Pan, Yifan Tong, Shibei Xue, Guofeng Zhang

Published Oct 30, 2022• 5 citations
arXivHTMLPDF
DOI
10.1016/j.jfranklin.2022.10.027

Related papers

Automatic depth optimization for a quantum approximate optimization algorithm

Yu Pan, Yifan Tong, Yi Yang

Quantum approximate optimization algorithm (QAOA) is a hybrid algorithm whose control parameters are classically optimized. In addition to the variational parameters, the right choice of hyperparameter is crucial for improving the performance of any optimization model. Control depth, or the number of variational parameters, is considered as the most important hyperparameter for QAOA. In this paper we investigate the control depth selection with an automatic algorithm based on proximal gradient descent. The performances of the automatic algorithm are demonstrated on seven-node and ten-node max-cut problems, which show that the control depth can be significantly reduced during the iteration whereas achieving an sufficient level of optimization accuracy. With theoretical convergence guarantee, the proposed algorithm can be used as an efficient tool for choosing the appropriate control depth as a replacement of random search or empirical rules. Moreover, the reduction of control depth will induce a significant reduction in the number of quantum gates in circuit, which improves the applicability of QAOA on noisy intermediate-scale quantum devices.

arXiv:2206.14412•Physical Review A•Mar 21, 2022•14 citations

The computational power of quantum approximate optimization algorithms

Ryan Maamer

•Jan 1, 2022•0 citations

Quantum Approximate Optimization Algorithm: Applications, Limitations and Enhancement

Pablo Herrero Gómez, Marcos Alemany Manzanaro, David Gil +1 more

Communications in computer and information science•Jan 1, 2026•0 citations

Dynamic Depth Quantum Approximate Optimization Algorithm for Solving Constrained Shortest Path Problem

Rakesh Saini, Nora Mohamed, Saif Al-Kuwari +1 more

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for solving NP hard combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) hardware. However, its performance is critically dependent on the selection of the circuit depth a parameter that must be specified a priori without clear guidance. In this paper, we introduce a variant of QAOA called dynamic depth Quantum Approximate Optimization Algorithm (DDQAOA) that resolves the challenge of pre selecting a fixed circuit depth. Our method adaptively expands circuit depth, starting from p = 1 and progressing up to p = 10, by transferring learned parameters to deeper circuits based on convergence criteria. We tested this approach on 100 instances of the Constrained Shortest Path Problem (CSPP) at 10 qubit and 16 qubit scales. Our DDQAOA achieved superior approximation ratios and success probabilities with fewer CNOT gate evaluations than the standard QAOA for p = 3, 5, 10, and 15. In particular, while standard QAOA at p = 15 achieved results close to our approach, it used 217% and 159.3% more CNOT gates for 10 qubit and 16 qubit instances, respectively. This demonstrates the performance and practical applicability of DDQAOA to solve combinatorial optimization problems on near term devices.

quant-pharXiv:2511.08657•Quantum Machine Intelligence•Nov 12, 2025•1 citation

Transpilation and optimization of QAOA for maximum weighted independent set

Nguyen Viet Dung Nghiem, Sy Vinh Le, Thang N. Dinh

In recent years, quantum computing has shown promise in solving certain problems more efficiently than classical methods. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a leading candidate for achieving quantum advantage on noisy intermediate-scale quantum (NISQ) devices. This study explores the application of QAOA to the Maximum Weighted Independent Set (MWIS) problem, with particular focus on circuit transpilation strategies and parameter optimization methods. Using IBM Qiskit, we systematically examine factors affecting QAOA performance, including different transpilation optimization levels and classical optimizer selection. Our results demonstrate that optimization level 3 reduced circuit depth by 32% compared to level 0 for p=3 circuits, while maintaining solution quality. Among classical optimizers, COBYLA achieved an 81.24% approximation ratio with only 54.8 function evaluations at p=2, outperforming both grid search and SPSA methods. Execution on IBM’s real quantum hardware resulted in performance degradation ranging from 16% at p=1 to 34% at p=3 compared to ideal simulations, highlighting the compounding impact of noise and gate errors as circuit depth increases.These findings provide practical guidance for quantum algorithm implementation on NISQ devices, demonstrating that appropriate selection of transpilation techniques and optimization methods can substantially improve quantum resource efficiency while maintaining solution quality.

Journal of Computer Science and Cybernetics•Sep 3, 2026•0 citations

Quantum approximate optimization algorithm: a review study and problems

Laith Abualigah, Saif AlNajdawi, Abiodun Motunrayo Ikotun +7 more

Elsevier eBooks•Jan 1, 2024•18 citations
Quantum approximate optimization algorithm (QAOA) is a hybrid algorithm whose control parameters are classically optimized. In addition to the variational parameters, the right choice of hyperparameter is crucial for improving the performance of any optimization model. Control depth, or the number of variational parameters, is considered as the most important hyperparameter for QAOA. In this paper we investigate the control depth selection with an automatic algorithm based on proximal gradient descent. The performances of the automatic algorithm are demonstrated on seven-node and ten-node max-cut problems, which show that the control depth can be significantly reduced during the iteration whereas achieving an sufficient level of optimization accuracy. With theoretical convergence guarantee, the proposed algorithm can be used as an efficient tool for choosing the appropriate control depth as a replacement of random search or empirical rules. Moreover, the reduction of control depth will induce a significant reduction in the number of quantum gates in circuit, which improves the applicability of QAOA on noisy intermediate-scale quantum devices.
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for solving NP hard combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) hardware. However, its performance is critically dependent on the selection of the circuit depth a parameter that must be specified a priori without clear guidance. In this paper, we introduce a variant of QAOA called dynamic depth Quantum Approximate Optimization Algorithm (DDQAOA) that resolves the challenge of pre selecting a fixed circuit depth. Our method adaptively expands circuit depth, starting from p = 1 and progressing up to p = 10, by transferring learned parameters to deeper circuits based on convergence criteria. We tested this approach on 100 instances of the Constrained Shortest Path Problem (CSPP) at 10 qubit and 16 qubit scales. Our DDQAOA achieved superior approximation ratios and success probabilities with fewer CNOT gate evaluations than the standard QAOA for p = 3, 5, 10, and 15. In particular, while standard QAOA at p = 15 achieved results close to our approach, it used 217% and 159.3% more CNOT gates for 10 qubit and 16 qubit instances, respectively. This demonstrates the performance and practical applicability of DDQAOA to solve combinatorial optimization problems on near term devices.
In recent years, quantum computing has shown promise in solving certain problems more efficiently than classical methods. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a leading candidate for achieving quantum advantage on noisy intermediate-scale quantum (NISQ) devices. This study explores the application of QAOA to the Maximum Weighted Independent Set (MWIS) problem, with particular focus on circuit transpilation strategies and parameter optimization methods. Using IBM Qiskit, we systematically examine factors affecting QAOA performance, including different transpilation optimization levels and classical optimizer selection. Our results demonstrate that optimization level 3 reduced circuit depth by 32% compared to level 0 for p=3 circuits, while maintaining solution quality. Among classical optimizers, COBYLA achieved an 81.24% approximation ratio with only 54.8 function evaluations at p=2, outperforming both grid search and SPSA methods. Execution on IBM’s real quantum hardware resulted in performance degradation ranging from 16% at p=1 to 34% at p=3 compared to ideal simulations, highlighting the compounding impact of noise and gate errors as circuit depth increases.These findings provide practical guidance for quantum algorithm implementation on NISQ devices, demonstrating that appropriate selection of transpilation techniques and optimization methods can substantially improve quantum resource efficiency while maintaining solution quality.