The time-rescaled and second-order FALQON variants are merged into a unified framework, showing an important improvement over past modifications, reducing circuit depth and allowing a more flexible choice of time-steps, while maintaining stable solutions.
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.
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), achie...
Zi-Wen Huang, Jia-Cheng Fan, Xiao-Hui Ni et al.· 0 citations
Quantum simulation is a rapidly advancing field poised to revolutionize our understanding of complex quantum systems by harnessing the unique capabilities of quantum computers. In this review, we present a concise overview of key developments in quantum simulation algorithms, with a focus on time-independent digital Ha...
Yue Wang, Wen-Jun Yu, Tian-Feng Feng et al.· Frontiers of Computer Scienc...· 0 citations
This work shows that for a broad class of combinatorial optimization problems and commonly used rotational gate parameterizations, the measurement cost of DQAS can be significantly reduced without changing the optimization objective.
Lukas Theißinger, Thore Gerlach, Christian Bauckhage· 0 citations
This thesis investigates two central challenges for quantum computing: identifying when quantum annealing can offer a computational advantage, and developing effective methods to control realistic quantum systems. It establishes complexity bounds for an adiabatic algorithm for combinatorial optimization, showing a univ...
In variational quantum optimization methods, the manner in which classical data are embedded into the quantum circuit significantly influences the representational capacity and solution behavior of the model. In the literature, this aspect is generally considered a secondary component. In this study, the effect of a th...
S. Güngör, M. Karakose· Automation, Control, and Inf...· 0 citations
Quantum automated learning (QAL) trains quantum models by directly updating quantum states, offering an approach to quantum machine learning that avoids optimizing variational circuit parameters. However, post-selection constrains the probability of obtaining the final learned model. We develop a post-selection-free QA...
Jun-Kai Wang, Jin-Peng Liu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.