Anurag Anshu

According to our database1, Anurag Anshu authored at least 35 papers between 2013 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Contextuality in multipartite pseudo-telepathy graph games.
J. Comput. Syst. Sci., 2020

2019
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction.
IEEE Trans. Information Theory, 2019

A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel.
IEEE Trans. Information Theory, 2019

Building Blocks for Communication Over Noisy Quantum Networks.
IEEE Trans. Information Theory, 2019

Incompressibility of classical distributions.
CoRR, 2019

Second-Order Characterizations via Partial Smoothing.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
A Generalized Quantum Slepian-Wolf.
IEEE Trans. Information Theory, 2018

A One-Shot Achievability Result for Quantum State Redistribution.
IEEE Trans. Information Theory, 2018

Expected Communication Cost of Distributed Quantum Tasks.
IEEE Trans. Information Theory, 2018

Quantum Log-Approximate-Rank Conjecture is also False.
Electronic Colloquium on Computational Complexity (ECCC), 2018

One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information.
CoRR, 2018

On the compression of messages in the multi-party setting.
CoRR, 2018

Partially smoothed information measures.
CoRR, 2018

One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Secure Communication Over Fully Quantum Gel' Fand-Pinsker Wiretap Channel.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Building Blocks for Communication Over Noisy Quantum Nerworks.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Lifting randomized query complexity to randomized communication complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2017

A Composition Theorem for Randomized Query complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Measurement compression with quantum side information using shared randomness.
CoRR, 2017

A unified approach to source and message compression.
CoRR, 2017

One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach.
CoRR, 2017

Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution.
CoRR, 2017

On the rectilinear crossing number of complete uniform hypergraphs.
Comput. Geom., 2017

Exponential separation of quantum communication and classical information.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

An upper bound on quantum capacity of unital quantum channels.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Achievability bounds on quantum state redistribution using convex split and position based decoding.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Separating Quantum Communication and Approximate Rank.
Proceedings of the 32nd Computational Complexity Conference, 2017

2016
Teleportation of Quantum States.
Encyclopedia of Algorithms, 2016

New One Shot Quantum Protocols With Application to Communication Complexity.
IEEE Trans. Information Theory, 2016

Separations in communication complexity using cheat sheets and information complexity.
Electronic Colloquium on Computational Complexity (ECCC), 2016

A lower bound on the crossing number of uniform hypergraphs.
Discret. Appl. Math., 2016

Lower Bound on Expected Communication Cost of Quantum Huffman Coding.
Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016

2014
A new operational interpretation of relative entropy and trace distance between quantum states.
CoRR, 2014

Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution.
CoRR, 2014

2013
Pseudo-telepathy games and genuine ns k-way nonlocality using graph states.
Quantum Information & Computation, 2013


  Loading...