3 papers
quant-ph2026
Design and Analysis of an Improved Constrained Hypercube Mixer in Quantum Approximate Optimization Algorithm
Arkadiusz WoÅk, Karol CapaÅa, Katarzyna Rycerz
The Quantum Approximate Optimization Algorithm (QAOA) is expected to offer advantages over classical approaches when solving combinatorial optimization problems in the Noisy Interm…
physics.soc-ph2026
Modularity maximization and community detection in complex networks through recursive and hierarchical annealing in the D-Wave Advantage quantum processing units
Joan Falcó-Roget, Kacper Jurek, Barbara Wojtarowicz +2
Quantum adiabatic optimization has long been expected to outperform classical methods in solving NP-type problems. While this has been proven in certain experiments, its main appli…
cs.DC2025
Workflow decomposition algorithm for scheduling with quantum annealer-based hybrid solver
Marcin Kroczek, Justyna Zawalska, Katarzyna Rycerz
We introduce the Series-Parallel Workflow Decomposition (SP\-WD) heuristic algorithm for the Workflow Scheduling Problem (WSP) decomposition. We demonstrate that the SPWD algorithm…