Results 71 to 80 of about 429 (149)
Portfolio optimization under strict cardinality constraints is a combinatorial challenge that defies classical convex optimization techniques, particularly in the context of "Direct Indexing" and ESG-constrained mandates. In the Noisy Intermediate-Scale Quantum (NISQ) era, the Quantum Approximate Optimization Algorithm (QAOA) offers a promising hybrid ...
Mancilla, Javier +2 more
openaire +2 more sources
A Comparative Study on Solving Optimization Problems With Exponentially Fewer Qubits
Variational quantum optimization algorithms, such as the variational quantum eigensolver (VQE) or the quantum approximate optimization algorithm (QAOA), are among the most studied quantum algorithms.
David Winderl +2 more
doaj +1 more source
An improved QAOA algorithm based on multi-angle and RY-assisted structure
The standard quantum approximate optimization algorithm (QAOA) has a limited expressive power in shallow circuits, whereas naively increasing the number of layers leads to greater quantum circuit depth and higher noise sensitivity.
Tian-Yu Ye, Peng-Hui Ma, Zhi-Gang Gan
doaj
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
One of the most prominent application areas for quantum computers is solving hard constraint satisfaction and optimization problems. However, detailed analyses of the complexity of standard quantum algorithms have suggested that outperforming classical ...
Sami Boulebnane, Ashley Montanaro
doaj +1 more source
A Variational Qubit-Efficient MaxCut Heuristic Algorithm
MaxCut is a key NP-hard combinatorial optimization problem. Quantum computing offers methods to solve such problems potentially better than classical counterparts, with the Quantum Approximate Optimization Algorithm (QAOA) being a state-of-the-art ...
Yovav Tene-Cohen +3 more
doaj +1 more source
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for solving combinatorial optimization problems on near-term quantum hardware.
Kimchhor Chiv +5 more
doaj +1 more source
The quantum approximate optimization algorithm (QAOA) was originally proposed to find approximate solutions to combinatorial optimization problems on quantum computers. However, the algorithm has also attracted interest for sampling purposes since it was
Pablo Díez-Valle +2 more
doaj +1 more source
The impact of optimization approximation algorithms on the performance of the BHT-QAOA
This article investigates the performance impact of five classical optimization approximation algorithms on our previously introduced quantum search algorithm, termed the Boolean–Hamiltonians Transform for Quantum Approximate Optimization ...
Ali Al-Bayaty, Marek Perkowski
doaj +1 more source
Convergence of digitized-counterdiabatic QAOA: circuit depth versus free parameters
Recently, digitized-counterdiabatic (CD) quantum approximate optimization algorithm (QAOA) has been proposed to make QAOA converge to the solution of an optimization problem in fewer steps, inspired by Trotterized CD driving in continuous-time quantum ...
Mara Vizzuso +3 more
doaj +1 more source

