Feedback-based quantum optimization and its classical counterpart: quantum advantage and the power of classical algorithms

• URL: http://arxiv.org/abs/2605.13082v1
• Date: Wed, 13 May 2026 06:54:28 GMT
• Title: Feedback-based quantum optimization and its classical counterpart: quantum advantage and the power of classical algorithms
• Abstract summary: We develop higher-order theory of a previously proposed classical approach to feedback-based quantum optimization.<n>Main findings are that quantum algorithms can be advantageous to classical algorithms in terms of the quality of solutions.<n>One of the classical algorithms discussed in this paper shows significant scalability for higher-order unconstrained binary optimization problems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Multi-Objective Optimization by Quantum-Annealing-Inspired Algorithms [0.0]
  Gate-based quantum circuits and quantum annealers can outperform state-of-the-art classical optimizations on multi-objective problems.<n>We re-examine the same benchmark suite using GPU-based quantum-annealing-inspired algorithms (QAIAs)<n>Our results show that QAIAs can sample candidate solutions approximately two orders of magnitude faster than previously studied quantum processors.
  arXiv  Detail & Related papers  (2026-04-29T09:41:01Z)
• Methods for non-variational heuristic quantum optimisation [0.5586191108738564]
  We introduce a novel class of quantum optimisations that forgo this variational framework in favour of a hybrid quantum-classical approach.<n>These algorithms are expected to exhibit inherent robustness to noise and support parallel execution across both quantum and classical resources.
  arXiv  Detail & Related papers  (2026-02-01T17:46:57Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Classical algorithm inspired by the feedback-based algorithm for quantum optimization and local counterdiabatic driving [0.0]
  We propose a quantum-inspired classical algorithm for optimization problems, named the counterbaticity-assisted classical algorithm for optimization (CACAO)<n>In this algorithm, a solution of a given optimization problem isally searched with classical spin dynamics based on quantum Lynov control of local counterdiabatic driving.<n>We compare the performance of CACAO with that of quantum timeevolution algorithms, i.e., quantum annealing, the feedback-based algorithm for quantum optimization (known as FALQON) and the counterdiabatic feedback-based quantum algorithm (known as CD-FQA)
  arXiv  Detail & Related papers  (2025-06-10T20:16:44Z)
• Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational Quantum Systems [65.268245109828]
  We compare the performance of classicals across a series of partially-randomized tasks. We focus on local zeroth-orders due to their generally favorable performance and query-efficiency on quantum systems.
  arXiv  Detail & Related papers  (2023-10-14T02:13:26Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• A quantum advantage over classical for local max cut [48.02822142773719]
  Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
  arXiv  Detail & Related papers  (2023-04-17T16:42:05Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Quantum version of the k-NN classifier based on a quantum sorting algorithm [0.0]
  We develop a new quantum version of the classical machine learning algorithm known as k-nearest neighbors (k-NN) Both the efficiency and performance of this new quantum version of the k-NN algorithm are compared to those of the classical k-NN and another quantum version proposed by Schuld et al.
  arXiv  Detail & Related papers  (2022-04-07T22:31:01Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.