| Nonlocality and conflicting interest games A Pappa, N Kumar, T Lawson, M Santha, S Zhang, E Diamanti, I Kerenidis Physical review letters 114 (2), 020401, 2015 | 82 | 2015 |
| Quantum versus classical generative modelling in finance B Coyle, M Henderson, JCJ Le, N Kumar, M Paini, E Kashefi Quantum Science and Technology 6 (2), 024013, 2021 | 61 | 2021 |
| Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem R Shaydulin, C Li, S Chakrabarti, M DeCross, D Herman, N Kumar, ... Science Advances 10 (22), eadm6761, 2024 | 55 | 2024 |
| The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ans\" atze E Fontana, D Herman, S Chakrabarti, N Kumar, R Yalovetzky, J Heredge, ... arXiv preprint arXiv:2309.07902, 2023 | 54 | 2023 |
| Graph neural network initialisation of quantum approximate optimisation N Jain, B Coyle, E Kashefi, N Kumar Quantum 6, 861, 2022 | 49 | 2022 |
| Efficient quantum communications with coherent state fingerprints over multiple channels N Kumar, E Diamanti, I Kerenidis Physical Review A 95 (3), 032337, 2017 | 35 | 2017 |
| Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection C Zoufal, RV Mishmash, N Sharma, N Kumar, A Sheshadri, A Deshmukh, ... Quantum 7, 909, 2023 | 30 | 2023 |
| Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol N Kumar, I Kerenidis, E Diamanti Nature communications 10 (1), 4152, 2019 | 27 | 2019 |
| Experimental demonstration of quantum advantage for NP verification with limited information F Centrone, N Kumar, E Diamanti, I Kerenidis Nature communications 12 (1), 850, 2021 | 23 | 2021 |
| Client-server identification protocols with quantum puf M Doosti, N Kumar, M Delavar, E Kashefi ACM Transactions on Quantum Computing 2 (3), 1-40, 2021 | 21 | 2021 |
| Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedups RS Andrist, MJA Schuetz, P Minssen, R Yalovetzky, S Chakrabarti, ... Physical Review Research 5 (4), 043277, 2023 | 20 | 2023 |
| Characterizing barren plateaus in quantum ansätze with the adjoint representation E Fontana, D Herman, S Chakrabarti, N Kumar, R Yalovetzky, J Heredge, ... Nature Communications 15 (1), 7171, 2024 | 16 | 2024 |
| Practically feasible robust quantum money with classical verification N Kumar Cryptography 3 (4), 26, 2019 | 16 | 2019 |
| Progress toward practical quantum cryptanalysis by variational quantum cloning B Coyle, M Doosti, E Kashefi, N Kumar Physical Review A 105 (4), 042604, 2022 | 13 | 2022 |
| Efficient construction of quantum physical unclonable functions with unitary t-designs N Kumar, R Mezher, E Kashefi arXiv preprint arXiv:2101.05692, 2021 | 11 | 2021 |
| ``The adjoint is all you need: Characterizing barren plateaus in quantum ansätze''(2023) E Fontana, D Herman, S Chakrabarti, N Kumar, R Yalovetzky, J Heredge, ... arXiv preprint arXiv:2309.07902, 0 | 10 | |
| Privacy-preserving quantum federated learning via gradient hiding C Li, N Kumar, Z Song, S Chakrabarti, M Pistoia Quantum Science and Technology 9 (3), 035028, 2024 | 8 | 2024 |
| Variational quantum cloning: Improving practicality for quantum cryptanalysis B Coyle, M Doosti, E Kashefi, N Kumar arXiv preprint arXiv:2012.11424, 2020 | 7 | 2020 |
| Quantum algorithm to solve a maze: converting the maze problem into a search problem N Kumar, D Goswami arXiv preprint arXiv:1312.4116, 2013 | 7 | 2013 |
| Expressive variational quantum circuits provide inherent privacy in federated learning N Kumar, J Heredge, C Li, S Eloul, SH Sureshbabu, M Pistoia arXiv preprint arXiv:2309.13002, 2023 | 6 | 2023 |
Eleni DiamantiPermanent Researcher, CNRS, Université Pierre et Marie CurieVerified email at upmc.fr
