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

Feedback-based quantum optimization with low depth and measurement

Zi-Wen Huang, Jia-Cheng Fan, Xiao-Hui Ni, Su-Juan Qin, Xiao-Kai Hou, Wei Huang, Bing-Jie Xu, Fei Gao

quant-phSubmitted Sep 26, 2026• Announced Sep 29, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

FALQON avoids classical variational-parameter optimization but can require deep circuits. Its second-order variant, SO-FALQON, permits larger evolution steps at the cost of additional observable measurements. This paper asks whether comparable depth reduction is possible with lower measurement overhead. BLS-FALQON retains first-order commutator feedback and monitors the problem energy. When a layer increases the energy, it repeatedly rescales that layer’s control coefficient by $\tau\in(-1,0)$, reversing its sign and reducing its magnitude until the energy decreases. Experiments use $\tau=-1/4$. Theoretical arguments give finite-backtracking bounds under assumptions about higher-order errors or a quadratic energy landscape; they do not establish convergence to the global optimum. Simulations benchmark 274 unweighted 3-regular Max-Cut instances with 8–20 vertices, using 1,024 shots per measurement basis. To reach approximation ratio $0.932$, BLS-FALQON uses 37.7% fewer total measurement bases than SO-FALQON while requiring 2.5% more layers. Relative to original FALQON, the reported reductions are 88.1% in measurement bases and approximately 90.9% in layers. Hardware tests use 4-, 6-, and 8-qubit instances, ten layers, and twenty runs per algorithm. Estimated execution time is about 43% lower than SO-FALQON. Hardware measurements supply feedback, but reported approximation ratios are evaluated by exact simulation using the resulting controls, rather than directly from hardware output states. The paper reports increasing discrepancies from ideal trajectories with problem size and little improvement beyond roughly five layers; hardware tests do not reach the target approximation ratio.

Little sign of AI-generated textIncrementalOverclaimsStrong assumptionsPossible error

Error found: The hardware study evaluates approximation ratios through ideal simulations with hardware-derived parameters, so it does not establish end-to-end noisy-hardware optimization performance. The finite-termination proof assumes a positive descent neighborhood that its remainder estimate and the condition A_k != 0 do not establish. Algorithm 3 retains a feedback coefficient computed from the uncorrected state after backtracking and never checks the final layer for an energy increase. Proposition 2's iteration bound can be negative for an allowed wrong-sign initial coefficient that already satisfies the magnitude condition.

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

Comments
16 pages, 4 figures

Related papers

Time rescaling for second-order feedback-based quantum optimization

Leticia Bertuzzi, João P. Engster, Evandro C. R. da Rosa +1 more

Feedback-based quantum algorithms recently gained attention by demonstrating how quantum computers can be used to solve optimization problems without resorting to hybrid quantum-classical architectures. Recent progress made with Feedback-based Algorithm for Quantum Optimization (FALQON) variants significantly reduced the depth of the required circuits. In this work, we merge the time-rescaled and second-order FALQON variants into a unified framework. The results show an important improvement over past modifications, reducing circuit depth and allowing a more flexible choice of time-steps, while maintaining stable solutions. This FALQON variant makes it suitable for the NISQ era.

quant-pharXiv:2609.21640•Sep 21, 2026•0 citations

Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation

D. Arai, Ken N. Okada, Yuichiro Nakano +2 more

Combinatorial optimization problems are one of the areas where near-term noisy quantum computers may have practical advantage against classical computers. Recently, a feedback-based quantum optimization algorithm has been proposed by Magann , . The method explicitly determines quantum circuit parameters by feeding back measurement results thus avoids classical parameter optimization that is known to cause significant trouble in quantum approximate optimization algorithm, the well-studied near-term algorithm. Meanwhile, a significant drawback of the feedback-based quantum optimization is that it requires deep circuits, rendering the method unsuitable to noisy quantum devices. In this study we propose a feedback law for parameter determination by introducing the second-order approximation with respect to time interval, a hyperparameter in the feedback-based quantum optimization. This allows one to take larger time interval, leading to acceleration of convergence to solutions. In numerical simulations on the maximum cut problem we demonstrate that our proposal significantly reduces circuit depth, with its linear scaling with the problem size smaller by more than an order of magnitude. We expect that the feedback law proposed in this work may pave the way for feedback-based quantum optimization with near-term noisy quantum computers.

arXiv:2407.17810•Physical Review Research•Jan 9, 2025•15 citations

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

Quantum feedback algorithms for DNA assembly using FALQON variants

Pedro M. Prado, Lucas A. M. Rattighieri, Rafael Simões do Carmo +6 more

