Results 51 to 60 of about 605 (179)

Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions

open access: yesScientific Reports
Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm to solve combinatorial optimization problems in the era of noisy intermediate-scale quantum computers.
Ken N. Okada   +3 more
doaj   +1 more source

Fundamental Challenges, Physical Implementations, and Integration Strategies for Ising Machines in Large‐Scale Optimization Tasks

open access: yesAdvanced Electronic Materials, Volume 12, Issue 17, 7 September 2026.
Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley   +1 more source

Restricted global optimization for QAOA

open access: yesAPL Quantum
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising variational quantum algorithm for addressing NP-hard combinatorial optimization problems. However, a significant limitation lies in optimizing its classical parameters, which is in itself an NP-hard problem.
Peter Gleißner   +2 more
openaire   +3 more sources

Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation [PDF]

open access: yesQuantum
The Quantum Approximate Optimisation Algorithm (QAOA) is a widely studied quantum-classical iterative heuristic for combinatorial optimisation. While QAOA targets problems in complexity class NP, the classical optimisation procedure required in every ...
Tom Krüger, Wolfgang Mauerer
doaj   +1 more source

A QUBO Formulation for Multi‐Material Topology Optimization With Quantum Annealing

open access: yesInternational Journal for Numerical Methods in Engineering, Volume 127, Issue 16, 30 August 2026.
ABSTRACT Multi‐material topology optimization (MMTO) seeks the optimal distribution of multiple materials within a given design domain to maximize structural performance. However, due to the high complexity of the solution space, MMTO problems are often trapped in local optima. To address this issue, a quantum annealing‐based MMTO framework is proposed.
Kenshin Nakano   +2 more
wiley   +1 more source

Modularity‐Preserving Hamiltonian Compression for QAOA‐Based Community Detection

open access: yesAdvanced Quantum Technologies, Volume 9, Issue 6, June 2026.
This work explores several quantum methods to community detection in networks by simplifying modularity‐based Hamiltonians. By reducing circuit complexity through sparsification, spectral projection, and penalty techniques, the methods retain key structural information while improving efficiency.
Danilo Cavaliere   +2 more
wiley   +1 more source

Hamiltonian-Oriented Homotopy QAOA

open access: yes, 2023
The classical homotopy optimization approach has the potential to deal with highly nonlinear landscape, such as the energy landscape of QAOA problems. Following this motivation, we introduce Hamiltonian-Oriented Homotopy QAOA (HOHo-QAOA), that is a heuristic method for combinatorial optimization using QAOA, based on classical homotopy optimization. The
Kundu, Akash   +2 more
openaire   +2 more sources

Scaling quantum approximate optimization on near-term hardware

open access: yesScientific Reports, 2022
The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems.
Phillip C. Lotshaw   +7 more
doaj   +1 more source

Quantum approximate optimization for hard problems in linear algebra

open access: yesSciPost Physics Core, 2021
The quantum approximate optimization algorithm (QAOA) by Farhi et al. is a quantum computational framework for solving quantum or classical optimization tasks.
Ajinkya Borle, Vincent E. Elfving, Samuel J. Lomonaco
doaj   +1 more source

A Resource Efficient Ising Model‐Based Quantum Sudoku Solver

open access: yesSoftware: Practice and Experience, Volume 56, Issue 6, Page 643-657, June 2026.
ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy