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:2611.00573

Scaling Laws for Parameter Setting in Digitized Counterdiabatic QAOA

Yaocheng Chen, Jiapei Zhuang

quant-phSubmitted Oct 31, 2026• Announced Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

Optimizing parameters separately for each problem instance limits the reuse of variational quantum algorithms. We develop empirical scaling laws for parameter setting in the digitized counterdiabatic quantum approximate optimization algorithm (DC-QAOA) for weighted MaxCut. The prescription combines exact covariance under uniform edge-weight rescaling with power laws in mean degree fitted separately to offline-optimized cost and counterdiabatic angles. After the weight and degree scales are removed, the optimized angles of different training graphs cluster around common amplitudes, so a small coefficient table suffices. Frozen coefficients assign angles from a target graph's mean degree and root-mean-square edge weight without target-instance variational optimization. In ideal-circuit simulations across 1050 test graphs spanning ten graph families and five positive edge-weight distributions, mean optimal-solution probability is higher than that of the fixed-angle quantum approximate optimization algorithm (QAOA) at each depth from one to four layers, reaching 19.36% versus 13.11% at four layers. A six-layer extension on 600 graphs also shows a mean probability advantage. Hardware execution on the IBM Quantum processor ibm_fez for 21 unit-weight 3-regular graphs shows a mean probability advantage at one layer, while the ordering reverses at two layers. In separate energy-based experiments, direct assignment gives a higher mean approximation ratio than random-start optimization reaches within 500 evaluations, and refinement started from the formula angles improves it further. These results show how a scaling-based representation of optimized angles can guide parameter reuse across graph instances, enabling direct parameter assignment without target-instance variational optimization and providing initial angles for local refinement.

AI Summary

The paper asks whether digitized counterdiabatic QAOA (DC-QAOA) parameters can be assigned to new weighted-MaxCut instances without instance-specific variational optimization. It combines RMS edge-weight normalization with separately fitted degree power laws: cost and counterdiabatic angles scale as $s_J^{-1}(D/D_0)^b$, while mixer angles remain fixed. Depth- and layer-specific coefficients are fitted to offline energy-optimized angles from 7,000 training graphs per depth through $p=4$, and 5,000 at $p=6$. Uniform weight-rescaling covariance is proved exactly; degree scaling is empirical, with generator second moments providing an inverse-square-root reference scale rather than determining the fitted exponents. Ideal-statevector tests compare the frozen prescription with validation-selected fixed-angle QAOA on 1,050 graphs spanning ten families, five positive-weight distributions, and 10–22 qubits. Mean optimal-cut sampling probability increases from 4.73% versus 1.43% at $p=1$ to 19.36% versus 13.11% at $p=4$. At $p=6$, a 600-graph subset gives 36.81% versus 26.69%. On a separate 12-graph energy benchmark, direct assignment achieves mean approximation ratio 0.8921, exceeding random-start optimization within 500 evaluations; formula-initialized refinement reaches 0.9010. Comparisons match layers, not entangling-gate budgets. Hardware tests on 21 graphs favor DC-QAOA at one layer but reverse at two. Other stated limitations include losses on individual instances, higher-depth failures below the fitting range $D>1$, and an evaluation pool previously examined during rule development. Energy improvements need not improve optimal-cut probability; larger-scale and matched-resource performance remain unestablished.

Little sign of AI-generated textIncrementalMissing comparison

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
14 pages main text; 12 pages supplementary material; 8 main figures and 7 supplementary figures

Related papers

Efficient large-scale quantum optimization via counterdiabatic ansatz

Jie Liu, Xin Wang

