Srijita Kundu

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 28

Top Topics

Query Complexity

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Shalev Ben-David, Srijita Kundu
Oracle separation of QMA and QCMA with bounded adaptivity. CoRR (2024)
Shalev Ben-David, Srijita Kundu
Oracle Separation of QMA and QCMA with Bounded Adaptivity. ICALP (2024)
Atsuya Hasegawa, Srijita Kundu, Harumichi Nishimura
On the Power of Quantum Distributed Proofs. PODC (2024)
Atsuya Hasegawa, Srijita Kundu, Harumichi Nishimura
On the Power of Quantum Distributed Proofs. CoRR (2024)
Upendra Kapshikar, Srijita Kundu
On the Hardness of the Minimum Distance Problem of Quantum Codes. IEEE Trans. Inf. Theory 69 (10) (2023)
Subrata Datta, Kalyani Mali, Sourav Das, Srijita Kundu, Sayanta Harh
Rhythmus periodic frequent pattern mining without periodicity threshold. J. Ambient Intell. Humaniz. Comput. 14 (7) (2023)
Srijita Kundu, Ernest Y.-Z. Tan
Composably secure device-independent encryption with certified deletion. Quantum 7 (2023)
Upendra Kapshikar, Srijita Kundu
Diagonal distance of quantum codes and hardness of the minimum distance problem. CoRR (2022)
Srijita Kundu, Jamie Sikora, Ernest Y.-Z. Tan
A device-independent protocol for XOR oblivious transfer. Quantum 6 (2022)
Rahul Jain, Srijita Kundu
A direct product theorem for quantum communication complexity with applications to device-independent QKD. FOCS (2022)
Rahul Jain, Srijita Kundu
A direct product theorem for quantum communication complexity with applications to device-independent QKD. CoRR (2021)
Rahul Jain, Srijita Kundu
A Direct Product Theorem for One-Way Quantum Communication. Computational Complexity Conference (2021)
Anurag Anshu, Shalev Ben-David, Srijita Kundu
On Query-To-Communication Lifting for Adversary Bounds. Computational Complexity Conference (2021)
Rahul Jain, Srijita Kundu
A direct product theorem for quantum communication complexity with applications to device-independent QKD. Electron. Colloquium Comput. Complex. 28 (2021)
Rahul Jain, Srijita Kundu
A direct product theorem for quantum communication complexity with applications to device-independent QKD. FOCS (2021)
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64 (1) (2020)
Rahul Jain, Srijita Kundu
A Direct Product Theorem for One-Way Quantum Communication. Electron. Colloquium Comput. Complex. 27 (2020)
Rahul Jain, Srijita Kundu
A Direct Product Theorem for One-Way Quantum Communication. CoRR (2020)
Anurag Anshu, Shalev Ben-David, Srijita Kundu
On Query-to-Communication Lifting for Adversary Bounds. CoRR (2020)
Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. CoRR (2019)
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. CSR (2018)
Sourav Chakraborty, Sushrut Karmalkar, Srijita Kundu, Satyanarayana V. Lokam, Nitin Saurabh
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. LATIN (2018)
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. 24 (2017)
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
A Composition Theorem for Randomized Query Complexity. FSTTCS (2017)
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. 24 (2017)
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs
Quadratically Tight Relations for Randomized Query Complexity. CoRR (2017)
Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay
Lifting randomized query complexity to randomized communication complexity. Electron. Colloquium Comput. Complex. 24 (2017)
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal
A Composition Theorem for Randomized Query Complexity. CoRR (2017)
André Chailloux, Iordanis Kerenidis, Srijita Kundu, Jamie Sikora
Optimal Bounds for Parity-Oblivious Random Access Codes with Applications. TQC (2014)