Understanding the speed with which various classes of quantum systems can scramble information is a key goal of quantum information theory, with relevance to both fundamental physics and the study of the efficiency of quantum algorithms. Famously, such understanding enabled Hayden and Preskill to show that, under the a...
Classical shadow tomography is widely touted as supplying a family of methods for extracting information from quantum systems with polynomially scaling sample-complexities. In the current era of quantum computers possessing on the order of hundreds of qubits, however, polynomial scaling can nonetheless be prohibitive....
Maxwell West, Su-Ye-On Chang, Luke Coffman et al.· 2 citations
Deciding whether an unknown quantum state either belongs to, or is far from, a given family of states is a natural question of quantum information theory. In many such cases, there is a natural 2-copy test which always accepts whenever the state indeed belongs to the target family; it is often much more difficult, howe...
Understanding the resources required to generate approximately random unitaries over various groups is a natural goal of quantum information theory. With respect to one notion of approximation, that of a design, it is known that the full unitary group can be approximated in logarithmic depth by one-dimensional circuits...
Maxwell West, M. Cerezo, Martín Larocca· 4 citations
It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$,...
Rebecca Chang, Matthias C. Caro, Martín Larocca et al.· 6 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.