2 papers
cond-mat.dis-nn2025
Beyond-mean-field fluctuations for the solution of constraint satisfaction problems
Niklas Foos, Bastian Epping, Jannik Grundler +5
Constraint Satisfaction Problems (CSPs) lie at the heart of complexity theory and find application in a plethora of prominent tasks ranging from cryptography to genetics. Classical…
quant-ph2024
Limitations of Quantum Approximate Optimization in Solving Generic Higher-Order Constraint-Satisfaction Problems
Thorge Müller, Ajainderpal Singh, Frank K. Wilhelm +1
The ability of the Quantum Approximate Optimization Algorithm (QAOA) to deliver a quantum advantage on combinatorial optimization problems is still unclear. Recently, a scaling adv…