Pranab Sen

CoRR, April, 2025

2024

High Probability Decoupling via Approximate Unitary Designs and Efficient Relative Thermalization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, April, 2024

Fully smooth one shot multipartite soft covering of quantum states without pairwise independence.

[BibT_eX]

[DOI]

CoRR, 2024

2023

One-Shot Non-Catalytic Distributed Purity Distillation.

[BibT_eX]

[DOI]

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

2022

Approximate Unitary Designs Give Rise to Quantum Channels With Super Additive Classical Holevo Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Centralised multi link measurement compression with side information.

[BibT_eX]

[DOI]

Arun Padakandla

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary t-designs.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

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

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

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

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2019

Approximate Unitary n2/3-Designs Give Rise to Quantum Channels with Super Additive Classical Holevo Capacity.

[BibT_eX]

[DOI]

Proceedings of the 14th Conference on the Theory of Quantum Computation, 2019

2018

A one-shot quantum joint typicality lemma.

[BibT_eX]

[DOI]

CoRR, 2018

Inner bounds via simultaneous decoding in quantum network information theory.

[BibT_eX]

[DOI]

CoRR, 2018

2016

Quantum Algorithm for the Discrete Logarithm Problem.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel.

[BibT_eX]

[DOI]

Naqueeb Ahmad Warsi

IEEE Trans. Inf. Theory, 2016

2014

Hidden Translation and Translating Coset in Quantum Computing.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

One-shot Marton inner bound for classical-quantum broadcast channel.

[BibT_eX]

[DOI]

Naqueeb Warsi

CoRR, 2014

2012

Classical Communication Over a Quantum Interference Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Achieving the Han-Kobayashi inner bound for the quantum interference channel.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding

[BibT_eX]

[DOI]

CoRR, 2011

From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking.

[BibT_eX]

[DOI]

Omar Fawzi

Patrick M. Hayden

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Quantum interference channels.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2009

A property of quantum relative entropy with an application to privacy in quantum communication.

[BibT_eX]

[DOI]

J. ACM, 2009

Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.

[BibT_eX]

[DOI]

Martin Rötteler

Algorithmica, 2009

2008

Quantum Algorithm for the Discrete Logarithm Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Lower bounds for predecessor searching in the cell probe model.

[BibT_eX]

[DOI]

Srinivasan Venkatesh

J. Comput. Syst. Sci., 2008

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

[BibT_eX]

[DOI]

CoRR, 2008

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Invertible quantum operations and perfect encryption of quantum states.

[BibT_eX]

[DOI]

Ashwin Nayak

Quantum Inf. Comput., 2007

2006

Limitations of quantum coset states for graph isomorphism.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005

On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group.

[BibT_eX]

[DOI]

Martin Rötteler

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Prior Entanglement, Message Compression and Privacy in Quantum Communication.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2003

Hidden translation and orbit coset in quantum computing.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Quantum Testers for Hidden Group Properties.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

A Direct Sum Theorem in Communication Complexity via Message Compression.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

Lower bounds for predecessor searching in the cell probe model.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002

The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

2001

Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem

[BibT_eX]

[DOI]

Sundar Vishwanathan

CoRR, 2001

Lower Bounds in the Quantum Cell Probe Model.

[BibT_eX]

[DOI]

Srinivasan Venkatesh

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem.

[BibT_eX]

[DOI]

Sundar Vishwanathan

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

The Quantum Complexity of Set Membership.

[BibT_eX]

[DOI]