119 citations · 437 across the 16 of their papers we have counts for
17 papers · 1 filter
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…
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…
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…
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…
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…
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…
Efficient Construction of Quantum Physical Unclonable Functions with Unitary t-designs
Niraj Kumar, Rawad Mezher, Elham Kashefi
Quantum physical unclonable functions, or QPUFs, are rapidly emerging as theoretical hardware solutions to provide secure cryptographic functionalities such as key-exchange, messag…
Variational Quantum Cloning: Improving Practicality for Quantum Cryptanalysis
Brian Coyle, Mina Doosti, Elham Kashefi +1
Cryptanalysis on standard quantum cryptographic systems generally involves finding optimal adversarial attack strategies on the underlying protocols. The core principle of modellin…
Optimal quantum-programmable projective measurements with coherent states
Niraj Kumar, Ulysse Chabaud, Elham Kashefi +2
We consider a device which can be programmed using coherent states of light to approximate a given projective measurement on an input coherent state. We provide and discuss three p…
Quantum versus Classical Generative Modelling in Finance
Brian Coyle, Maxwell Henderson, Justin Chan Jin Le +3
Finding a concrete use case for quantum computers in the near term is still an open question, with machine learning typically touted as one of the first fields which will be impact…
Experimental demonstration of quantum advantage for NP verification with limited information
Federico Centrone, Niraj Kumar, Eleni Diamanti +1
In recent years, many computational tasks have been proposed as candidates for showing a quantum computational advantage, that is an advantage in the time needed to perform the tas…
Client-Server Identification Protocols with Quantum PUF
Mina Doosti, Niraj Kumar, Mahshid Delavar +1
Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as deleg…
Practically feasible robust quantum money with classical verification
Niraj Kumar
We introduce a private quantum money scheme with the note verification procedure based on Sampling Matching, a problem in the one-way communication complexity model introduced by K…
Experimental demonstration of quantum advantage for one-way communication complexity
Niraj Kumar, Iordanis Kerenidis, Eleni Diamanti
The goal of demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for q…
Efficient quantum communications with multiplexed coherent state fingerprints
Niraj Kumar, Eleni Diamanti, Iordanis Kerenidis
We provide the first example of a communication model and a distributed task, for which there exists a realistic quantum protocol which is asymptotically more efficient than any cl…
Nonlocality and conflicting interest games
Anna Pappa, Niraj Kumar, Thomas Lawson +4
Nonlocality enables two parties to win specific games with probabilities strictly higher than allowed by any classical theory. Nevertheless, all known such examples consider games…
Quantum Algorithm to Solve a Maze: Converting the Maze Problem into a Search Problem
Niraj Kumar, Debabrata Goswami
We propose a different methodology towards approaching a Maze problem. We convert the problem into a Quantum Search Problem (QSP), and its solutions are sought for using the iterat…