default search action
Anurag Anshu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Anurag Anshu
, Nikolas P. Breuckmann
Circuit-to-Hamiltonian from Tensor Networks and Fault Tolerance. STOC 2024: 585-595 - [c26]Hsin-Yuan Huang
Learning Shallow Quantum Circuits. STOC 2024: 1343-1351 - [i35]Hsin-Yuan Huang, Yunchao Liu, Michael Broughton, Isaac Kim, Anurag Anshu, Zeph Landau, Jarrod R. McClean:
Learning shallow quantum circuits. CoRR abs/2401.10095 (2024) - [i34]Anurag Anshu, Jonas Haferkamp, Yeongwoo Hwang, Quynh T. Nguyen:
UniqueQMA vs QMA: oracle separation and eigenstate thermalization hypothesis. CoRR abs/2410.23811 (2024) - 2023
- [j19]Anurag Anshu, Tony Metger:
Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations. Quantum 7: 999 (2023) - [j18]Anurag Anshu
One-Shot Quantum State Redistribution and Quantum Markov Chains. IEEE Trans. Inf. Theory 69(9): 5788-5804 (2023) - [c25]Anurag Anshu, Tony Metger:
Concentration Bounds for Quantum States and Limitations on the QAOA from Polynomial Approximations. ITCS 2023: 5:1-5:8 - [c24]Anurag Anshu, Nikolas P. Breuckmann
NLTS Hamiltonians from Good Quantum Codes. STOC 2023: 1090-1096 - [i33]Anurag Anshu, Srinivasan Arunachalam:
A survey on the complexity of learning quantum states. CoRR abs/2305.20069 (2023) - [i32]Yaroslav Herasymenko, Anurag Anshu, Barbara M. Terhal, Jonas Helsen:
Fermionic Hamiltonians without trivial low-energy states. CoRR abs/2307.13730 (2023) - [i31]Anurag Anshu, Nikolas P. Breuckmann, Quynh T. Nguyen:
Circuit-to-Hamiltonian from tensor networks and fault tolerance. CoRR abs/2309.16475 (2023) - 2022
- [j17]Anurag Anshu
Incompressibility of Classical Distributions. IEEE Trans. Inf. Theory 68(3): 1758-1771 (2022) - [c23]Anurag Anshu, Chinmay Nirkhe:
Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians. ITCS 2022: 6:1-6:22 - [c22]Anurag Anshu, Itai Arad, David Gosset:
An area law for 2d frustration-free spin systems. STOC 2022: 12-18 - [c21]Anurag Anshu, Zeph Landau, Yunchao Liu:
Distributed Quantum inner product estimation. STOC 2022: 44-51 - [i30]Anurag Anshu, Nikolas P. Breuckmann
NLTS Hamiltonians from good quantum codes. CoRR abs/2206.13228 (2022) - [i29]Anurag Anshu, Tony Metger:
Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations. CoRR abs/2209.02715 (2022) - 2021
- [c20]Anurag Anshu, Shalev Ben-David, Srijita Kundu:
On Query-To-Communication Lifting for Adversary Bounds. CCC 2021: 30:1-30:39 - [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) - [i27]Anurag Anshu, David Gosset, Karen J. Morenz Korol
Improved approximation algorithms for bounded-degree local Hamiltonians. CoRR abs/2105.01193 (2021) - 2020
- [j16]Anurag Anshu, Peter Høyer
Contextuality in multipartite pseudo-telepathy graph games. J. Comput. Syst. Sci. 107: 156-165 (2020) - [j15]Anurag Anshu
On the Compression of Messages in the Multi-Party Setting. IEEE Trans. Inf. Theory 66(4): 2091-2114 (2020) - [j14]Farzin Salek
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
Partially Smoothed Information Measures. IEEE Trans. Inf. Theory 66(8): 5022-5036 (2020) - [j12]Anurag Anshu
Secure Communication Over Fully Quantum Gel'fand-Pinsker Wiretap Channel. IEEE Trans. Inf. Theory 66(9): 5548-5566 (2020) - [j11]Anurag Anshu
Noisy Quantum State Redistribution With Promise and the Alpha-Bit. IEEE Trans. Inf. Theory 66(12): 7772-7786 (2020) - [c18]Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, Mehdi Soleimanifar:
Sample-efficient learning of quantum many-body systems. FOCS 2020: 685-691 - [c17]Anurag Anshu, Itai Arad, David Gosset:
Entanglement subvolume law for 2d frustration-free spin systems. STOC 2020: 868-874 - [c16]Anurag Anshu
Beyond Product State Approximations for a Quantum Analogue of Max Cut. TQC 2020: 7:1-7:15 - [i26]Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, Mehdi Soleimanifar:
Sample-efficient learning of quantum many-body systems. CoRR abs/2004.07266 (2020) - [i25]Anurag Anshu, Aram W. Harrow
From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians. CoRR abs/2004.15009 (2020) - [i24]Anurag Anshu, Chinmay Nirkhe:
Circuit lower bounds for low-energy states of quantum code Hamiltonians. CoRR abs/2011.02044 (2020) - [i23]Anurag Anshu, Shalev Ben-David, Srijita Kundu:
On Query-to-Communication Lifting for Adversary Bounds. CoRR abs/2012.03415 (2020)
2010 – 2019
- 2019
- [j10]Anurag Anshu
Building Blocks for Communication Over Noisy Quantum Networks. IEEE Trans. Inf. Theory 65(2): 1287-1306 (2019) - [j9]Anurag Anshu
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel. IEEE Trans. Inf. Theory 65(4): 2623-2636 (2019) - [j8]Anurag Anshu
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction. IEEE Trans. Inf. Theory 65(9): 5905-5924 (2019) - [c15]Anurag Anshu, Naresh Goud Boddu
Quantum Log-Approximate-Rank Conjecture is Also False. FOCS 2019: 982-994 - [c14]Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel:
Second-Order Characterizations via Partial Smoothing. ISIT 2019: 937-941 - [i22]Anurag Anshu, Debbie W. Leung, Dave Touchette:
Incompressibility of classical distributions. CoRR abs/1911.09126 (2019) - 2018
- [j7]Anurag Anshu
A One-Shot Achievability Result for Quantum State Redistribution. IEEE Trans. Inf. Theory 64(3): 1425-1435 (2018) - [j6]Anurag Anshu
A Generalized Quantum Slepian-Wolf. IEEE Trans. Inf. Theory 64(3): 1436-1453 (2018) - [j5]Anurag Anshu
Expected Communication Cost of Distributed Quantum Tasks. IEEE Trans. Inf. Theory 64(11): 7395-7423 (2018) - [c13]Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh
One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels. ISIT 2018: 296-300 - [c12]Anurag Anshu, Ankit Garg, Aram W. Harrow
Expected Communication Cost of Distributed Quantum Tasks. ISIT 2018: 806-810 - [c11]Anurag Anshu, Rahul Jain
Building Blocks for Communication Over Noisy Quantum Nerworks. ISIT 2018: 1789-1793 - [c10]Anurag Anshu, Rahul Jain
A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum Channel. ISIT 2018: 1794-1798 - [c9]Anurag Anshu, Masahito Hayashi, Naqueeb Ahmad Warsi:
Secure Communication Over Fully Quantum Gel' Fand-Pinsker Wiretap Channel. ISIT 2018: 2679-2683 - [i21]Anurag Anshu, Masahito Hayashi, Naqueeb Ahmad Warsi:
Secure communication over fully quantum Gel'fand-Pinsker wiretap channel. CoRR abs/1801.00940 (2018) - [i20]Anurag Anshu, Mario Berta
Partially smoothed information measures. CoRR abs/1807.05630 (2018) - [i19]Anurag Anshu, Penghui Yao:
On the compression of messages in the multi-party setting. CoRR abs/1808.06449 (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) - [i17]Anurag Anshu, Naresh Goud Boddu, Dave Touchette:
Quantum Log-Approximate-Rank Conjecture is also False. CoRR abs/1811.10525 (2018) - [i16]Anurag Anshu, Naresh Goud Boddu, Dave Touchette:
Quantum Log-Approximate-Rank Conjecture is also False. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j4]Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi, Satyanarayana Vusirikala:
On the rectilinear crossing number of complete uniform hypergraphs. Comput. Geom. 61: 38-47 (2017) - [c8]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain
Separating Quantum Communication and Approximate Rank. CCC 2017: 24:1-24:33 - [c7]Anurag Anshu, Peter Høyer
Contextuality in Multipartite Pseudo-Telepathy Graph Games. FCT 2017: 41-55 - [c6]Anurag Anshu, Dmitry Gavinsky, Rahul Jain
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13 - [c5]Anurag Anshu:
An upper bound on quantum capacity of unital quantum channels. ITW 2017: 214-218 - [c4]Anurag Anshu, Rahul Jain
Achievability bounds on quantum state redistribution using convex split and position based decoding. ITW 2017: 474-478 - [c3]Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu
Exponential separation of quantum communication and classical information. STOC 2017: 277-288 - [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
- [j3]Anurag Anshu, Saswata Shannigrahi:
A lower bound on the crossing number of uniform hypergraphs. Discret. Appl. Math. 209: 11-15 (2016) - [j2]Anurag Anshu
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
Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564 - [c1]Anurag Anshu, Ankit Garg, Aram W. Harrow
Lower Bound on Expected Communication Cost of Quantum Huffman Coding. TQC 2016: 3:1-3:18 - [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) - [i4]Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu:
Exponential Separation of Quantum Communication and Classical Information. CoRR abs/1611.08946 (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) - 2013
- [j1]Anurag Anshu, Mehdi Mhalla:
Pseudo-telepathy games and genuine ns k-way nonlocality using graph states. Quantum Inf. Comput. 13(9-10): 833-845 (2013)
Coauthor Index
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-12-01 00:15 CET 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: