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

Optimal FALQON for Quantum Approximate Optimization via Layer-wise Parameter Tuning

Michael Mancini, Shabnam Sodagari

quant-phcs.AISubmitted May 8, 2026• Announced May 11, 2026• 1 citation• Revised Nov 3, 2026 (v3)
v1 · May 8, 2026v2 · Jul 7, 2026v3 · Nov 3, 2026
arXivHTMLPDF

Abstract

Feedback-based adaptive quantum optimization (FALQON) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum devices, but prior studies report that standard fixed-parameter schedules can require relatively deep circuits to reach strong solution quality. We study Optimal FALQON, a layer-wise formulation that treats the time-step $δ_k$ and scaling parameter $w_k$ as classical decision variables optimized per layer. The benchmark uses all 94 non-isomorphic 3-regular graphs with 12 vertices under 8192-shot simulation and compares standard FALQON, Optimal FALQON, and QAOA/QAOA-MA Powell runs warm-started from FALQON-derived schedules. Across approximation ratio, success probability, evaluation-normalized efficiency, and layer-normalized efficiency, Optimal FALQON substantially improves on standard FALQON, and Optimal-FALQON warm starts substantially improve on standard-FALQON warm starts.

Related papers

Second-Order FALQON Parameter Transfer for the Max-Cut Problem on 3-Regular Graphs

Gabriel Fernandes Thomaz, Eduarda Rodrigues Monteiro, Jerusa Marchi +3 more

The Feedback-based Algorithm for Quantum Optimization (FALQON) offers a deterministic alternative to variational quantum algorithms by bypassing classical optimization loops. However, maintaining convergence on large problem instances often requires restricting the time step, necessitating quantum circuit depths that exceed Noisy Intermediate-Scale Quantum (NISQ) hardware capabilities. This paper investigates the parameter transferability of second-order FALQON applied to the Max-Cut problem on 3-regular graphs. Through numerical experiments evaluating quantum circuits up to 16 layers on graphs up to 24 nodes, we demonstrate a highly advantageous scaling behavior: transferring feedback parameters optimized on small instances to larger target graphs yields significantly higher approximation ratios than natively optimizing the parameters directly on the larger graphs. This performance advantage arises because parameters trained on smaller instances can safely adopt aggressively larger time steps. By offloading the expensive parameter discovery phase to small-scale instances, this transfer strategy simultaneously reduces computational overhead and enhances the approximation ratio, thereby bringing FALQON closer to practical viability on near-term quantum architectures.

cs.ETCross-listedarXiv:2605.04253•May 7, 2026•0 citations

Solving Graph Coloring Problems Using Feedback-Based Algorithm for Quantum Optimization

Yuika Kawatomi, Yukina Tatsuta, Kazue Kudo

The feedback-based algorithm for quantum optimization (FALQON), which is an extension of the quantum approximate optimization algorithm (QAOA), is a promising approach for finding approximate solutions to combinatorial optimization problems. The FALQON avoids the optimization of variational parameters by using information derived from iterative measurements. To solve a constrained combinatorial optimization problem, it is sometimes more efficient to use an XY mixer rather than the conventional X mixer. We applied the FALQON with the XY mixer to graph coloring and investigated the expectation value of the problem Hamiltonian, success probability of graph coloring, and fair sampling for several small-scale problems. The FALQON with the XY mixer exhibited better performance than that with the X mixer.

quant-pharXiv:2609.30991•Sep 28, 2026•0 citations

Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral-atom system with an optimized small-angle controlled-phase gate

S. X. Li, W. L. Mu, Jia-Bin You +1 more

In contrast to the classical optimization process required by the quantum approximate optimization algorithm, FALQON, a feedback-based algorithm for quantum optimization [A. B. Magann et al., Phys. Rev. Lett. 129, 250502 (2022)], enables one to obtain approximate solutions to combinatorial optimization problems without any classical optimization effort. In this study, we leverage the specifications of a recent experimental platform for the neutral-atom system [Z. Fu et al., Phys. Rev. A 105, 042430 (2022)] and present a scheme to implement an optimally tuned small-angle controlled-phase gate. By examining the two- to four-qubit FALQON algorithms in the MaxCut problem and considering the spontaneous emission of the neutral atomic system, we observe that the performance of FALQON implemented with small-angle controlled-phase gates exceeds that of FALQON utilizing controlled-$Z$ gates. This approach has the potential to significantly simplify the logic circuit required to simulate FALQON and effectively address the MaxCut problem, which may pave the way for the experimental implementation of near-term noisy intermediate-scale quantum algorithms with neutral-atom systems.

arXiv:2405.10451•Physical Review A•Jun 10, 2024•9 citations

Accelerating feedback-based quantum algorithms through time rescaling

