Results 71 to 80 of about 4,386 (222)
Engineering Reports, Volume 8, Issue 2, February 2026.Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source
Вісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технологіїЗапропоновано новий квантовий алгоритм під назвою «квантово-гібридний амплітудно-стохастичний алгоритм» (QASPA), призначений для наближеного розв’язання задачі максимального розрізу графа.
Dmytro Sapozhnyk
doaj +1 more source
Dynamic-ADAPT-QAOA: An algorithm with shallow and noise-resilient circuits [PDF]
, 2023 Nikola Yanakiev +3 more
openalex +1 more source
Enhancing Distributed State Estimation of Power Grid With a Simplified Quantum Algorithm
IET Generation, Transmission &Distribution, Volume 20, Issue 1, January/December 2026.This paper presents the application of the Harrow‐Hassidim‐Lloyd (HHL) algorithm and its simplified quantum circuit to distributed state estimation in power grids. The results show that the proposed approach successfully tackles distributed state estimation in a power grid, underscoring its potential as a practical quantum computing solution for this ...
Shyh‐Jier Huang +3 more
wiley +1 more source
Quantum approximate optimization algorithms for maximum cut on low-girth graphs
Physical Review ResearchMaximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the quantum approximate optimization algorithm (QAOA) for solving the MaxCut problem.
Tongyang Li +3 more
doaj +1 more source
Simulating QAOA operation using Cirq and qsim quantum frameworks
Discrete and Continuous Models and Applied Computational ScienceThe 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
Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm [PDF]
QuantumWe consider the maximum cut and maximum independent set problems on random regular graphs in the infinite-size limit, and calculate the energy densities achieved by QAOA for high degrees up to $d=100$.
Elisabeth Wybo, Martin Leib
doaj +1 more source
Multi-Angle QAOA Does Not Always Need All Its Angles [PDF]
, 2022 Kaiyan Shi +5 more
openalex +1 more source
IET Software, Volume 2026, Issue 1, 2026.Quantum computing is one of the research areas progressing rapidly toward practical deployment, yet the engineering of scalable and reliable quantum software remains underdeveloped. Current quantum software engineering (QSE) practices are largely tools‐driven and ad hoc that providing limited support for managing probabilistic execution, hybrid quantum–
Hessa Alfraihi +7 more
wiley +1 more source
Quantifying the Efficiency of State Preparation via Quantum Variational Eigensolvers
PRX Quantum, 2021 Recently, there has been much interest in the efficient preparation of complex quantum states using low-depth quantum circuits, such as the quantum approximate optimization algorithm (QAOA).
Gabriel Matos +2 more
doaj +1 more source