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.21640

Time rescaling for second-order feedback-based quantum optimization

Leticia Bertuzzi, João P. Engster, Evandro C. R. da Rosa, Eduardo I. Duzzioni

quant-phSubmitted Sep 18, 2026• Announced Sep 21, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether combining time rescaling with second-order feedback can reduce the circuit depth of the Feedback-based Algorithm for Quantum Optimization (FALQON), without introducing a classical parameter-optimization loop. The proposed TR-Hy-FALQON replaces the fixed step in second-order FALQON with an effective step $h_k=\dot f_k\Delta\tau$. Its feedback law is $\beta_k=-(A_{k-1}+h_k C_{k-1})/(2h_k B_{k-1})$, where $A,B,C$ are measured commutator expectations. A hybrid rule incorporates first-order feedback to handle problematic second-order updates. Evidence comes from numerical MaxCut simulations on 30 random instances each of 12-vertex 3-regular graphs and 14-vertex Erdős–Rényi graphs with edge probability $0.3$. Using time-rescaling factor $a=2$, the combined method reaches the reference approximation ratios $0.932$ and $0.878$ after 19 and 13 layers, respectively, compared with 32 and 19 for second-order FALQON. At layer 40, average approximation ratios are $0.968$ and $0.966$, versus $0.955$ and $0.964$ for second-order FALQON. QAOA reaches the reference thresholds in 5 and 3 layers, with layer-40 averages of $0.953$ and $0.948$. Time steps are selected numerically for the proposed method. The paper notes that convergence can be nonmonotonic even at small steps, so its stability criterion does not require monotonic energy decrease. Second-order feedback requires additional measurements; the sampling-overhead assessment relies on prior work. The reported tests are small-system simulations rather than hardware demonstrations.

Little sign of AI-generated textIncrementalSmall numerics onlyOverclaims

Error found: The demonstrated depth reductions are empirical results for 12- and 14-qubit graph instances, not evidence of general scaling improvements. The combined algorithm's stability is assessed empirically under a criterion that permits nonmonotonic trajectories, rather than established by a convergence guarantee. The claim of NISQ suitability is not established by the noiseless simulations and lacks a quantitative finite-shot or noisy-device resource assessment. The stated signed-minimum hybrid update can select an energy-increasing second-order stationary point when B<0, unless an additional curvature guard overrides it. The second-order feedback minimizes the quadratic energy-change model for B>0, contrary to the text's description of maximizing it.

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

Comments
7 pages, 4 figures, 2 tables

Related papers

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

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 optimization and its classical counterpart: quantum advantage and the power of classical algorithms

Tomohiro Hattori, Takuya Hatomura

Feedback-based quantum optimization is a quantum approach to combinatorial optimization. In this paper, we introduce the classical counterpart of feedback-based quantum optimization by using the quantum-classical correspondence of spin systems to discuss the possibility of quantum advantage. It also enables us to develop higher-order theory of a previously proposed classical approach to feedback-based quantum optimization. First, we compare the feedback-based algorithm for quantum optimization (FALQON) and its variant with their classical counterparts. Then, we perform benchmark tests of various quantum and classical algorithms with small-scale instances, and of classical algorithms with large-scale instances. Main findings are that (i) quantum algorithms can be advantageous to classical algorithms in terms of the quality of solutions, while classical algorithms tend to show faster convergence than quantum ones, and (ii) one of the classical algorithms discussed in this paper shows significant scalability for higher-order unconstrained binary optimization problems. These findings highlight the importance of quantumness and the usefulness of classical approaches.

quant-pharXiv:2605.13082•May 14, 2026•0 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

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
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.
The paper asks whether combining time rescaling with second-order feedback can reduce the circuit depth of the Feedback-based Algorithm for Quantum Optimization (FALQON), without introducing a classical parameter-optimization loop. The proposed TR-Hy-FALQON replaces the fixed step in second-order FALQON with an effective step hk=f˙kΔτh_k=\dot f_k\Delta\tauhk​=f˙​k​Δτ. Its feedback law is βk=−(Ak−1+hkCk−1)/(2hkBk−1)\beta_k=-(A_{k-1}+h_k C_{k-1})/(2h_k B_{k-1})βk​=−(Ak−1​+hk​Ck−1​)/(2hk​Bk−1​), where A,B,CA,B,CA,B,C are measured commutator expectations. A hybrid rule incorporates first-order feedback to handle problematic second-order updates.
Evidence comes from numerical MaxCut simulations on 30 random instances each of 12-vertex 3-regular graphs and 14-vertex Erdős–Rényi graphs with edge probability 0.30.30.3. Using time-rescaling factor a=2a=2a=2, the combined method reaches the reference approximation ratios 0.9320.9320.932 and 0.8780.8780.878 after 19 and 13 layers, respectively, compared with 32 and 19 for second-order FALQON. At layer 40, average approximation ratios are 0.9680.9680.968 and 0.9660.9660.966, versus 0.9550.9550.955 and 0.9640.9640.964 for second-order FALQON. QAOA reaches the reference thresholds in 5 and 3 layers, with layer-40 averages of 0.9530.9530.953 and 0.9480.9480.948.
Time steps are selected numerically for the proposed method. The paper notes that convergence can be nonmonotonic even at small steps, so its stability criterion does not require monotonic energy decrease. Second-order feedback requires additional measurements; the sampling-overhead assessment relies on prior work. The reported tests are small-system simulations rather than hardware demonstrations.
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.
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 optimization is a quantum approach to combinatorial optimization. In this paper, we introduce the classical counterpart of feedback-based quantum optimization by using the quantum-classical correspondence of spin systems to discuss the possibility of quantum advantage. It also enables us to develop higher-order theory of a previously proposed classical approach to feedback-based quantum optimization. First, we compare the feedback-based algorithm for quantum optimization (FALQON) and its variant with their classical counterparts. Then, we perform benchmark tests of various quantum and classical algorithms with small-scale instances, and of classical algorithms with large-scale instances. Main findings are that (i) quantum algorithms can be advantageous to classical algorithms in terms of the quality of solutions, while classical algorithms tend to show faster convergence than quantum ones, and (ii) one of the classical algorithms discussed in this paper shows significant scalability for higher-order unconstrained binary optimization problems. These findings highlight the importance of quantumness and the usefulness of classical approaches.
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.
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.