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

Springer eBooks

Quantum Optimization Techniques

Jesse Van Griensven Thé, Roydon Andrew Fraser, José R. Rosas-Bustos

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-3-031-98245-3_6

Related papers

Quantum optimization techniques and applications

Euimin Lee, Shiho Kim

Advances in computers•Jul 23, 2025•1 citation

Quantum Optimization Techniques and It’s Comparison with Classical Optimization

Pooja P. Kadam, Sachin Kadam

Lecture notes in networks and systems•Jan 1, 2023•1 citation

Quantum Optimization Heuristics with an Application to Knapsack Problems

Wim van Dam, Karim Eldefrawy, Nicholas Genise +1 more

This paper introduces two techniques that make the standard Quantum Approximate Optimization Algorithm (QAOA) more suitable for constrained optimization problems. The first technique describes how to use the outcome of a prior greedy classical algorithm to define an initial quantum state and mixing operation to adjust the quantum optimization algorithm to explore the possible answers around this initial greedy solution. The second technique is used to nudge the quantum exploration to avoid the local minima around the greedy solutions. To analyze the benefits of these two techniques we run the quantum algorithm on known hard instances of the Knapsack Problem using unit depth quantum circuits. The results show that the adjusted quantum optimization heuristics typically perform better than various classical heuristics.

arXiv:2108.08805•IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•31 citations

Optimization Using Quantum Algorithms

Kolla Bhanu Prakash

Wiley eBooks•Aug 17, 2026•0 citations

Quantum optimization

Tad Hogg, Dmitriy Portnov

arXiv:quant-ph/0006090•Information Sciences•Oct 1, 2000•137 citations

Quantum Optimization for Enhanced Combinatorial Algorithms

Pradeep Kumar Pandey, Ruchi Chaturvedi, Suraj Bhan Dangi

The twenty-first century has been the era of data. Algorithms are crucial in tasks ranging from simple document searches to complex batching and scheduling jobs. Optimization techniques are often applied to enhance algorithms and achieve better results. As Moore rightly predicted, the exponential increase in transistors has led to a point where classical computers can no longer solve specific problems within a human timeframe. This paved the way for the development of quantum computers, which utilize quantum phenomena to solve problems. Quantum optimization techniques and algorithms have been designed to leverage the quantum advantage for improved optimization. This research compares and presents the results of quantum optimization techniques applied to classic combinatorial algorithms.

The Nucleus•Jun 3, 2025•0 citations
This paper introduces two techniques that make the standard Quantum Approximate Optimization Algorithm (QAOA) more suitable for constrained optimization problems. The first technique describes how to use the outcome of a prior greedy classical algorithm to define an initial quantum state and mixing operation to adjust the quantum optimization algorithm to explore the possible answers around this initial greedy solution. The second technique is used to nudge the quantum exploration to avoid the local minima around the greedy solutions. To analyze the benefits of these two techniques we run the quantum algorithm on known hard instances of the Knapsack Problem using unit depth quantum circuits. The results show that the adjusted quantum optimization heuristics typically perform better than various classical heuristics.
The twenty-first century has been the era of data. Algorithms are crucial in tasks ranging from simple document searches to complex batching and scheduling jobs. Optimization techniques are often applied to enhance algorithms and achieve better results. As Moore rightly predicted, the exponential increase in transistors has led to a point where classical computers can no longer solve specific problems within a human timeframe. This paved the way for the development of quantum computers, which utilize quantum phenomena to solve problems. Quantum optimization techniques and algorithms have been designed to leverage the quantum advantage for improved optimization. This research compares and presents the results of quantum optimization techniques applied to classic combinatorial algorithms.