Results 41 to 50 of about 548 (174)
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
Software: 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
Вісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технологіїЗапропоновано новий квантовий алгоритм під назвою «квантово-гібридний амплітудно-стохастичний алгоритм» (QASPA), призначений для наближеного розв’язання задачі максимального розрізу графа.
Dmytro Sapozhnyk
doaj +1 more source
Quantum biology: From mechanisms to medicine
Clinical and Translational Medicine, Volume 16, Issue 5, May 2026.Quantum biology across systems: from mechanisms to medicine. This graphical abstract highlights how quantum phenomena‐coherence, tunnelling and spin dynamics‐shape fundamental biological processes and point towards quantum‐informed medicine. In photosynthesis, quantum coherence supports near‐lossless exciton transport across pigment–protein complexes ...
Ji‐Yong Sung, Jae‐Ho Cheong
wiley +1 more source
Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation [PDF]
QuantumThe 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
Scaling quantum approximate optimization on near-term hardware
Scientific 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
Iterative Quantum Feature Maps
Advanced Quantum Technologies, Volume 9, Issue 5, May 2026.We propose Iterative Quantum Feature Maps (IQFMs), a hybrid quantum–classical framework that constructs a deep architecture by iteratively connecting shallow quantum feature maps with classically computed augmentation weights. By incorporating contrastive learning and a layer‐wise training mechanism, the IQFMs framework effectively reduces quantum ...
Nasa Matsumoto +4 more
wiley +1 more source
Restricted global optimization for QAOA
APL QuantumThe 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
End‐to‐End Portfolio Optimization with Hybrid Quantum Annealing
Advanced Quantum Technologies, Volume 9, Issue 4, April 2026.This works presents a hybrid quantum‐classical framework for portfolio optimization that combines quantum assisted asset selection and rebalancing with classical weight allocation. The approach processes real market data, embeds it into Quadratic Unconstrained Binary Optimization formulations, and evaluates performance within a unified workflow ...
Sai Nandan Morapakula +5 more
wiley +1 more source
Hamiltonian-Oriented Homotopy QAOA
, 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
Qubit‐Efficient Quantum Local Search for Combinatorial Optimization
Advanced Quantum Technologies, Volume 9, Issue 3, March 2026.We introduce a qubit‐efficient variational quantum algorithm for combinatorial optimization that adaptively uses from logarithmic to a linear number of qubits to implement quantum local search. The method encodes flip probabilities of spin groups into quantum amplitudes, enabling exploration of classically intractable neighborhoods while maintaining ...
Mikhail Podobrii +4 more
wiley +1 more source