Quantum Information

We give the first instance-optimal sample complexity bounds for shadow tomography using few-copy measurements in the high-precision regime. More concretely, we study the problem of learning expectation values of a given set of observables of an unknown quantum state to precision $\epsilon$ in $L_p$…

I will discuss some surprising examples of quantum circuits that can be realized in constant T-depth. Some of these constructions, such as single-qubit rotation and its programmable variants, as well as quantum part of Shor's factoring algorithm, require a catalyst state. But there are also other…

The Generalized Quantum Stein's Lemma is a theorem in quantum hypothesis testing that provides an operational meaning to the relative entropy within the context of quantum resource theories. Its original proof was found to have a gap, which led to a search for a corrected proof. We formalize the…

Decoded Quantum Interferometry (DQI) has been recently proposed as a new quantum algorithm for optimization. Hamiltonian Decoded Quantum Interferometry (HDQI), an extension of DQI, adapts this paradigm to Hamiltonian optimization and Gibbs state preparation. In this work, I will introduce HDQI for…

Non-local quantum computation studies the complexity of implementing quantum channels non-locally and has fascinating connections to cryptography, complexity theory and quantum gravity. In this talk, I will survey some of these connections, with an emphasis on circuit and communication complexity…

As a class of generative artificial intelligence frameworks inspired by statistical physics, diffusion models have shown extraordinary performance in synthesizing complicated data distributions through a denoising process gradually guided by score functions. Real-life data, like images, is often…