1 citations · 1 across the 1 of their papers we have counts for
4 papers
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…
Digital-Analog Simulations of Schrödinger Cat States in the Dicke-Ising Model
Dmitriy S. Shapiro, Yannik Weber, Tim Bode +2
The Dicke-Ising model, one of the few paradigmatic models of matter-light interaction, exhibits a superradiant quantum phase transition above a critical coupling strength. However,…
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…
Quantum combinatorial optimization beyond the variational paradigm: simple schedules for hard problems
Tim Bode, Krish Ramesh, Tobias Stollenwerk
Advances in quantum algorithms suggest a tentative scaling advantage on certain combinatorial optimization problems. Recent work, however, has also reinforced the idea that barren…