A quantum impurity model describes a small interacting subsystem embedded into a large bath of free fermions. Here we study the computational complexity of calculating the ground energy, thermal equilibrium, and dynamical properties of these models. Our work reveals a sharp contrast: equilibrium properties can be effic...
Srinivasan Arunachalam, S. Bravyi, Anirban Narayan Chowdhury et al.· 0 citations
We construct protocols for classically verifiable quantum advantage and classical verification of $\mathsf{BQP}$ computations using \emph{quantum indistinguishability obfuscation} (qiO). Specifically, given qiO and assuming a slightly stronger version of $\mathsf{BQP}\neq\mathsf{BPP}$, we construct a two-message quantu...
Alexandru Gheorghiu, A. Gupte, Vojtěch Havlíček et al.· 0 citations
This paper gives a sampling problem that is solvable by shallow quantum circuits, hard for polynomial-time classical algorithms under lattice-based assumptions, and efficiently verifiable by a classical computer, and shows that shallow quantum circuits have sufficient structure to solve certain classically hard tasks w...
Alexandru Gheorghiu· 4 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.