Results 21 to 30 of about 6,260,846 (177)
A Quantum Approximate Optimization Algorithm (QAOA) Approach to Portfolio Optimization
Portfolio optimization, a core combinatorial optimization problem in quantitative finance, requires balancing return maximization and risk minimization within discrete asset sets. Classical algorithms often struggle with scalability and local optima traps when handling large-scale asset pools, limiting their practicality in dynamic markets.
Yifei Huang
openaire +2 more sources
Quantum computing has the potential to improve our ability to solve certain optimization problems that are computationally difficult for classical computers, by offering new algorithmic approaches that may provide speedups under specific conditions.
Ilya Tyagin +5 more
openaire +5 more sources
Elementary proof of QAOA convergence [PDF]
The quantum alternating operator ansatz (QAOA) and its predecessor, the quantum approximate optimization algorithm, are one of the most widely used quantum algorithms for solving combinatorial optimization problems.
Lennart Binkowski +3 more
doaj +2 more sources
Quantum approximate optimization algorithm with cat qubits [PDF]
The Quantum Approximate Optimization Algorithm (QAOA)–a prominent candidate for near-term quantum computing applications–is tailored to find approximate solutions to combinatorial optimization problems using shallow quantum circuits.
Pontus Vikstål +3 more
doaj +2 more sources
Quantum approximate optimization via learning-based adaptive optimization [PDF]
Combinatorial optimization problems are ubiquitous and computationally hard to solve in general. Quantum approximate optimization algorithm (QAOA), one of the most representative quantum-classical hybrid algorithms, is designed to solve combinatorial ...
Lixue Cheng +3 more
doaj +2 more sources
Solving the Independent Domination Problem by the Quantum Approximate Optimization Algorithm [PDF]
In the wake of quantum computing advancements and quantum algorithmic progress, quantum algorithms are increasingly being employed to address a myriad of combinatorial optimization problems.
Haoqian Pan, Changhong Lu
doaj +2 more sources
Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment [PDF]
In the present Noisy Intermediate-Scale Quantum (NISQ), hybrid algorithms that leverage classical resources to reduce quantum costs are particularly appealing. We formulate and apply such a hybrid quantum-classical algorithm to a power system optimization problem called Unit Commitment, which aims to satisfy a target power load at minimal cost.
Samantha Koretsky +10 more
openaire +3 more sources
Counterdiabaticity and the quantum approximate optimization algorithm [PDF]
The quantum approximate optimization algorithm (QAOA) is a near-term hybrid algorithm intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made to mimic an adiabatic schedule, and in the $p\to\infty$ limit the final state is
Jonathan Wurtz, Peter J. Love
doaj +1 more source
BHT-QAOA: Generalizing Quantum Approximate Optimization Algorithm to Solve Arbitrary Boolean Problems as Hamiltonians [PDF]
A new methodology is proposed to solve classical Boolean problems as Hamiltonians, using the quantum approximate optimization algorithm (QAOA). Our methodology successfully finds all optimized approximated solutions for Boolean problems, after converting them from Boolean oracles (in different structures) into Phase oracles, and then into the ...
Al-Bayaty, Ali, Perkowski, Marek
openaire +3 more sources
A Review on Quantum Approximate Optimization Algorithm and its Variants [PDF]
The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve combinatorial optimization problems that are classically intractable. This comprehensive review offers an overview of the current
Pandya, Komal +6 more
core +1 more source

