activity
20122026
most citedLearning shallow quantum circuits

24 citations · 36 across the 12 of their papers we have counts for

collaborators
Showing quant-phShow all

20 papers · 1 filter

quant-ph2026

Depth-1 expanders on the unitary group and applications

Anurag Anshu, Shankar Balasubramanian, Jonas Haferkamp +2

We construct a constant-degree and constant-gap quantum expander on qubits where each unitary can be implemented by a depth- and 1D circuit of Pauli or CNOT gates. We provid…

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

quant-ph2024

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-ph2024★ 1 cited

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…