default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnurag Anshu
- > Home > Persons > Anurag Anshu
Publications
- 2023
[j18]Anurag Anshu
, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-Shot Quantum State Redistribution and Quantum Markov Chains. IEEE Trans. Inf. Theory 69(9): 5788-5804 (2023)- 2021
- [c19]Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-Shot Quantum State Redistribution and Quantum Markov Chains. ISIT 2021: 130-135 - [i28]Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-shot quantum state redistribution and quantum Markov chains. CoRR abs/2104.08753 (2021) - 2020
- [j14]Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier Rodríguez Fonollosa:
One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information. IEEE Trans. Inf. Theory 66(4): 2141-2164 (2020) - [j13]Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel:
Partially Smoothed Information Measures. IEEE Trans. Inf. Theory 66(8): 5022-5036 (2020) - [j11]Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain:
Noisy Quantum State Redistribution With Promise and the Alpha-Bit. IEEE Trans. Inf. Theory 66(12): 7772-7786 (2020) - 2019
- [j10]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Building Blocks for Communication Over Noisy Quantum Networks. IEEE Trans. Inf. Theory 65(2): 1287-1306 (2019) - [j9]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel. IEEE Trans. Inf. Theory 65(4): 2623-2636 (2019) - [j8]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction. IEEE Trans. Inf. Theory 65(9): 5905-5924 (2019) - [c14]Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel:
Second-Order Characterizations via Partial Smoothing. ISIT 2019: 937-941 - 2018
- [j7]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A One-Shot Achievability Result for Quantum State Redistribution. IEEE Trans. Inf. Theory 64(3): 1425-1435 (2018) - [j6]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Generalized Quantum Slepian-Wolf. IEEE Trans. Inf. Theory 64(3): 1436-1453 (2018) - [c13]Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier R. Fonollosa:
One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels. ISIT 2018: 296-300 - [c11]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Building Blocks for Communication Over Noisy Quantum Nerworks. ISIT 2018: 1789-1793 - [c10]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum Channel. ISIT 2018: 1794-1798 - [i20]Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel:
Partially smoothed information measures. CoRR abs/1807.05630 (2018) - [i18]Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier R. Fonollosa:
One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information. CoRR abs/1809.07104 (2018) - 2017
- [c8]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating Quantum Communication and Approximate Rank. CCC 2017: 24:1-24:33 - [c6]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13 - [c4]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Achievability bounds on quantum state redistribution using convex split and position based decoding. ITW 2017: 474-478 - [i15]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach. CoRR abs/1702.01940 (2017) - [i14]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution. CoRR abs/1702.02396 (2017) - [i13]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Measurement compression with quantum side information using shared randomness. CoRR abs/1703.02342 (2017) - [i12]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A generalized quantum Slepian-Wolf. CoRR abs/1703.09961 (2017) - [i11]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. CoRR abs/1706.00335 (2017) - [i10]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A hypothesis testing approach for communication over entanglement assisted compound quantum channel. CoRR abs/1706.08286 (2017) - [i9]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A unified approach to source and message compression. CoRR abs/1707.03619 (2017) - [i8]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i7]Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay:
Lifting randomized query complexity to randomized communication complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j2]Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao:
New One Shot Quantum Protocols With Application to Communication Complexity. IEEE Trans. Inf. Theory 62(12): 7566-7577 (2016) - [c2]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564 - [r1]Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain, Priyanka Mukhopadhyay:
Teleportation of Quantum States. Encyclopedia of Algorithms 2016: 2205-2209 - [i6]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. CoRR abs/1605.01142 (2016) - [i5]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating quantum communication and approximate rank. CoRR abs/1611.05754 (2016) - [i3]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2014
- [i2]Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao:
A new operational interpretation of relative entropy and trace distance between quantum states. CoRR abs/1404.1366 (2014) - [i1]Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain:
Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution. CoRR abs/1410.3031 (2014)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