Quantum approximate optimization algorithm (QAOA) is one of the fundamental variational quantum algorithms, while a version of QAOA that includes counterdiabatic driving, termed digitized counterdiabatic QAOA (DC-QAOA), is generally considered to outperform QAOA for all system sizes when the circuit depth for the two algorithms are held equal. Nevertheless, DC-QAOA introduces more cnot gates per layer, so the overall circuit complexity is a tradeoff between the number of cnot gates per layer and the circuit depth and must be carefully assessed. In this paper, we conduct a comprehensive comparison of DC-QAOA and QAOA on maxcut problem with the total number of cnot gates held equal, and we focus on one implementation of counterdiabatic terms using nested commutators in DC-QAOA, termed as DC-QAOA(NC). We have found that DC-QAOA(NC) reduces the overall circuit complexity as compared to QAOA only for sufficiently large problems, and for maxcut problem the number of qubits must exceed 16 for DC-QAOA(NC) to outperform QAOA. Additionally, we benchmark DC-QAOA(NC) against QAOA on the Sherrington-Kirkpatrick model under realistic noise conditions, finding that DC-QAOA(NC) exhibits significantly improved robustness compared to QAOA, maintaining higher fidelity as the problem size scales. Notably, in a direct comparison between one-layer DC-QAOA(NC) and three-layer QAOA where both use the same number of cnot gates, we identify an exponential performance advantage for DC-QAOA(NC), further signifying its suitability for large-scale quantum optimization tasks. We have further shown that this advantage can be understood from the effective dimensions introduced by the counterdiabatic driving terms. Moreover, based on our finding that the optimal parameters generated by DC-QAOA(NC) strongly concentrate in the parameter space, we have devised an instance-sequential training method for DC-QAOA(NC) circuits, which, compared to traditional methods, offers performance improvement while using even fewer quantum resources. Our findings provide a more comprehensive understanding of the advantages of DC-QAOA circuits and an efficient training method based on their generalizability.

arXiv:2409.15055•Physical Review A•May 29, 2025•2 citations

Transferring linearly fixed QAOA angles: performance and real device results

Ryo Sakai, Hiromichi Matsuyama, Wai-Hong Tam +1 more

Quantum Approximate Optimization Algorithm (QAOA) enables solving combinatorial optimization problems on quantum computers by optimizing variational parameters for quantum circuits. We investigate a simplified approach that combines linear parameterization with parameter transferring, reducing the parameter space to just 4 dimensions regardless of the number of layers. This simplification draws inspiration from quantum annealing schedules providing both theoretical grounding and practical advantages. We compare this combined approach with standard QAOA and other parameter setting strategies such as INTERP and FOURIER, which require computationally demanding incremental layer-by-layer optimization. Notably, previously known methods like INTERP and FOURIER yield parameters that can be well fitted by linear functions, which supports our linearization strategy. Our analysis reveals that for the random Ising model, cost landscapes in this reduced parameter space demonstrate consistent structural patterns across different problem instances. Our experiments extend from classical simulation to actual quantum hardware implementation on IBM's Eagle processor, demonstrating the approach's viability on current NISQ devices. Furthermore, the numerical results indicate that parameter transferability primarily depends on the energy scale of problem instances, with normalization techniques improving transfer quality. Most of our numerical experiments are conducted on the random Ising model, while problem-dependence is also investigated across other models. A key advantage of parameter transferring is the complete elimination of instance-specific classical optimization overhead, as pre-trained parameters can be directly applied to other problem instances, reducing classical optimization costs by orders of magnitude for deeper circuits.

arXiv:2504.12632•Apr 17, 2025•7 citations

Multi-angle quantum approximate optimization algorithm

Rebekah Herrman, Phillip C. Lotshaw, James Ostrowski +2 more

The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.

arXiv:2109.11455•Scientific Reports•Apr 26, 2022•167 citations

QAOA Parameter Transfer for Hypergraphs

Lucas T. Braydwood, Phillip C. Lotshaw

Variational Quantum Algorithms, including the Quantum Approximate Optimization Algorithm (QAOA), have shown promise in solving optimization problems but rely on costly variational loops that can themselves be hard optimization problems. Many methods have been proposed to mitigate this variational cost, with one of the most common being parameter transfer and concentration where variational parameters for one problem instance or for an average over problem instances can be used as a good set of parameters for another instance. Methods exist for reweighting these parameters based off graph degree and edge weights, but there has been little work on how to do this reweighting to handle higher locality problems where the graph structure turns into a hypergraph structure. In this paper, we analytically derive parameter reweighting rules to transfer parameters between different locality hypergraphs, resulting in a reweighting for the mixing terms in the Hamiltonian which have previously not been considered. These analytics rely on three cycle-free and low-circuit-depth assumptions, but numerics indicate that the results can be used even when these assumptions are not satisfied. The numerics obtain high quality results across a diverse set of hypergraphs with locality less than or equal to five, improving on previous relations that do not reweight the mixing terms.

