Srijita Kundu

Orcid: 0000-0002-8630-0113

According to our database1, Srijita Kundu authored at least 22 papers between 2014 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A Cautionary Note on Quantum Oracles.
CoRR, April, 2025

Does there exist a quantum fingerprinting protocol without coherent measurements?
CoRR, February, 2025

A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography.
SIAM J. Comput., 2025

Device-independent uncloneable encryption.
Quantum, 2025

Uncloneable Quantum States Are Necessary as Proofs and Advice.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Separations in query complexity for total search problems.
CoRR, 2024

On the Power of Quantum Distributed Proofs.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Oracle Separation of QMA and QCMA with Bounded Adaptivity.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
On the Hardness of the Minimum Distance Problem of Quantum Codes.
IEEE Trans. Inf. Theory, October, 2023

Composably secure device-independent encryption with certified deletion.
Quantum, July, 2023

Rhythmus periodic frequent pattern mining without periodicity threshold.
J. Ambient Intell. Humaniz. Comput., July, 2023

2022
A device-independent protocol for XOR oblivious transfer.
Quantum, 2022

Diagonal distance of quantum codes and hardness of the minimum distance problem.
CoRR, 2022

2021
A direct product theorem for quantum communication complexity with applications to device-independent QKD.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

On Query-To-Communication Lifting for Adversary Bounds.
Proceedings of the 36th Computational Complexity Conference, 2021

A Direct Product Theorem for One-Way Quantum Communication.
Proceedings of the 36th Computational Complexity Conference, 2021

2018
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Quadratically Tight Relations for Randomized Query Complexity.
Proceedings of the Computer Science - Theory and Applications, 2018

2017
Quadratically Tight Relations for Randomized Query Complexity.
Electron. Colloquium Comput. Complex., 2017

Lifting randomized query complexity to randomized communication complexity.
Electron. Colloquium Comput. Complex., 2017

A Composition Theorem for Randomized Query Complexity.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2014
Optimal Bounds for Parity-Oblivious Random Access Codes with Applications.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014


  Loading...