Reconstructing DNA sequences without a reference, known as de novo assembly, is a complex computational task involving the alignment of overlapping fragments. To address this problem, a usual strategy is to map the assembly to a Quadratic Unconstrained Binary Optimization (QUBO) formulation, which can be solved by different quantum algorithms. In this work, we focus on three versions of the Feedback-based Algorithm, a protocol that eliminates classical optimization loops via measurement feedback. We analyze long-read DNA fragments from SARS-CoV-2 and human mitochondrial DNA using standard FALQON, second-order FALQON (SO-FALQON), and time-rescaled FALQON (TR-FALQON). Numerical results show that both variants improve convergence to the ground state and increase success probabilities at reduced circuit depths. These findings indicate that enhanced feedback-driven dynamics are effective for solving combinatorial problems on near-term quantum hardware.

quant-pharXiv:2602.21080•Feb 25, 2026•2 citations

Feedback-based quantum strategies for constrained combinatorial optimization problems

Salahuddin Abdul Rahman, Özkan Karabacak, Rafał Wiśniewski

Feedback-based quantum algorithms have recently emerged as potential methods for approximating the ground states of Hamiltonians . One such algorithm, the feedback-based algorithm for quantum optimization (FALQON), is specifically designed to solve quadratic unconstrained binary optimization problems. Its extension, the feedback-based algorithm for quantum optimization with constraints (FALQON-C), was introduced to handle constrained optimization problems with equality and inequality constraints . In this work, we extend the feedback-based quantum algorithms framework to address a broader class of constraints known as invalid configuration (IC) constraints, which explicitly prohibit specific configurations of decision variables. We first present a transformation technique that converts the constrained optimization problem with invalid configuration constraints into an equivalent unconstrained problem by incorporating a penalizing term into the cost function. Then, leaning upon control theory, we propose an alternative method tailored for feedback-based quantum algorithms that directly tackles IC constraints without requiring slack variables. Our approach introduces a new operator that encodes the optimal feasible solution of the constrained optimization problem as its ground state. Then, a controlled quantum system based on the Lyapunov control technique is designed to ensure convergence to the ground state of this operator. Two approaches are introduced in the design of this operator to address IC constraints: the folded spectrum approach and the deflation approach. These methods eliminate the need for slack variables, significantly reducing the quantum circuit depth and the number of qubits required. We show the effectiveness of our proposed algorithms through numerical simulations.

arXiv:2502.14369•Future Generation Computer Systems•Jul 7, 2025•3 citations

Feedback-based optimally controlled quantum states

Lucas T. Brady, Stuart Hadfield

Quantum optimization, for both classical and quantum functions, is one of the most well-studied applications of quantum computing, but recent trends have relied on hybrid methods that push much of the fine-tuning off onto costly classical algorithms. Feedback-based quantum algorithms, such as FALQON, avoid these fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. In this work we take the local greedy information collected by Lyapunov feedback control and develop an analytic framework to use it to perturbatively update previous control layers, similar to the global optimal control achievable using Pontryagin optimal control. This perturbative methodology, which we call feedback-based optimally controlled quantum states (FOCQS), can be used to improve the results of feedback-based algorithms, like FALQON, providing better convergence but still no formal guarantees of convergence. Furthermore, this perturbative method can be used to push smooth annealing-like control protocol closer to the control optimum, even providing an iterative approach, albeit with diminishing returns. In numerical testing, we show improvements in convergence and required depth due to these methods over existing quantum feedback control methods.

