51 citations · 53 across the 4 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CC2022★ 1 cited
On the Complexity of Generalized Discrete Logarithm Problem
Cem M Unsal, Rasit Onur Topaloglu
Generalized Discrete Logarithm Problem (GDLP) is an extension of the Discrete Logarithm Problem where the goal is to find such for a given $g,y\in\…
quant-ph2022★ 1 cited
Quantum Adversarial Learning in Emulation of Monte-Carlo Methods for Max-cut Approximation: QAOA is not optimal
Cem M. Unsal, Lucas T. Brady
One of the leading candidates for near-term quantum advantage is the class of Variational Quantum Algorithms, but these algorithms suffer from classical difficulty in optimizing th…