L. A. M. Rattighieri, G. E. L. Pexe, Bertúlio de Lima Bernardo +1 more

This work investigates the impact of time rescaling on the performance of Feedback-Based Quantum Algorithms (FQAs) and their variant for optimization tasks, Feedback-Based Algorithm for Quantum Optimization (FALQON). We introduce the Time-Rescaled Feedback-Based Quantum Algorithm (TR-FQA) and Time-Rescaled Feedback-Based Algorithm for Quantum Optimization (TR-FALQON), time-rescaled versions of FQA and FALQON, respectively. The method is applied to two representative problems: the MaxCut combinatorial optimization problem and ground-state preparation in the axial next-nearest neighbor Ising (ANNNI) model. The results show that TR-FALQON accelerates convergence toward the optimal solution in the circuit's early layers and outperforms the standard version in low-depth regimes. In the context of state preparation, TR-FQA requires fewer layers than the original algorithm. These findings suggest that time rescaling can reduce the number of layers needed to reach a high-quality solution, even if the exact ground state is not obtained.

arXiv:2504.01256•Physical Review A•Sep 17, 2025•12 citations

Feedback-based quantum optimization with low depth and measurement

Zi-Wen Huang, Jia-Cheng Fan, Xiao-Hui Ni +5 more

Feedback-based ALgorithm for Quantum OptimizatioN (FALQON) is a hybrid quantum-classical algorithm for solving combinatorial optimization problems, which circumvents classical parameter optimization but requires a deep quantum circuit. To reduce circuit depth, Arai et al. proposed second-order FALQON (SO-FALQON), achieving the best depth reduction among existing approaches. However, SO-FALQON brings a 2.3 times per-step measurement overhead, as it needs to calculate an additional second-order control coefficient. In this paper, inspired by the Backtracking Line Search (BLS) theory, we propose another method called BLS-FALQON, which not only reduces circuit depth to a comparable extent, but also achieves fewer measurements than SO-FALQON. Numerical simulations on max-cut problem with 8 to 20 vertices demonstrate that BLS-FALQON reduces the total measurement count by 37.7% compared to SO-FALQON, while maintaining a comparable circuit depth. Furthermore, we conduct real quantum hardware experiments on the Tianyan-176 quantum computer, which uses the zuchongzhi2 superconducting quantum processor, confirming that BLS-FALQON remains effective under real quantum hardware conditions.

quant-pharXiv:2609.32433•Sep 29, 2026•0 citations

Addressing Barren Plateaus in QAOA using layer-wise and adaptive optimization

Urvi Sharma

The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational quan- tum algorithm for solving combinatorial optimization problems. One major challenge with QAOA arises when the optimizer is unable to progress due to barren plateau problems. To address this, we propose a novel optimization technique called the Layered Quantum Approximate Optimization Al- gorithm (LQAOA), which uses warm-starting by fine-tuning parameters from previously optimized layers to initialize subsequent layers, training one layer at a time. Additionally, we incorporate adaptive layer-adding strategies, where layers are added based on a cost-convergence condition. The optimization approach, tested on Erdős–Rényi graphs for the Max-Cut problem with various hyperparameter settings, demonstrates improved performance over standard QAOA.