quant-pharXiv:2604.26040•Apr 30, 2026•2 citations

Evaluating the limits of Quantum Approximate Optimization Algorithm parameter transfer at high rounds on sparse Ising models with geometrically local cubic terms

Elijah Pelofske, Marek M. Rams, Andreas Bärtschi +4 more

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable nonvariational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher-order terms using the Julia based QAOA simulation tool to perform classical angle finding for up to 49 QAOA layers ( p ) . Parameter transfer of the fixed angles is validated using a combination of full state vector, projected entangled pair states, matrix product state, and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of p —there are many cases where the performance temporarily decreases as a function of p —but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the 100 + qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM noisy intermediate-scale quantum processors up to p = 5 on , up to p = 9 on , and up to p = 10 on .

arXiv:2509.13528•Physical Review Research•Mar 2, 2026•6 citations

Improving the efficiency of QAOA using efficient parameter transfer initialization and targeted-single-layer regularized optimization with minimal performance degradation

Shubham Patel, Utkarsh Mishra

Quantum approximate optimization algorithm (QAOA) have promising applications in combinatorial optimization problems (COPs). We investigated the MaxCut problem in three different families of graphs using QAOA ansats with parameter transfer initialization followed by targeted single layer optimization. For 3 regular (3R), Erdos Renyi (ER), and Barabasi Albert (BA) graphs, the parameter transfer approach achieved mean approximation ratios of 0.9443 for targeted-single layer optimization as compared to 0.9551 of full optimization. It represents 98.88 percent optimal performance, with 8.06 times computational speedup in unweighted graphs. But, in weighted graph families, optimal performance is relatively low (less than 90 percent) for higher nodes graph, suggesting parameter transfer followed by targeted-single-layer optimization is not ideal for weighted graph families, however, we find that for some weighted families (weighted 3-regular) this approach works perfectly. In 8.92 percent test cases, targeted single layer optimization outperformed the full optimization, indicating that complex parameter landscape can trap full optimization in sub-optimal local minima. To mitigate this inconsistency, ridge (L2) regularization is used to smoothen the solution landscape, which helps the optimizer to find better optimum parameters during full optimization and reduces these inconsistent test cases from 8.92 percent to 3.81 percent. This work demonstrates that efficient parameter initialization and targeted-single-layer optimization can improve the efficiency of QAOA with minimal performance degradation.

