Sayantan Chakraborty

Publication Activity (10 Years)

Years Active: 2019-2023
Publications (10 Years): 16

Top Topics

Quantum Computing

Number Of Iterations Required

Top Venues

Publications

Sayantan Chakraborty, Rahul Jain, Pranab Sen
One-Shot Non-Catalytic Distributed Purity Distillation. Allerton (2023)
Sayantan Chakraborty, Aditya Nema, Francesco Buscemi
Generalized resource theory of purity: one-shot purity distillation with local noisy operations and one way classical communication. ISIT (2023)
Sayantan Chakraborty, Upendra Kapshikar
A novel chain rule for one-shot entropic quantities via operational methods. ISIT (2023)
Sayantan Chakraborty, Arun Padakandla, Pranab Sen
Centralised multi link measurement compression with side information. ISIT (2022)
Siddharth Bhandari, Sayantan Chakraborty
Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs. SIAM J. Comput. 51 (3) (2022)
Sayantan Chakraborty, Aditya Nema, Francesco Buscemi
One-shot purity distillation with local noisy operations and one-way classical communication. CoRR (2022)
Sayantan Chakraborty, Arun Padakandla, Pranab Sen
Centralised multi link measurement compression with side information. CoRR (2022)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting. CoRR (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC. ISIT (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting. ISIT (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC. CoRR (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
One-shot inner bounds for sending private classical information over a quantum MAC. ITW (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
One-shot inner bounds for sending private classical information over a quantum MAC. CoRR (2021)
Siddharth Bhandari, Sayantan Chakraborty
Improved bounds for perfect sampling of k-colorings in graphs. STOC (2020)
Siddharth Bhandari, Sayantan Chakraborty
Improved bounds for perfect sampling of $k$-colorings in graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Siddharth Bhandari, Sayantan Chakraborty
Perfect Sampling of graph k-colorings for k>3Δ. CoRR (2019)