Sayantan Chakraborty

According to our database, Sayantan Chakraborty authored at least 12 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Chain rules for one-shot entropic quantities via operational methods.

Sayantan Chakraborty, Upendra Kapshikar

CoRR, 2023

Generalized resource theory of purity: one-shot purity distillation with local noisy operations and one way classical communication.

Sayantan Chakraborty, Aditya Nema, Francesco Buscemi

Proceedings of the IEEE International Symposium on Information Theory, 2023

A novel chain rule for one-shot entropic quantities via operational methods.

Sayantan Chakraborty, Upendra Kapshikar

Proceedings of the IEEE International Symposium on Information Theory, 2023

One-Shot Non-Catalytic Distributed Purity Distillation.

Sayantan Chakraborty, Rahul Jain, Pranab Sen

Proceedings of the 59th Annual Allerton Conference on Communication, 2023

2022

One-shot purity distillation with local noisy operations and one-way classical communication.

Sayantan Chakraborty, Aditya Nema, Francesco Buscemi

CoRR, 2022

Centralised multi link measurement compression with side information.

Sayantan Chakraborty, Arun Padakandla, Pranab Sen

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC.

Sayantan Chakraborty, Aditya Nema, Pranab Sen

CoRR, 2021

One-shot inner bounds for sending private classical information over a quantum MAC.

Sayantan Chakraborty, Aditya Nema, Pranab Sen

Proceedings of the IEEE Information Theory Workshop, 2021

Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting.

Sayantan Chakraborty, Aditya Nema, Pranab Sen

Proceedings of the IEEE International Symposium on Information Theory, 2021

A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC.

Sayantan Chakraborty, Aditya Nema, Pranab Sen

Proceedings of the IEEE International Symposium on Information Theory, 2021

2019

Improved bounds for perfect sampling of $k$-colorings in graphs.

Siddharth Bhandari, Sayantan Chakraborty

Electron. Colloquium Comput. Complex., 2019

Perfect Sampling of graph k-colorings for k>3Δ.

Siddharth Bhandari, Sayantan Chakraborty

CoRR, 2019