quant-pharXiv:2601.15760•Jan 23, 2026•1 citation
Optimizing parameters separately for each problem instance limits the reuse of variational quantum algorithms. We develop empirical scaling laws for parameter setting in the digitized counterdiabatic quantum approximate optimization algorithm (DC-QAOA) for weighted MaxCut. The prescription combines exact covariance under uniform edge-weight rescaling with power laws in mean degree fitted separately to offline-optimized cost and counterdiabatic angles. After the weight and degree scales are removed, the optimized angles of different training graphs cluster around common amplitudes, so a small coefficient table suffices. Frozen coefficients assign angles from a target graph's mean degree and root-mean-square edge weight without target-instance variational optimization. In ideal-circuit simulations across 1050 test graphs spanning ten graph families and five positive edge-weight distributions, mean optimal-solution probability is higher than that of the fixed-angle quantum approximate optimization algorithm (QAOA) at each depth from one to four layers, reaching 19.36% versus 13.11% at four layers. A six-layer extension on 600 graphs also shows a mean probability advantage. Hardware execution on the IBM Quantum processor ibm_fez for 21 unit-weight 3-regular graphs shows a mean probability advantage at one layer, while the ordering reverses at two layers. In separate energy-based experiments, direct assignment gives a higher mean approximation ratio than random-start optimization reaches within 500 evaluations, and refinement started from the formula angles improves it further. These results show how a scaling-based representation of optimized angles can guide parameter reuse across graph instances, enabling direct parameter assignment without target-instance variational optimization and providing initial angles for local refinement.
The paper asks whether digitized counterdiabatic QAOA (DC-QAOA) parameters can be assigned to new weighted-MaxCut instances without instance-specific variational optimization. It combines RMS edge-weight normalization with separately fitted degree power laws: cost and counterdiabatic angles scale as sJ−1(D/D0)bs_J^{-1}(D/D_0)^bsJ−1​(D/D0​)b, while mixer angles remain fixed. Depth- and layer-specific coefficients are fitted to offline energy-optimized angles from 7,000 training graphs per depth through p=4p=4p=4, and 5,000 at p=6p=6p=6. Uniform weight-rescaling covariance is proved exactly; degree scaling is empirical, with generator second moments providing an inverse-square-root reference scale rather than determining the fitted exponents.
Ideal-statevector tests compare the frozen prescription with validation-selected fixed-angle QAOA on 1,050 graphs spanning ten families, five positive-weight distributions, and 10–22 qubits. Mean optimal-cut sampling probability increases from 4.73% versus 1.43% at p=1p=1p=1 to 19.36% versus 13.11% at p=4p=4p=4. At p=6p=6p=6, a 600-graph subset gives 36.81% versus 26.69%. On a separate 12-graph energy benchmark, direct assignment achieves mean approximation ratio 0.8921, exceeding random-start optimization within 500 evaluations; formula-initialized refinement reaches 0.9010.
Comparisons match layers, not entangling-gate budgets. Hardware tests on 21 graphs favor DC-QAOA at one layer but reverse at two. Other stated limitations include losses on individual instances, higher-depth failures below the fitting range D>1D>1D>1, and an evaluation pool previously examined during rule development. Energy improvements need not improve optimal-cut probability; larger-scale and matched-resource performance remain unestablished.
Quantum approximate optimization algorithm (QAOA) is one of the fundamental variational quantum algorithms, while a version of QAOA that includes counterdiabatic driving, termed digitized counterdiabatic QAOA (DC-QAOA), is generally considered to outperform QAOA for all system sizes when the circuit depth for the two algorithms are held equal. Nevertheless, DC-QAOA introduces more cnot gates per layer, so the overall circuit complexity is a tradeoff between the number of cnot gates per layer and the circuit depth and must be carefully assessed. In this paper, we conduct a comprehensive comparison of DC-QAOA and QAOA on maxcut problem with the total number of cnot gates held equal, and we focus on one implementation of counterdiabatic terms using nested commutators in DC-QAOA, termed as DC-QAOA(NC). We have found that DC-QAOA(NC) reduces the overall circuit complexity as compared to QAOA only for sufficiently large problems, and for maxcut problem the number of qubits must exceed 16 for DC-QAOA(NC) to outperform QAOA. Additionally, we benchmark DC-QAOA(NC) against QAOA on the Sherrington-Kirkpatrick model under realistic noise conditions, finding that DC-QAOA(NC) exhibits significantly improved robustness compared to QAOA, maintaining higher fidelity as the problem size scales. Notably, in a direct comparison between one-layer DC-QAOA(NC) and three-layer QAOA where both use the same number of cnot gates, we identify an exponential performance advantage for DC-QAOA(NC), further signifying its suitability for large-scale quantum optimization tasks. We have further shown that this advantage can be understood from the effective dimensions introduced by the counterdiabatic driving terms. Moreover, based on our finding that the optimal parameters generated by DC-QAOA(NC) strongly concentrate in the parameter space, we have devised an instance-sequential training method for DC-QAOA(NC) circuits, which, compared to traditional methods, offers performance improvement while using even fewer quantum resources. Our findings provide a more comprehensive understanding of the advantages of DC-QAOA circuits and an efficient training method based on their generalizability.
Quantum Approximate Optimization Algorithm (QAOA) enables solving combinatorial optimization problems on quantum computers by optimizing variational parameters for quantum circuits. We investigate a simplified approach that combines linear parameterization with parameter transferring, reducing the parameter space to just 4 dimensions regardless of the number of layers. This simplification draws inspiration from quantum annealing schedules providing both theoretical grounding and practical advantages. We compare this combined approach with standard QAOA and other parameter setting strategies such as INTERP and FOURIER, which require computationally demanding incremental layer-by-layer optimization. Notably, previously known methods like INTERP and FOURIER yield parameters that can be well fitted by linear functions, which supports our linearization strategy. Our analysis reveals that for the random Ising model, cost landscapes in this reduced parameter space demonstrate consistent structural patterns across different problem instances. Our experiments extend from classical simulation to actual quantum hardware implementation on IBM's Eagle processor, demonstrating the approach's viability on current NISQ devices. Furthermore, the numerical results indicate that parameter transferability primarily depends on the energy scale of problem instances, with normalization techniques improving transfer quality. Most of our numerical experiments are conducted on the random Ising model, while problem-dependence is also investigated across other models. A key advantage of parameter transferring is the complete elimination of instance-specific classical optimization overhead, as pre-trained parameters can be directly applied to other problem instances, reducing classical optimization costs by orders of magnitude for deeper circuits.
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.
Variational Quantum Algorithms, including the Quantum Approximate Optimization Algorithm (QAOA), have shown promise in solving optimization problems but rely on costly variational loops that can themselves be hard optimization problems. Many methods have been proposed to mitigate this variational cost, with one of the most common being parameter transfer and concentration where variational parameters for one problem instance or for an average over problem instances can be used as a good set of parameters for another instance. Methods exist for reweighting these parameters based off graph degree and edge weights, but there has been little work on how to do this reweighting to handle higher locality problems where the graph structure turns into a hypergraph structure. In this paper, we analytically derive parameter reweighting rules to transfer parameters between different locality hypergraphs, resulting in a reweighting for the mixing terms in the Hamiltonian which have previously not been considered. These analytics rely on three cycle-free and low-circuit-depth assumptions, but numerics indicate that the results can be used even when these assumptions are not satisfied. The numerics obtain high quality results across a diverse set of hypergraphs with locality less than or equal to five, improving on previous relations that do not reweight the mixing terms.
The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable nonvariational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher-order terms using the Julia based QAOA simulation tool to perform classical angle finding for up to 49 QAOA layers ( p ) . Parameter transfer of the fixed angles is validated using a combination of full state vector, projected entangled pair states, matrix product state, and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of p —there are many cases where the performance temporarily decreases as a function of p —but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the 100 + qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM noisy intermediate-scale quantum processors up to p = 5 on , up to p = 9 on , and up to p = 10 on .
Quantum approximate optimization algorithm (QAOA) have promising applications in combinatorial optimization problems (COPs). We investigated the MaxCut problem in three different families of graphs using QAOA ansats with parameter transfer initialization followed by targeted single layer optimization. For 3 regular (3R), Erdos Renyi (ER), and Barabasi Albert (BA) graphs, the parameter transfer approach achieved mean approximation ratios of 0.9443 for targeted-single layer optimization as compared to 0.9551 of full optimization. It represents 98.88 percent optimal performance, with 8.06 times computational speedup in unweighted graphs. But, in weighted graph families, optimal performance is relatively low (less than 90 percent) for higher nodes graph, suggesting parameter transfer followed by targeted-single-layer optimization is not ideal for weighted graph families, however, we find that for some weighted families (weighted 3-regular) this approach works perfectly. In 8.92 percent test cases, targeted single layer optimization outperformed the full optimization, indicating that complex parameter landscape can trap full optimization in sub-optimal local minima. To mitigate this inconsistency, ridge (L2) regularization is used to smoothen the solution landscape, which helps the optimizer to find better optimum parameters during full optimization and reduces these inconsistent test cases from 8.92 percent to 3.81 percent. This work demonstrates that efficient parameter initialization and targeted-single-layer optimization can improve the efficiency of QAOA with minimal performance degradation.