Extrapolation method to optimize linear-ramp QAOA parameters: Evaluation of QAOA runtime scaling
14 pages, 15 ...
Dehn, Vanessa +5 more
openaire +2 more sources
Equivariant QAOA and the Duel of the Mixers
Constructing an optimal mixer for Quantum Approximate Optimization Algorithm (QAOA) Hamiltonian is crucial for enhancing the performance of QAOA in solving combinatorial optimization problems. We present a systematic methodology for constructing the QAOA tailored mixer Hamiltonian, ensuring alignment with the inherent symmetries of classical ...
Tsvelikhovskiy, Boris +2 more
openaire +2 more sources
Convergence of digitized-counterdiabatic QAOA: circuit depth versus free parameters
New Journal of PhysicsRecently, 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
A SWAP-free Framework for QAOA
The performance of the Quantum Approximate Optimization Algorithm (QAOA) on noisy intermediate-scale quantum (NISQ) devices is strongly limited by sparse qubit connectivity. When interactions required by QAOA Hamiltonians are not aligned to the hardware topology, transpilation introduces SWAP gates, increasing circuit depth and noise. We propose a SWAP-
Assis, Thiago +4 more
openaire +2 more sources
Constrained combinatorial optimization remains challenging for quantum algorithms because feasibility must be explicitly enforced, typically through penalty terms or problem-specific mixers. We introduce Partitioned-Constraint QAOA (PC-QAOA), which partitions constraints into those enforced structurally and those enforced energetically.
Wilkie, Anthony +4 more
openaire +2 more sources
Exploiting quantum chaos diagnostics in QAOA for enhanced hybrid quantum classical deep learning classification. [PDF]
Sci RepVillalba-Díez J, Losada-González JC.
europepmc +1 more source
Correctness of an application using QAOA
In this work, we analyze the Quantum Approximate Optimization Algorithm (QAOA) to solve a particular type of problem related to a graph clustering. We establish rigorous bounds for the efficiency of QAOA in the limit of a large problem.
Reittu, Hannu, Kotovirta, Ville
openaire +2 more sources
Adaptive intelligent controller for a lower limb rehabilitation robot using QAOA-based online membership optimization. [PDF]
Sci RepAbd-Elhaleem S +2 more
europepmc +1 more source
QSyncFold: quantum neural network for multidimensional sync-discovery in protein folding. [PDF]
Brief BioinformShi J +5 more
europepmc +1 more source
Prototype-Based Classifiers and Vector Quantization on a Quantum Computer-Implementing Integer Arithmetic Oracles for Nearest Prototype Search. [PDF]
Entropy (Basel)Engelsberger A +2 more
europepmc +1 more source