# Publications ## Publications ### Quantum many-body systems Download 14 citations download- [BibTeX](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124302&&&format=bibtex) - [EndNote X3 XML](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124302&&&format=endnote8) - [EndNote 7 XML](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124302&&&format=endnote7) - [Endnote tagged](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124302&&&format=tagged) - [Marc](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124302&&&format=marc) - [PubMedId](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124302&&&format=pubmed_id) - [RIS](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124302&&&format=ris) ### 2022 Anurag Anshu, Itai Arad, and David Gosset. 2022. “[An Area Law for 2D Frustration-Free Spin Systems](/publications/area-law-2d-frustration-free-spin-systems)” Anurag Anshu, Itai Arad, and David Gosset. 2022. “[An Area Law for 2D Frustration-Free Spin Systems](/publications/area-law-2d-frustration-free-spin-systems)” - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://dl.acm.org/doi/10.1145/3519935.3519962) We prove that the entanglement entropy of the ground state of a locally gapped frustration-free 2D lattice spin system satisfies an area law with respect to a vertical bipartition of the lattice into left and right regions. We first establish that the... - [ descriptionPublisher's Version](https://dl.acm.org/doi/10.1145/3519935.3519962) Anurag Anshu, Aram W. Harrow, and Mehdi Soleimanifar. 2022. “[Entanglement Spread Area Law in Gapped Ground States](/publications/communication-complexity-entanglement-spread-area-law-ground-state-gapped-local)”. Nature Physics Anurag Anshu, Aram W. Harrow, and Mehdi Soleimanifar. 2022. “[Entanglement Spread Area Law in Gapped Ground States](/publications/communication-complexity-entanglement-spread-area-law-ground-state-gapped-local)”. Nature Physics - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://www.nature.com/articles/s41567-022-01740-7) Ground-state entanglement governs various properties of quantum many-body systems at low temperatures and is the key to understanding gapped quantum phases of matter. Here we identify a structural property of entanglement in the ground state of gapped... - [ descriptionPublisher's Version](https://www.nature.com/articles/s41567-022-01740-7) Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe. 2022. “[NLTS Hamiltonians from Good Quantum Codes](/publications/nlts-hamiltonians-good-quantum-codes)” Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe. 2022. “[NLTS Hamiltonians from Good Quantum Codes](/publications/nlts-hamiltonians-good-quantum-codes)” - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://dl.acm.org/doi/10.1145/3564246.3585114) The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings \[2014\] posits that there exist families of Hamiltonians with all low energy states of non-trivial complexity (with complexity measured by the quantum circuit depth preparing the... - [ descriptionPublisher's Version](https://dl.acm.org/doi/10.1145/3564246.3585114) Anurag Anshu and Nikolas P. Breuckmann. 2022. “[A Construction of Combinatorial NLTS](/publications/construction-combinatorial-nlts)”. Journal of Mathematical Physics, 63, 122201 Anurag Anshu and Nikolas P. Breuckmann. 2022. “[A Construction of Combinatorial NLTS](/publications/construction-combinatorial-nlts)”. Journal of Mathematical Physics, 63, 122201 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://aip.scitation.org/doi/10.1063/5.0113731) The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings \[2014\] posits that there exist families of Hamiltonians with all low energy states of high complexity (with complexity measured by the quantum circuit depth preparing the state)... - [ descriptionPublisher's Version](https://aip.scitation.org/doi/10.1063/5.0113731) Anurag Anshu, Itai Arad, and David Gosset. 2022. “[Entanglement Subvolume Law for 2D Frustration-Free Spin Systems](/publications/entanglement-subvolume-law-2d-frustration-free-spin-systems)”. Communications in Mathematical Physics Anurag Anshu, Itai Arad, and David Gosset. 2022. “[Entanglement Subvolume Law for 2D Frustration-Free Spin Systems](/publications/entanglement-subvolume-law-2d-frustration-free-spin-systems)”. Communications in Mathematical Physics - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://link.springer.com/article/10.1007/s00220-022-04381-2) Let *H* be a frustration-free Hamiltonian describing a 2D grid of qudits with local interactions, a unique ground state, and local spectral gap lower bounded by a positive constant. For any bipartition defined by a vertical cut of length *L* running from top... - [ descriptionPublisher's Version](https://link.springer.com/article/10.1007/s00220-022-04381-2) ### 2021 Tomotaka Kuwahara, Alvaro M. Alhambra, and Anurag Anshu. 2021. “[Improved Thermal Area Law and Quasi-Linear Time Algorithm for Quantum Gibbs States](/publications/improved-thermal-area-law-and-quasi-linear-time-algorithm-quantum-gibbs-states)” Tomotaka Kuwahara, Alvaro M. Alhambra, and Anurag Anshu. 2021. “[Improved Thermal Area Law and Quasi-Linear Time Algorithm for Quantum Gibbs States](/publications/improved-thermal-area-law-and-quasi-linear-time-algorithm-quantum-gibbs-states)” - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevX.11.011047) One of the most fundamental problems in quantum many-body physics is the characterization of correlations among thermal states. Of particular relevance is the thermal area law, which justifies the tensor network approximations to thermal states with a... - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevX.11.011047) Anurag Anshu, David Gosset, Karen J. Morenz Korol, and Mehdi Soleimanifar. 2021. “[Improved Approximation Algorithms for Bounded-Degree Local Hamiltonians](/publications/improved-approximation-algorithms-bounded-degree-local-hamiltonians)”. Physical Review Letters Anurag Anshu, David Gosset, Karen J. Morenz Korol, and Mehdi Soleimanifar. 2021. “[Improved Approximation Algorithms for Bounded-Degree Local Hamiltonians](/publications/improved-approximation-algorithms-bounded-degree-local-hamiltonians)”. Physical Review Letters - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.127.250502) We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow quantum circuits... - [ descriptionPublisher's Version](https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.127.250502) Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, and Mehdi Soleimanifar. 2021. “[Sample-Efficient Learning of Interacting Quantum Systems](/publications/sample-efficient-learning-interacting-quantum-systems)”. Nature Physics, 17, Pp. 931–935 Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, and Mehdi Soleimanifar. 2021. “[Sample-Efficient Learning of Interacting Quantum Systems](/publications/sample-efficient-learning-interacting-quantum-systems)”. Nature Physics, 17, Pp. 931–935 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1038/s41567-021-01232-0) Learning the Hamiltonian that describes interactions in a quantum system is an important task in both condensed-matter physics and the verification of quantum technologies. Its classical analogue arises as a central problem in machine learning known as... - [ descriptionPublisher's Version](https://doi.org/10.1038/s41567-021-01232-0) ### 2020 Anurag Anshu, David Gosset, and Karen Morenz. 2020. “[Beyond Product State Approximations for a Quantum Analogue of Max Cut](/publications/beyond-product-state-approximations-quantum-analogue-max-cut)”. 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), 158, 1868-8969 Anurag Anshu, David Gosset, and Karen Morenz. 2020. “[Beyond Product State Approximations for a Quantum Analogue of Max Cut](/publications/beyond-product-state-approximations-quantum-analogue-max-cut)”. 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), 158, 1868-8969 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.4230/LIPIcs.TQC.2020.7) We consider a computational problem where the goal is to approximate the maximum eigenvalue of a two-local Hamiltonian that describes Heisenberg interactions between qubits located at the vertices of a graph. Previous work has shed light on this problem’s... - [ descriptionPublisher's Version](https://doi.org/10.4230/LIPIcs.TQC.2020.7) Anurag Anshu. 2020. “[Improved Local Spectral Gap Thresholds for Lattices of Finite Dimension](/publications/improved-local-spectral-gap-thresholds-lattices-finite-dimension)”. Physical Review B, 101, 16 Anurag Anshu. 2020. “[Improved Local Spectral Gap Thresholds for Lattices of Finite Dimension](/publications/improved-local-spectral-gap-thresholds-lattices-finite-dimension)”. Physical Review B, 101, 16 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevB.93.205142) Knabe's theorem lower bounds the spectral gap of a one-dimensional frustration-free local Hamiltonian in terms of the local spectral gaps of finite regions. It also provides a local spectral gap threshold for Hamiltonians that are gapless in the... - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevB.93.205142) Alvaro M. Alhambra, Anurag Anshu, and Henrik Wilming. 2020. “[Revivals Imply Quantum Many-Body Scars](/publications/revivals-imply-quantum-many-body-scars)”. Physical Review B, 101, 20 Alvaro M. Alhambra, Anurag Anshu, and Henrik Wilming. 2020. “[Revivals Imply Quantum Many-Body Scars](/publications/revivals-imply-quantum-many-body-scars)”. Physical Review B, 101, 20 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevB.101.205107) We derive general rigorous results relating revivals in the dynamics of quantum many-body systems to the entanglement properties of energy eigenstates. For a D-dimensional lattice system of N sites initialized in a low-entangled and short-range correlated... - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevB.101.205107) ### 2016 Anurag Anshu. 2016. “[Concentration Bounds for Quantum States With Finite Correlation Length on Quantum Spin Lattice Systems](/publications/concentration-bounds-quantum-states-finite-correlation-length-quantum-spin)”. New Journal of Physics, 18, 8, Pp. 083011 Anurag Anshu. 2016. “[Concentration Bounds for Quantum States With Finite Correlation Length on Quantum Spin Lattice Systems](/publications/concentration-bounds-quantum-states-finite-correlation-length-quantum-spin)”. New Journal of Physics, 18, 8, Pp. 083011 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1088/1367-2630/18/8/083011) We consider the problem of determining the energy distribution of quantum states that satisfy exponential decay of correlation and product states, with respect to a quantum local Hamiltonian on a spin lattice. For a quantum state on a *D*-dimensional... - [ descriptionPublisher's Version](https://doi.org/10.1088/1367-2630/18/8/083011) Anurag Anshu, Itai Arad, and Thomas Vidick. 2016. “[Simple Proof of the Detectability Lemma and Spectral Gap Amplification](/publications/simple-proof-detectability-lemma-and-spectral-gap-amplification)”. Physical Review B, 93, 20, Pp. 205142 Anurag Anshu, Itai Arad, and Thomas Vidick. 2016. “[Simple Proof of the Detectability Lemma and Spectral Gap Amplification](/publications/simple-proof-detectability-lemma-and-spectral-gap-amplification)”. Physical Review B, 93, 20, Pp. 205142 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevB.93.205142) The detectability lemma is a useful tool for probing the structure of gapped ground states of frustration-free Hamiltonians of lattice spin models. The lemma provides an estimate on the error incurred by approximating the ground space projector with a... - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevB.93.205142) Anurag Anshu, Itai Arad, and Aditya Jain. 2016. “[How Local Is the Information in Tensor Networks of Matrix Product States or Projected Entangled Pairs States](/publications/how-local-information-tensor-networks-matrix-product-states-or-projected)”. Physical Review B, 94, 19, Pp. 195143 Anurag Anshu, Itai Arad, and Aditya Jain. 2016. “[How Local Is the Information in Tensor Networks of Matrix Product States or Projected Entangled Pairs States](/publications/how-local-information-tensor-networks-matrix-product-states-or-projected)”. Physical Review B, 94, 19, Pp. 195143 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevB.94.195143) Two-dimensional tensor networks such as projected entangled pairs states (PEPS) are generally hard to contract. This is arguably the main reason why variational tensor network methods in two dimensions are still not as successful as in one dimension... - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevB.94.195143) ## Quantum complexity theory Download 11 citations download- [BibTeX](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124303&&&format=bibtex) - [EndNote X3 XML](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124303&&&format=endnote8) - [EndNote 7 XML](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124303&&&format=endnote7) - [Endnote tagged](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124303&&&format=tagged) - [Marc](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124303&&&format=marc) - [PubMedId](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124303&&&format=pubmed_id) - [RIS](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124303&&&format=ris) ### 2022 Anurag Anshu. 2022. “[Some Recent Progress in Learning Theory: The Quantum Side](/publications/some-recent-progress-learning-theory-quantum-side)”. Harvard Data Science Review, 4.1 Anurag Anshu. 2022. “[Some Recent Progress in Learning Theory: The Quantum Side](/publications/some-recent-progress-learning-theory-quantum-side)”. Harvard Data Science Review, 4.1 - [ descriptionPublisher's Version](https://hdsr.mitpress.mit.edu/pub/3x2sd8nq/release/2) - [ descriptionPublisher's Version](https://hdsr.mitpress.mit.edu/pub/3x2sd8nq/release/2) Anurag Anshu and Chinmay Nirkhe. 2022. “[Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians](/publications/circuit-lower-bounds-low-energy-states-quantum-code-hamiltonians)”. In ITCS 2022. Vol. 215 Anurag Anshu and Chinmay Nirkhe. 2022. “[Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians](/publications/circuit-lower-bounds-low-energy-states-quantum-code-hamiltonians)”. In ITCS 2022. Vol. 215 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://drops.dagstuhl.de/opus/volltexte/2022/15602/) The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings, 2014 -- which posits the existence of a local Hamiltonian with a super-constant quantum circuit lower bound on the complexity of all low-energy states -- identifies a fundamental... - [ descriptionPublisher's Version](https://drops.dagstuhl.de/opus/volltexte/2022/15602/) Anurag Anshu, Zeph Landau, and Yunchao Liu. 2022. “[Distributed Quantum Inner Product Estimation](https://arxiv.org/abs/2111.03273)” Anurag Anshu, Zeph Landau, and Yunchao Liu. 2022. “[Distributed Quantum Inner Product Estimation](https://arxiv.org/abs/2111.03273)” - add\_circle\_outline do\_not\_disturb\_on Abstract As small quantum computers are becoming available on different physical platforms, a benchmarking task known as cross-platform verification has been proposed that aims to estimate the fidelity of states prepared on two quantum computers. This task is... ### 2021 Anurag Anshu, Shalev Ben-David, and Srijita Kundu. 2021. “[On Query-To-Communication Lifting for Adversary Bounds](/publications/query-communication-lifting-adversary-bounds-0)” Anurag Anshu, Shalev Ben-David, and Srijita Kundu. 2021. “[On Query-To-Communication Lifting for Adversary Bounds](/publications/query-communication-lifting-adversary-bounds-0)” - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=14304) We investigate query-to-communication lifting theorems for models related to the quantum adversary bounds. Our results are as follows: 1\) We show that the classical adversary bound lifts to a lower bound on randomized communication complexity with a... - [ descriptionPublisher's Version](https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=14304) ### 2019 Anurag Anshu, Naresh Goud Boddu, and Dave Touchette. 2019. “[Quantum Log-Approximate-Rank Conjecture Is Also False](/publications/quantum-log-approximate-rank-conjecture-also-false)”. 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) Anurag Anshu, Naresh Goud Boddu, and Dave Touchette. 2019. “[Quantum Log-Approximate-Rank Conjecture Is Also False](/publications/quantum-log-approximate-rank-conjecture-also-false)”. 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/FOCS.2019.00063) In a recent breakthrough result, Chattopadhyay, Mande and Sherif \[ECCC TR18-17\] showed an exponential separation between the log approximate rank and randomized communication complexity of a total function f, hence refuting the log approximate rank... - [ descriptionPublisher's Version](https://doi.org/10.1109/FOCS.2019.00063) ### 2018 Anurag Anshu, Ankit Garg, Aram W. Harrow, and Penghui Yao. 2018. “[Expected Communication Cost of Distributed Quantum Tasks](/publications/expected-communication-cost-distributed-quantum-tasks)”. IEEE Transactions on Information Theory, 64, 11, Pp. 7395-7423 Anurag Anshu, Ankit Garg, Aram W. Harrow, and Penghui Yao. 2018. “[Expected Communication Cost of Distributed Quantum Tasks](/publications/expected-communication-cost-distributed-quantum-tasks)”. IEEE Transactions on Information Theory, 64, 11, Pp. 7395-7423 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2018.2849066) A central question in the classical information theory is that of source compression, which is the task where Alice receives a sample from a known probability distribution and needs to transmit it to the receiver Bob with small error. This problem has a... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2018.2849066) ### 2017 Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, and Swagato Sanyal. 2017. “[A Composition Theorem for Randomized Query Complexity](/publications/composition-theorem-randomized-query-complexity)”. Foundations of Software Technology and Theoretical Computer Science Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, and Swagato Sanyal. 2017. “[A Composition Theorem for Randomized Query Complexity](/publications/composition-theorem-randomized-query-complexity)”. Foundations of Software Technology and Theoretical Computer Science - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://arxiv.org/abs/1706.00335) Let the randomized query complexity of a relation for error probability ϵ be denoted by Rϵ(⋅). We prove that for any relation f⊆{0,1}n× and Boolean function g:{0,1}m→{0,1}, R1/3(f∘gn)=Ω(R4/9(f)⋅R1/2−1/n4(g)), where f∘gn is the relation obtained by... - [ descriptionPublisher's Version](https://arxiv.org/abs/1706.00335) Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, and Troy Lee. 2017. “[Separating Quantum Communication and Approximate Rank](/publications/separating-quantum-communication-and-approximate-rank)”. Computational Complexity Conference (CCC) 2017, 79, Pp. 1868-8969 Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, and Troy Lee. 2017. “[Separating Quantum Communication and Approximate Rank](/publications/separating-quantum-communication-and-approximate-rank)”. Computational Complexity Conference (CCC) 2017, 79, Pp. 1868-8969 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.4230/LIPIcs.CCC.2017.24) One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix of H. This measure is essentially equivalent to the... - [ descriptionPublisher's Version](https://doi.org/10.4230/LIPIcs.CCC.2017.24) Anurag Anshu, Dave Touchette, Penghui Yao, and Nengkun Yu. 2017. “[Exponential Separation of Quantum Communication and Classical Information](/publications/exponential-separation-quantum-communication-and-classical-information)”. 49th ACM Symposium on Theory of Computing (STOC) 2017 , Pp. 277–288 Anurag Anshu, Dave Touchette, Penghui Yao, and Nengkun Yu. 2017. “[Exponential Separation of Quantum Communication and Classical Information](/publications/exponential-separation-quantum-communication-and-classical-information)”. 49th ACM Symposium on Theory of Computing (STOC) 2017 , Pp. 277–288 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1145/3055399.3055401) We exhibit a Boolean function for which the quantum communication complexity is exponentially larger than the classical information complexity. An exponential separation in the other direction was already known from the work of Kerenidis et. al. \[SICOMP... - [ descriptionPublisher's Version](https://doi.org/10.1145/3055399.3055401) ### 2016 Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, and Penghui Yao. 2016. “[New One Shot Quantum Protocols With Application to Communication Complexity](/publications/new-one-shot-quantum-protocols-application-communication-complexity)”. IEEE Transactions on Information Theory, 62, 2, Pp. 7566-77 Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, and Penghui Yao. 2016. “[New One Shot Quantum Protocols With Application to Communication Complexity](/publications/new-one-shot-quantum-protocols-application-communication-complexity)”. IEEE Transactions on Information Theory, 62, 2, Pp. 7566-77 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2016.2616125) In this paper, we present the following quantum compression protocol `P': Let ρ,σ be quantum states, such that S (ρ∥σ) def = Tr(ρ log ρ - ρ log σ), the relative entropy between ρ and σ, is finite. Alice gets to know the eigendecomposition of ρ. Bob gets... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2016.2616125) Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Goos, Rahul Jain, Robin Kothari, Troy Lee, and Miklos Santha. 2016. “[Separations in Communication Complexity Using Cheat Sheets and Information Complexity](/publications/separations-communication-complexity-using-cheat-sheets-and-information)”. 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2016 , Pp. 555-64 Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Goos, Rahul Jain, Robin Kothari, Troy Lee, and Miklos Santha. 2016. “[Separations in Communication Complexity Using Cheat Sheets and Information Complexity](/publications/separations-communication-complexity-using-cheat-sheets-and-information)”. 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2016 , Pp. 555-64 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/FOCS.2016.66) While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these measures for a total function is quadratic, witnessed by the disjointness... - [ descriptionPublisher's Version](https://doi.org/10.1109/FOCS.2016.66) ## Quantum Shannon theory Download 18 citations download- [BibTeX](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124304&&&format=bibtex) - [EndNote X3 XML](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124304&&&format=endnote8) - [EndNote 7 XML](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124304&&&format=endnote7) - [Endnote tagged](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124304&&&format=tagged) - [Marc](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124304&&&format=marc) - [PubMedId](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124304&&&format=pubmed_id) - [RIS](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124304&&&format=ris) ### 2022 Anurag Anshu and Rahul Jain. 2022. “[Efficient Methods for One-Shot Quantum Communication](/publications/efficient-methods-one-shot-quantum-communication)”. NPJ Quantum Information Anurag Anshu and Rahul Jain. 2022. “[Efficient Methods for One-Shot Quantum Communication](/publications/efficient-methods-one-shot-quantum-communication)”. NPJ Quantum Information - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://www.nature.com/articles/s41534-022-00608-1) We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two methods for this; the first constructs a resource-efficient convex... - [ descriptionPublisher's Version](https://www.nature.com/articles/s41534-022-00608-1) ### 2021 Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, and Dave Touchette. 2021. “[One-Shot Quantum State Redistribution and Quantum Markov Chains](/publications/one-shot-quantum-state-redistribution-and-quantum-markov-chains)”. IEEE Transactions on Information Theory Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, and Dave Touchette. 2021. “[One-Shot Quantum State Redistribution and Quantum Markov Chains](/publications/one-shot-quantum-state-redistribution-and-quantum-markov-chains)”. IEEE Transactions on Information Theory - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://ieeexplore.ieee.org/document/10121557) We revisit the task of quantum state redistribution in the one-shot setting, and design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains. More precisely, the distance is defined in terms of... - [ descriptionPublisher's Version](https://ieeexplore.ieee.org/document/10121557) Anurag Anshu, Debbie Leung, and Dave Touchette. 2021. “[Incompressibility of Classical Distributions](/publications/incompressibility-classical-distributions)”. IEEE Transactions on Information Theory Anurag Anshu, Debbie Leung, and Dave Touchette. 2021. “[Incompressibility of Classical Distributions](/publications/incompressibility-classical-distributions)”. IEEE Transactions on Information Theory - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://ieeexplore.ieee.org/document/9624960) In blind compression of quantum states, a sender Alice is given a specimen of a quantum state rho drawn from a known ensemble (but without knowing what rho is), and she transmits sufficient quantum data to a receiver Bob so that he can decode a near... - [ descriptionPublisher's Version](https://ieeexplore.ieee.org/document/9624960) ### 2020 Anurag Anshu, Mario Berta, Rahul Jain, and Marco Tomamichel. 2020. “[Partially Smoothed Information Measures](/publications/partially-smoothed-information-measures)”. IEEE Transactions on Information Theory, 66, 8, Pp. 5022-36 Anurag Anshu, Mario Berta, Rahul Jain, and Marco Tomamichel. 2020. “[Partially Smoothed Information Measures](/publications/partially-smoothed-information-measures)”. IEEE Transactions on Information Theory, 66, 8, Pp. 5022-36 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.2981573) Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information theory and cryptography. In typical bi- and multi-partite problems, however, some of the sub-systems are often left unchanged and this is not reflected by the... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.2981573) Anurag Anshu, Mario Berta, Rahul Jain, and Marco Tomamichel. 2020. “[Partially Smoothed Information Measures](/publications/partially-smoothed-information-measures-0)”. IEEE Transactions on Information Theory, 66, 8, Pp. 5022-36 Anurag Anshu, Mario Berta, Rahul Jain, and Marco Tomamichel. 2020. “[Partially Smoothed Information Measures](/publications/partially-smoothed-information-measures-0)”. IEEE Transactions on Information Theory, 66, 8, Pp. 5022-36 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.2981573) Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information theory and cryptography. In typical bi- and multi-partite problems, however, some of the sub-systems are often left unchanged and this is not reflected by the... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.2981573) Anurag Anshu and Penghui Yao. 2020. “[On the Compression of Messages in the Multi-Party Setting](/publications/compression-messages-multi-party-setting)”. IEEE Transactions on Information Theory, 66, 4, Pp. 2091-2114 Anurag Anshu and Penghui Yao. 2020. “[On the Compression of Messages in the Multi-Party Setting](/publications/compression-messages-multi-party-setting)”. IEEE Transactions on Information Theory, 66, 4, Pp. 2091-2114 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.2965114) We consider the following communication task in the multi-party setting, which involves joint random variables X Y Z M N with the property that M is independent of Y Z N conditioned on X, and N is independent of X Z M conditioned on Y . Three parties... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.2965114) Anurag Anshu, Min-Hsiu Hsieh, and Rahul Jain. 2020. “[Noisy Quantum State Redistribution With Promise and the Alpha-Bit](/publications/noisy-quantum-state-redistribution-promise-and-alpha-bit)”. IEEE Transactions on Information Theory, 66, 12, Pp. 7772-86 Anurag Anshu, Min-Hsiu Hsieh, and Rahul Jain. 2020. “[Noisy Quantum State Redistribution With Promise and the Alpha-Bit](/publications/noisy-quantum-state-redistribution-promise-and-alpha-bit)”. IEEE Transactions on Information Theory, 66, 12, Pp. 7772-86 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.3021289) We consider a variation of the well-studied quantum state redistribution task, in which the starting state is known only to the receiver Bob and not to the sender Alice. We refer to this as quantum state redistribution with a one-sided promise. In... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.3021289) Anurag Anshu, Masahito Hayashi, and Naqueeb Ahmad Warsi. 2020. “[Secure Communication over Fully Quantum Gel’fand-Pinsker Wiretap Channel](/publications/secure-communication-over-fully-quantum-gelfand-pinsker-wiretap-channel)”. IEEE Transactions on Information Theory, 66, 9, Pp. 5548-66 Anurag Anshu, Masahito Hayashi, and Naqueeb Ahmad Warsi. 2020. “[Secure Communication over Fully Quantum Gel’fand-Pinsker Wiretap Channel](/publications/secure-communication-over-fully-quantum-gelfand-pinsker-wiretap-channel)”. IEEE Transactions on Information Theory, 66, 9, Pp. 5548-66 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.3005015) In this work we study the problem of secure communication over a fully quantum Gel’fand-Pinsker channel. The best known achievability rate for this channel model in the classical case was proven by Goldfeld, Cuff and Permuter, and here we generalize their... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2020.3005015) Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, and Javier Rodríguez Fonollosa. 2020. “[One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information](/publications/one-shot-capacity-bounds-simultaneous-transmission-classical-and-quantum)”. IEEE Transactions on Information Theory, 66, 4, Pp. 2141-64 Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, and Javier Rodríguez Fonollosa. 2020. “[One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information](/publications/one-shot-capacity-bounds-simultaneous-transmission-classical-and-quantum)”. IEEE Transactions on Information Theory, 66, 4, Pp. 2141-64 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2019.2945800) We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2019.2945800) ### 2019 Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2019. “[A Hypothesis Testing Approach for Communication over Entanglement Assisted Compound Quantum Channel](/publications/hypothesis-testing-approach-communication-over-entanglement-assisted-compound)”. IEEE Transactions on Information Theory, 65, 4, Pp. 2623-36 Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2019. “[A Hypothesis Testing Approach for Communication over Entanglement Assisted Compound Quantum Channel](/publications/hypothesis-testing-approach-communication-over-entanglement-assisted-compound)”. IEEE Transactions on Information Theory, 65, 4, Pp. 2623-36 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2018.2876280) We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically, such a channel is modeled as a collection of conditional probability distributions wherein neither the sender nor the receiver is aware of... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2018.2876280) Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2019. “[On the Near-Optimality of One-Shot Classical Communication over Quantum Channels](/publications/near-optimality-one-shot-classical-communication-over-quantum-channels)”. Journal of Mathematical Physics 60, 60, 1, Pp. 012204 Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2019. “[On the Near-Optimality of One-Shot Classical Communication over Quantum Channels](/publications/near-optimality-one-shot-classical-communication-over-quantum-channels)”. Journal of Mathematical Physics 60, 60, 1, Pp. 012204 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1063/1.5039796) We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum channel, the quantum... - [ descriptionPublisher's Version](https://doi.org/10.1063/1.5039796) Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2019. “[Building Blocks for Communication over Noisy Quantum Networks](/publications/building-blocks-communication-over-noisy-quantum-networks)”. IEEE Transactions on Information Theory 2019, 65, 2, Pp. 1287-1306 Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2019. “[Building Blocks for Communication over Noisy Quantum Networks](/publications/building-blocks-communication-over-noisy-quantum-networks)”. IEEE Transactions on Information Theory 2019, 65, 2, Pp. 1287-1306 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2018.2851297) A capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information-theoretic question is very well studied specially in the setting of many independent uses of the channel. An... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2018.2851297) Anurag Anshu, Mario Berta, Rahul Jain, and Marco Tomamichel. 2019. “[A Minimax Approach to One-Shot Entropy Inequalities](/publications/minimax-approach-one-shot-entropy-inequalities)”. Journal of Mathematical Physics 60, 60, 12, Pp. 122201 Anurag Anshu, Mario Berta, Rahul Jain, and Marco Tomamichel. 2019. “[A Minimax Approach to One-Shot Entropy Inequalities](/publications/minimax-approach-one-shot-entropy-inequalities)”. Journal of Mathematical Physics 60, 60, 12, Pp. 122201 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1063/1.5126723) One-shot information theory entertains a plethora of entropic quantities, such as the smooth max-divergence, hypothesis testing divergence, and information spectrum divergence, that characterize various operational tasks in quantum information theory and... - [ descriptionPublisher's Version](https://doi.org/10.1063/1.5126723) Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2019. “[Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction](/publications/convex-split-and-hypothesis-testing-approach-one-shot-quantum-measurement)”. IEEE Transactions on Information Theory, 66, 9, Pp. 5905-24 Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2019. “[Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction](/publications/convex-split-and-hypothesis-testing-approach-one-shot-quantum-measurement)”. IEEE Transactions on Information Theory, 66, 9, Pp. 5905-24 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2019.2915242) This paper concerns the problem of quantum measurement compression with side information in the one-shot setting with shared-randomness. In this problem, Alice shares a pure quantum state with Bob and the reference system. She performs a measurement on... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2019.2915242) ### 2018 Anurag Anshu, Min-Hsiu Hsieh, and Rahul Jain. 2018. “[Quantifying Resources in General Resource Theory With Catalysts](/publications/quantifying-resources-general-resource-theory-catalysts)”. Physical Review Letters, 121, 19, Pp. 190504 Anurag Anshu, Min-Hsiu Hsieh, and Rahul Jain. 2018. “[Quantifying Resources in General Resource Theory With Catalysts](/publications/quantifying-resources-general-resource-theory-catalysts)”. Physical Review Letters, 121, 19, Pp. 190504 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevLett.121.190504) A question that is commonly asked in all areas of physics is how a certain property of a physical system can be used to achieve useful tasks and how to quantify the amount of such a property in a meaningful way. We answer this question by showing that, in... - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevLett.121.190504) Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2018. “[A Generalized Quantum Slepian-Wolf](/publications/generalized-quantum-slepian-wolf)”. IEEE Transactions on Information Theory, 64, 3, Pp. 1436-53 Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2018. “[A Generalized Quantum Slepian-Wolf](/publications/generalized-quantum-slepian-wolf)”. IEEE Transactions on Information Theory, 64, 3, Pp. 1436-53 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2017.2786348) In this paper, we consider a quantum generalization of the task considered by Slepian and Wolf regarding distributed source compression. In our task, Alice, Bob, Charlie, and Reference share a joint pure state. Alice and Bob wish to send a part of their... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2017.2786348) Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2018. “[A One-Shot Achievability Result for Quantum State Redistribution](/publications/one-shot-achievability-result-quantum-state-redistribution)”. IEEE Transactions on Information Theory 2018 , 64, 3, Pp. 1425-35 Anurag Anshu, Rahul Jain, and Naqueeb Ahmad Warsi. 2018. “[A One-Shot Achievability Result for Quantum State Redistribution](/publications/one-shot-achievability-result-quantum-state-redistribution)”. IEEE Transactions on Information Theory 2018 , 64, 3, Pp. 1425-35 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2017.2776112) We study the problem of entanglement-assisted quantum state redistribution in the one-shot setting and provide a new achievability result on the quantum communication required. Our bounds are in terms of the max-relative entropy and the hypothesis testing... - [ descriptionPublisher's Version](https://doi.org/10.1109/TIT.2017.2776112) ### 2017 Anurag Anshu, Vamsi Krishna Devabathini, and Rahul Jain. 2017. “[Quantum Communication Using Coherent Rejection Sampling](/publications/quantum-communication-using-coherent-rejection-sampling)”. Physical Review Letters, 119, 12, Pp. 120506 Anurag Anshu, Vamsi Krishna Devabathini, and Rahul Jain. 2017. “[Quantum Communication Using Coherent Rejection Sampling](/publications/quantum-communication-using-coherent-rejection-sampling)”. Physical Review Letters, 119, 12, Pp. 120506 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevLett.119.120506) Compression of a message up to the information it carries is key to many tasks involved in classical and quantum information theory. Schumacher \[B. Schumacher, Phys. Rev. A 51, 2738 (1995)\] provided one of the first quantum compression schemes and several... - [ descriptionPublisher's Version](https://doi.org/10.1103/PhysRevLett.119.120506) ## Some assorted publications Download 4 citations download- [BibTeX](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124305&&&format=bibtex) - [EndNote X3 XML](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124305&&&format=endnote8) - [EndNote 7 XML](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124305&&&format=endnote7) - [Endnote tagged](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124305&&&format=tagged) - [Marc](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124305&&&format=marc) - [PubMedId](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124305&&&format=pubmed_id) - [RIS](/bibcite/export?pager_style=no_pager&number_of_items=30&sort_field=bibcite_year--desc&taxonomy_filters%5Bfield_hwp_c_publications12345678%5D%5B0%5D%5Btarget_id%5D=124305&&&format=ris) ### 2020 Anurag Anshu, Peter Hoyer, Mehdi Mhalla, and Simon Perdrix. 2020. “[Contextuality in Multipartite Pseudo-Telepathy Graph Games](/publications/contextuality-multipartite-pseudo-telepathy-graph-games)”. Journal of Computer and System Sciences, 107, Pp. 156-65 Anurag Anshu, Peter Hoyer, Mehdi Mhalla, and Simon Perdrix. 2020. “[Contextuality in Multipartite Pseudo-Telepathy Graph Games](/publications/contextuality-multipartite-pseudo-telepathy-graph-games)”. Journal of Computer and System Sciences, 107, Pp. 156-65 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1016/j.jcss.2019.06.005) Analyzing pseudo-telepathy graph games, we propose a way to build contextuality scenarios exhibiting the quantum supremacy using graph states. We consider the combinatorial structures generating equivalent scenarios. We introduce a new tool called... - [ descriptionPublisher's Version](https://doi.org/10.1016/j.jcss.2019.06.005) ### 2017 Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi, and Satyanarayana Vusirikala. 2017. “[On the Rectilinear Crossing Number of Complete Uniform Hypergraphs](/publications/rectilinear-crossing-number-complete-uniform-hypergraphs)”. Computational Geometry, 61, Pp. 38-47 Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi, and Satyanarayana Vusirikala. 2017. “[On the Rectilinear Crossing Number of Complete Uniform Hypergraphs](/publications/rectilinear-crossing-number-complete-uniform-hypergraphs)”. Computational Geometry, 61, Pp. 38-47 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.1016/j.comgeo.2016.11.001) In this paper, we consider a generalized version of the rectilinear crossing number problem of drawing complete graphs on a plane. The minimum number of crossing pairs of hyperedges in the d-dimensional rectilinear drawing of a d-uniform hypergraph is... - [ descriptionPublisher's Version](https://doi.org/10.1016/j.comgeo.2016.11.001) ### 2016 Anurag Anshu and Saswata Shannigrahi. 2016. “[A Lower Bound on the Crossing Number of Uniform Hypergraphs](/publications/lower-bound-crossing-number-uniform-hypergraphs)”. Discrete Applied Mathematics, 209, Pp. 11-15 Anurag Anshu and Saswata Shannigrahi. 2016. “[A Lower Bound on the Crossing Number of Uniform Hypergraphs](/publications/lower-bound-crossing-number-uniform-hypergraphs)”. Discrete Applied Mathematics, 209, Pp. 11-15 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://www.sciencedirect.com/science/article/pii/S0166218X15004965) In this paper, we consider the embedding of a complete d-uniform geometric hypergraph with n vertices in general position in Rd, where each hyperedge is represented as a (d−1)-simplex, and a pair of hyperedges is defined to cross if they are vertex... - [ descriptionPublisher's Version](https://www.sciencedirect.com/science/article/pii/S0166218X15004965) ### 2013 Anurag Anshu and Mehdi Mhalla. 2013. “[Pseudo-Telepathy Games Using Graph States](/publications/pseudo-telepathy-games-using-graph-states)”. Quantum Information and Computation, 13, 9-10, Pp. 0833-45 Anurag Anshu and Mehdi Mhalla. 2013. “[Pseudo-Telepathy Games Using Graph States](/publications/pseudo-telepathy-games-using-graph-states)”. Quantum Information and Computation, 13, 9-10, Pp. 0833-45 - add\_circle\_outline do\_not\_disturb\_on Abstract - [ descriptionPublisher's Version](https://doi.org/10.26421/QIC13.9-10-6) We define a family of pseudo-telepathy games using graph states that extends the Mermin games. This family also contains a game used to define a quantum probability distribution that cannot be simulated by any number of PR boxes. We extend this result... - [ descriptionPublisher's Version](https://doi.org/10.26421/QIC13.9-10-6)