51 citations · 53 across the 4 of their papers we have counts for
4 papers
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\…
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…
Faster Quantum Concentration via Grover's Search
Cem M. Unsal, A. Yavuz Oruc
We present quantum algorithms for routing concentration assignments on full capacity fat-and-slim concentrators, bounded fat-and-slim concentrators, and regular fat-and-slim concen…
Circuit Transformations for Quantum Architectures
Andrew M. Childs, Eddie Schoute, Cem M. Unsal
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, a…