Työväentutkimus Vuosikirja•Jan 30, 2025•0 citations
Feedback-based adaptive quantum optimization (FALQON) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum devices, but prior studies report that standard fixed-parameter schedules can require relatively deep circuits to reach strong solution quality. We study Optimal FALQON, a layer-wise formulation that treats the time-step δkδ_kδk​ and scaling parameter wkw_kwk​ as classical decision variables optimized per layer. The benchmark uses all 94 non-isomorphic 3-regular graphs with 12 vertices under 8192-shot simulation and compares standard FALQON, Optimal FALQON, and QAOA/QAOA-MA Powell runs warm-started from FALQON-derived schedules. Across approximation ratio, success probability, evaluation-normalized efficiency, and layer-normalized efficiency, Optimal FALQON substantially improves on standard FALQON, and Optimal-FALQON warm starts substantially improve on standard-FALQON warm starts.
The Feedback-based Algorithm for Quantum Optimization (FALQON) offers a deterministic alternative to variational quantum algorithms by bypassing classical optimization loops. However, maintaining convergence on large problem instances often requires restricting the time step, necessitating quantum circuit depths that exceed Noisy Intermediate-Scale Quantum (NISQ) hardware capabilities. This paper investigates the parameter transferability of second-order FALQON applied to the Max-Cut problem on 3-regular graphs. Through numerical experiments evaluating quantum circuits up to 16 layers on graphs up to 24 nodes, we demonstrate a highly advantageous scaling behavior: transferring feedback parameters optimized on small instances to larger target graphs yields significantly higher approximation ratios than natively optimizing the parameters directly on the larger graphs. This performance advantage arises because parameters trained on smaller instances can safely adopt aggressively larger time steps. By offloading the expensive parameter discovery phase to small-scale instances, this transfer strategy simultaneously reduces computational overhead and enhances the approximation ratio, thereby bringing FALQON closer to practical viability on near-term quantum architectures.
The feedback-based algorithm for quantum optimization (FALQON), which is an extension of the quantum approximate optimization algorithm (QAOA), is a promising approach for finding approximate solutions to combinatorial optimization problems. The FALQON avoids the optimization of variational parameters by using information derived from iterative measurements. To solve a constrained combinatorial optimization problem, it is sometimes more efficient to use an XY mixer rather than the conventional X mixer. We applied the FALQON with the XY mixer to graph coloring and investigated the expectation value of the problem Hamiltonian, success probability of graph coloring, and fair sampling for several small-scale problems. The FALQON with the XY mixer exhibited better performance than that with the X mixer.
In contrast to the classical optimization process required by the quantum approximate optimization algorithm, FALQON, a feedback-based algorithm for quantum optimization [A. B. Magann et al., Phys. Rev. Lett. 129, 250502 (2022)], enables one to obtain approximate solutions to combinatorial optimization problems without any classical optimization effort. In this study, we leverage the specifications of a recent experimental platform for the neutral-atom system [Z. Fu et al., Phys. Rev. A 105, 042430 (2022)] and present a scheme to implement an optimally tuned small-angle controlled-phase gate. By examining the two- to four-qubit FALQON algorithms in the MaxCut problem and considering the spontaneous emission of the neutral atomic system, we observe that the performance of FALQON implemented with small-angle controlled-phase gates exceeds that of FALQON utilizing controlled-ZZZ gates. This approach has the potential to significantly simplify the logic circuit required to simulate FALQON and effectively address the MaxCut problem, which may pave the way for the experimental implementation of near-term noisy intermediate-scale quantum algorithms with neutral-atom systems.
This work investigates the impact of time rescaling on the performance of Feedback-Based Quantum Algorithms (FQAs) and their variant for optimization tasks, Feedback-Based Algorithm for Quantum Optimization (FALQON). We introduce the Time-Rescaled Feedback-Based Quantum Algorithm (TR-FQA) and Time-Rescaled Feedback-Based Algorithm for Quantum Optimization (TR-FALQON), time-rescaled versions of FQA and FALQON, respectively. The method is applied to two representative problems: the MaxCut combinatorial optimization problem and ground-state preparation in the axial next-nearest neighbor Ising (ANNNI) model. The results show that TR-FALQON accelerates convergence toward the optimal solution in the circuit's early layers and outperforms the standard version in low-depth regimes. In the context of state preparation, TR-FQA requires fewer layers than the original algorithm. These findings suggest that time rescaling can reduce the number of layers needed to reach a high-quality solution, even if the exact ground state is not obtained.
Feedback-based ALgorithm for Quantum OptimizatioN (FALQON) is a hybrid quantum-classical algorithm for solving combinatorial optimization problems, which circumvents classical parameter optimization but requires a deep quantum circuit. To reduce circuit depth, Arai et al. proposed second-order FALQON (SO-FALQON), achieving the best depth reduction among existing approaches. However, SO-FALQON brings a 2.3 times per-step measurement overhead, as it needs to calculate an additional second-order control coefficient. In this paper, inspired by the Backtracking Line Search (BLS) theory, we propose another method called BLS-FALQON, which not only reduces circuit depth to a comparable extent, but also achieves fewer measurements than SO-FALQON. Numerical simulations on max-cut problem with 8 to 20 vertices demonstrate that BLS-FALQON reduces the total measurement count by 37.7% compared to SO-FALQON, while maintaining a comparable circuit depth. Furthermore, we conduct real quantum hardware experiments on the Tianyan-176 quantum computer, which uses the zuchongzhi2 superconducting quantum processor, confirming that BLS-FALQON remains effective under real quantum hardware conditions.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational quan- tum algorithm for solving combinatorial optimization problems. One major challenge with QAOA arises when the optimizer is unable to progress due to barren plateau problems. To address this, we propose a novel optimization technique called the Layered Quantum Approximate Optimization Al- gorithm (LQAOA), which uses warm-starting by fine-tuning parameters from previously optimized layers to initialize subsequent layers, training one layer at a time. Additionally, we incorporate adaptive layer-adding strategies, where layers are added based on a cost-convergence condition. The optimization approach, tested on Erdős–Rényi graphs for the Max-Cut problem with various hyperparameter settings, demonstrates improved performance over standard QAOA.