arXiv:2409.15426•Physical Review A•Jun 4, 2025•11 citations
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.
FALQON avoids classical variational-parameter optimization but can require deep circuits. Its second-order variant, SO-FALQON, permits larger evolution steps at the cost of additional observable measurements. This paper asks whether comparable depth reduction is possible with lower measurement overhead.
BLS-FALQON retains first-order commutator feedback and monitors the problem energy. When a layer increases the energy, it repeatedly rescales that layer’s control coefficient by τ∈(−1,0)\tau\in(-1,0)τ∈(−1,0), reversing its sign and reducing its magnitude until the energy decreases. Experiments use τ=−1/4\tau=-1/4τ=−1/4. Theoretical arguments give finite-backtracking bounds under assumptions about higher-order errors or a quadratic energy landscape; they do not establish convergence to the global optimum.
Simulations benchmark 274 unweighted 3-regular Max-Cut instances with 8–20 vertices, using 1,024 shots per measurement basis. To reach approximation ratio 0.9320.9320.932, BLS-FALQON uses 37.7% fewer total measurement bases than SO-FALQON while requiring 2.5% more layers. Relative to original FALQON, the reported reductions are 88.1% in measurement bases and approximately 90.9% in layers.
Hardware tests use 4-, 6-, and 8-qubit instances, ten layers, and twenty runs per algorithm. Estimated execution time is about 43% lower than SO-FALQON. Hardware measurements supply feedback, but reported approximation ratios are evaluated by exact simulation using the resulting controls, rather than directly from hardware output states. The paper reports increasing discrepancies from ideal trajectories with problem size and little improvement beyond roughly five layers; hardware tests do not reach the target approximation ratio.
Feedback-based quantum algorithms recently gained attention by demonstrating how quantum computers can be used to solve optimization problems without resorting to hybrid quantum-classical architectures. Recent progress made with Feedback-based Algorithm for Quantum Optimization (FALQON) variants significantly reduced the depth of the required circuits. In this work, we merge the time-rescaled and second-order FALQON variants into a unified framework. The results show an important improvement over past modifications, reducing circuit depth and allowing a more flexible choice of time-steps, while maintaining stable solutions. This FALQON variant makes it suitable for the NISQ era.
Combinatorial optimization problems are one of the areas where near-term noisy quantum computers may have practical advantage against classical computers. Recently, a feedback-based quantum optimization algorithm has been proposed by Magann , . The method explicitly determines quantum circuit parameters by feeding back measurement results thus avoids classical parameter optimization that is known to cause significant trouble in quantum approximate optimization algorithm, the well-studied near-term algorithm. Meanwhile, a significant drawback of the feedback-based quantum optimization is that it requires deep circuits, rendering the method unsuitable to noisy quantum devices. In this study we propose a feedback law for parameter determination by introducing the second-order approximation with respect to time interval, a hyperparameter in the feedback-based quantum optimization. This allows one to take larger time interval, leading to acceleration of convergence to solutions. In numerical simulations on the maximum cut problem we demonstrate that our proposal significantly reduces circuit depth, with its linear scaling with the problem size smaller by more than an order of magnitude. We expect that the feedback law proposed in this work may pave the way for feedback-based quantum optimization with near-term noisy quantum computers.
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.
Reconstructing DNA sequences without a reference, known as de novo assembly, is a complex computational task involving the alignment of overlapping fragments. To address this problem, a usual strategy is to map the assembly to a Quadratic Unconstrained Binary Optimization (QUBO) formulation, which can be solved by different quantum algorithms. In this work, we focus on three versions of the Feedback-based Algorithm, a protocol that eliminates classical optimization loops via measurement feedback. We analyze long-read DNA fragments from SARS-CoV-2 and human mitochondrial DNA using standard FALQON, second-order FALQON (SO-FALQON), and time-rescaled FALQON (TR-FALQON). Numerical results show that both variants improve convergence to the ground state and increase success probabilities at reduced circuit depths. These findings indicate that enhanced feedback-driven dynamics are effective for solving combinatorial problems on near-term quantum hardware.
Feedback-based quantum algorithms have recently emerged as potential methods for approximating the ground states of Hamiltonians . One such algorithm, the feedback-based algorithm for quantum optimization (FALQON), is specifically designed to solve quadratic unconstrained binary optimization problems. Its extension, the feedback-based algorithm for quantum optimization with constraints (FALQON-C), was introduced to handle constrained optimization problems with equality and inequality constraints . In this work, we extend the feedback-based quantum algorithms framework to address a broader class of constraints known as invalid configuration (IC) constraints, which explicitly prohibit specific configurations of decision variables. We first present a transformation technique that converts the constrained optimization problem with invalid configuration constraints into an equivalent unconstrained problem by incorporating a penalizing term into the cost function. Then, leaning upon control theory, we propose an alternative method tailored for feedback-based quantum algorithms that directly tackles IC constraints without requiring slack variables. Our approach introduces a new operator that encodes the optimal feasible solution of the constrained optimization problem as its ground state. Then, a controlled quantum system based on the Lyapunov control technique is designed to ensure convergence to the ground state of this operator. Two approaches are introduced in the design of this operator to address IC constraints: the folded spectrum approach and the deflation approach. These methods eliminate the need for slack variables, significantly reducing the quantum circuit depth and the number of qubits required. We show the effectiveness of our proposed algorithms through numerical simulations.
Quantum optimization, for both classical and quantum functions, is one of the most well-studied applications of quantum computing, but recent trends have relied on hybrid methods that push much of the fine-tuning off onto costly classical algorithms. Feedback-based quantum algorithms, such as FALQON, avoid these fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. In this work we take the local greedy information collected by Lyapunov feedback control and develop an analytic framework to use it to perturbatively update previous control layers, similar to the global optimal control achievable using Pontryagin optimal control. This perturbative methodology, which we call feedback-based optimally controlled quantum states (FOCQS), can be used to improve the results of feedback-based algorithms, like FALQON, providing better convergence but still no formal guarantees of convergence. Furthermore, this perturbative method can be used to push smooth annealing-like control protocol closer to the control optimum, even providing an iterative approach, albeit with diminishing returns. In numerical testing, we show improvements in convergence and required depth due to these methods over existing quantum feedback control methods.