Anurag Anshu
Anurag Anshu
Institute for Quantum Computing
Verified email at uwaterloo.ca
Title
Cited by
Cited by
Year
Quantum communication using coherent rejection sampling
A Anshu, VK Devabathini, R Jain
Physical review letters 119 (12), 120506, 2017
47*2017
Building blocks for communication over noisy quantum networks
A Anshu, R Jain, NA Warsi
IEEE Transactions on Information Theory 65 (2), 1287-1306, 2018
42*2018
Quantifying resources in general resource theory with catalysts
A Anshu, MH Hsieh, R Jain
Physical review letters 121 (19), 190504, 2018
28*2018
Separations in communication complexity using cheat sheets and information complexity
A Anshu, A Belovs, S Ben-David, M Göös, R Jain, R Kothari, T Lee, ...
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
212016
A one-shot achievability result for quantum state redistribution
A Anshu, R Jain, NA Warsi
IEEE Transactions on Information Theory 64 (3), 1425-1435, 2017
20*2017
New one shot quantum protocols with application to communication complexity
A Anshu, R Jain, P Mukhopadhyay, A Shayeghi, P Yao
IEEE Transactions on Information Theory 62 (12), 7566-7577, 2016
18*2016
Concentration bounds for quantum states with finite correlation length on quantum spin lattice systems
A Anshu
New Journal of Physics 18 (8), 083011, 2016
182016
Simple proof of the detectability lemma and spectral gap amplification
A Anshu, I Arad, T Vidick
Physical Review B 93 (20), 205142, 2016
182016
A generalized quantum Slepian–Wolf
A Anshu, R Jain, NA Warsi
IEEE Transactions on Information Theory 64 (3), 1436-1453, 2017
122017
Lifting randomized query complexity to randomized communication complexity.
A Anshu, NB Goud, R Jain, S Kundu, P Mukhopadhyay
Electronic Colloquium on Computational Complexity (ECCC) 24, 54, 2017
122017
Partially smoothed information measures
A Anshu, M Berta, R Jain, M Tomamichel
IEEE Transactions on Information Theory, 2020
92020
Exponential separation of quantum communication and classical information
A Anshu, D Touchette, P Yao, N Yu
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
92017
Quantum Log-Approximate-Rank conjecture is also false
A Anshu, NG Boddu, D Touchette
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
82019
A unified approach to source and message compression
A Anshu, R Jain, NA Warsi
arXiv preprint arXiv:1707.03619, 2017
72017
How local is the information in tensor networks of matrix product states or projected entangled pairs states
A Anshu, I Arad, A Jain
Physical Review B 94 (19), 195143, 2016
72016
Entanglement subvolume law for 2D frustration-free spin systems
A Anshu, I Arad, D Gosset
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
62020
On the near-optimality of one-shot classical communication over quantum channels
A Anshu, R Jain, NA Warsi
Journal of Mathematical Physics 60 (1), 012204, 2019
62019
A hypothesis testing approach for communication over entanglement-assisted compound quantum channel
A Anshu, R Jain, NA Warsi
IEEE Transactions on Information Theory 65 (4), 2623-2636, 2018
62018
Measurement compression with quantum side information using shared randomness
A Anshu, R Jain, N Warsi
arXiv preprint arXiv:1703.02342, 2017
62017
Separating quantum communication and approximate rank
A Anshu, S Ben-David, A Garg, R Jain, R Kothari, T Lee
arXiv preprint arXiv:1611.05754, 2016
52016
The system can't perform the operation now. Try again later.
Articles 1–20