activity
20132026
most citedEvidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem

119 citations · 437 across the 16 of their papers we have counts for

collaborators

17 papers

quant-ph2026

Experimental demonstration of quantum advantage in communication complexity for Euclidean distance problem

Verena Yacoub, Niraj Kumar, Iordanis Kerenidis +1

When considering the complexity of communication protocols, the aim is to perform a certain task with the minimum amount of communication resources, such as time and transmitted in…

quant-ph2023★ 119 cited

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem

Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti +26

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tac…

quant-ph2023★ 31 cited

Hardness of the Maximum Independent Set Problem on Unit-Disk Graphs and Prospects for Quantum Speedups

Ruben S. Andrist, Martin J. A. Schuetz, Pierre Minssen +9

Rydberg atom arrays are among the leading contenders for the demonstration of quantum speedups. Motivated by recent experiments with up to 289 qubits [Ebadi et al., Science 376, 12…

quant-ph2022★ 22 cited

Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection

Christa Zoufal, Ryan V. Mishmash, Nitin Sharma +6

We introduce a variational quantum algorithm to solve unconstrained black box binary optimization problems, i.e., problems in which the objective function is given as black box. Th…

quant-ph2021★ 51 cited

Graph neural network initialisation of quantum approximate optimisation

Nishant Jain, Brian Coyle, Elham Kashefi +1

Approximate combinatorial optimisation has emerged as one of the most promising application areas for quantum computers, particularly those in the near term. In this work, we focus…

quant-ph2021

On the Connection Between Quantum Pseudorandomness and Quantum Hardware Assumptions

Mina Doosti, Niraj Kumar, Elham Kashefi +1

This paper, for the first time, addresses the questions related to the connections between the quantum pseudorandomness and quantum hardware assumptions, specifically quantum physi…