activity
20172026
most citedOn the Hardness of the Minimum Distance Problem of Quantum Codes

10 citations · 21 across the 13 of their papers we have counts for

collaborators

19 papers

quant-ph2026

Non-local games and communication complexity with noisy entanglement

Srijita Kundu, Olivier Lalonde

We study the impact of noise on the theories of quantum nonlocality and entanglement-assisted communication complexity. We consider non-local games and entanglement-assisted commun…

quant-ph2026

Quantum information advantage based on Bell inequalities

Rahul Jain, Srijita Kundu

Recently, Kretschmer et al. [KGD+25] presented an experimental demonstration of a proposed quantum information advantage protocol. We present an alternate proposal based on a relat…

quant-ph2026

Near-optimal entanglement-communication tradeoffs for remote state preparation

Srijita Kundu, Olivier Lalonde

We study the following task: Alice is given a classical description of a rank- projector on , and Alice and Bob want to prepare the quantum state on Bob'…

quant-ph2025

Non-Standard Oracles for Bounded-Error Complexity Classes

Avantika Agarwal, Srijita Kundu

In recent years, the quantum oracle model introduced by Aaronson and Kuperberg (2007) has found a lot of use in showing oracle separations between complexity classes and cryptograp…

quant-ph2025

Does there exist a quantum fingerprinting protocol without coherent measurements?

Atsuya Hasegawa, Srijita Kundu, François Le Gall +2

Buhrman, Cleve, Watrous, and de Wolf (PRL 2001) discovered the quantum fingerprinting protocol, which is the quantum SMP protocol with qubits communication for the equa…

quant-ph2024★ 1 cited

Separations in query complexity for total search problems

Shalev Ben-David, Srijita Kundu

We study the query complexity analogue of the class TFNP of total search problems. We give a way to convert partial functions to total search problems under certain settings; we al…