collaborators

6 papers

quant-ph2026

Partially smoothed information measures

Anurag Anshu, Mario Berta, Rahul Jain +1

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 su…

quant-ph2026

An energy-based uncertainty principle and low-energy state preparation

Anurag Anshu

Preparing low-energy states of many-body Hamiltonians is a central challenge in quantum computing, quantum complexity, and condensed matter physics. Existing approaches often get t…

quant-ph2026

Randomness compression in communication networks

Yukari Uchibori, Alice Zheng, Anurag Anshu +1

Given a correlation generated by a (possibly quantum) communication network, we study the amount of shared randomness required to generate it. We develop a novel upper bound for ap…

quant-ph2025

On the Computational Power of QAC0 with Barely Superlinear Ancillae

Anurag Anshu, Yangjing Dong, Fengning Ou +1

is the family of constant-depth polynomial-size quantum circuits consisting of arbitrary single qubit unitaries and multi-qubit Toffoli gates. It was introduced by…

quant-ph2025

On the complexity of unique quantum witnesses and quantum approximate counting

Anurag Anshu, Jonas Haferkamp, Yeongwoo Hwang +1

We study the long-standing open question on the power of unique witnesses in quantum protocols, which asks if , a variant of whose accepting witn…

quant-ph2025

Learning quantum Gibbs states locally and efficiently

Chi-Fang Chen, Anurag Anshu, Quynh T. Nguyen

Learning the Hamiltonian underlying a quantum many-body system in thermal equilibrium is a fundamental task in quantum learning theory and experimental sciences. To learn the Gibbs…