Anurag Anshu

Orcid: 0000-0002-3859-9309

According to our database1, Anurag Anshu authored at least 52 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Learning shallow quantum circuits.
CoRR, 2024

2023
One-Shot Quantum State Redistribution and Quantum Markov Chains.
IEEE Trans. Inf. Theory, September, 2023

Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations.
Quantum, May, 2023

Circuit-to-Hamiltonian from tensor networks and fault tolerance.
CoRR, 2023

Fermionic Hamiltonians without trivial low-energy states.
CoRR, 2023

A survey on the complexity of learning quantum states.
CoRR, 2023

NLTS Hamiltonians from Good Quantum Codes.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Incompressibility of Classical Distributions.
IEEE Trans. Inf. Theory, 2022

Distributed Quantum inner product estimation.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

An area law for 2d frustration-free spin systems.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Improved approximation algorithms for bounded-degree local Hamiltonians.
CoRR, 2021

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

2020
One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information.
IEEE Trans. Inf. Theory, 2020

On the Compression of Messages in the Multi-Party Setting.
IEEE Trans. Inf. Theory, 2020

Secure Communication Over Fully Quantum Gel'fand-Pinsker Wiretap Channel.
IEEE Trans. Inf. Theory, 2020

Noisy Quantum State Redistribution With Promise and the Alpha-Bit.
IEEE Trans. Inf. Theory, 2020

Partially Smoothed Information Measures.
IEEE Trans. Inf. Theory, 2020

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

From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians.
CoRR, 2020

Beyond Product State Approximations for a Quantum Analogue of Max Cut.
Proceedings of the 15th Conference on the Theory of Quantum Computation, 2020

Entanglement subvolume law for 2d frustration-free spin systems.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Sample-efficient learning of quantum many-body systems.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

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

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

Building Blocks for Communication Over Noisy Quantum Networks.
IEEE Trans. Inf. Theory, 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. Inf. Theory, 2018

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

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

Quantum Log-Approximate-Rank Conjecture is also False.
Electron. Colloquium Comput. Complex., 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

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.
Electron. Colloquium Comput. Complex., 2017

A Composition Theorem for Randomized Query complexity.
Electron. Colloquium Comput. Complex., 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. Inf. Theory, 2016

Separations in communication complexity using cheat sheets and information complexity.
Electron. Colloquium Comput. Complex., 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 Inf. Comput., 2013


  Loading...