Results 41 to 50 of about 605 (179)
The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems.
Linghua Zhu +6 more
doaj +1 more source
Similarity-based parameter transferability in the quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization.
Alexey Galda +10 more
doaj +1 more source
A frustrated 4×4$4\times 4$ J1−J2$J_{1}-J_{2}$ Ising model is examined using QAOA, exact calculations, and IonQ hardware benchmarks. Frustration and near‐degeneracy suppress finite‐depth ground‐state sampling, requiring deeper circuits for improved performance. Ideal simulations show systematic improvement with QAOA depth, whereas noisy hardware limits
Seunghan Lee, Hunpyo Lee
wiley +1 more source
Multi-angle quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution.
Rebekah Herrman +4 more
doaj +1 more source
Conceptual framework of physics‐guided hybrid quantum–classical machine learning for hydrological simulation, highlighting the opportunities and limitations of quantum computing and its integration with classical machine learning and mass‐balance physics.
Vidya Samadi
wiley +1 more source
Simulating QAOA operation using Cirq and qsim quantum frameworks
The problem of finding the lowest-energy state in the Ising model with a longitudinal magnetic field is studied for two- and three-dimensional lattices of various sizes using the Quantum Approximate Optimization Algorithm (QAOA).
Yuri G. Palii +2 more
doaj +1 more source
This work investigates the optimal initial data size for surrogate‐based active learning in functional material optimization. Using factorization machine (FM)‐based quadratic unconstrained binary optimization (QUBO) surrogates and averaged piecewise linear regression, we show that adequate initial data accelerates convergence, enhances efficiency, and ...
Seongmin Kim, In‐Saeng Suh
wiley +1 more source
Запропоновано новий квантовий алгоритм під назвою «квантово-гібридний амплітудно-стохастичний алгоритм» (QASPA), призначений для наближеного розв’язання задачі максимального розрізу графа.
Dmytro Sapozhnyk
doaj +1 more source
ABSTRACT Quantum annealing is emerging as a practical tool for large‐scale combinatorial optimization. We map continuum displacements and element densities to binary variables, turning both deformation analysis and topology optimization into quadratic unconstrained binary optimization (QUBO) problems that run on today's annealers.
Rio Honda +5 more
wiley +1 more source
Reinforcement learning assisted recursive QAOA
AbstractIn recent years, variational quantum algorithms such as the Quantum Approximation Optimization Algorithm (QAOA) have gained popularity as they provide the hope of using NISQ devices to tackle hard combinatorial optimization problems. It is, however, known that at low depth, certain locality constraints of QAOA limit its performance.
Patel, Y.J. +3 more
openaire +5 more sources

