5 papers
How hard is it to verify a classical shadow?
Georgios Karaiskos, Dorian Rudolph, Johannes Jakob Meyer +2
Classical shadows are succinct classical representations of quantum states which allow one to encode a set of properties P of a quantum state rho, while only requiring measurements…
Computational relative entropy
Johannes Jakob Meyer, Asad Raza, Jacopo Rizzo +3
Our capacity to process information depends on the computational power at our disposal. Information theory captures our ability to distinguish states or communicate messages when i…
Query complexities of quantum channel discrimination and estimation: A unified approach
Zixin Huang, Johannes Jakob Meyer, Theshani Nuradha +1
The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity o…
The computational two-way quantum capacity
Johannes Jakob Meyer, Jacopo Rizzo, Asad Raza +3
Quantum channel capacities are fundamental to quantum information theory. Their definition, however, does not limit the computational resources of sender and receiver. In this work…
Potential and limitations of random Fourier features for dequantizing quantum machine learning
Ryan Sweke, Erik Recio-Armengol, Sofiene Jerbi +4
Quantum machine learning is arguably one of the most explored applications of near-term quantum devices. Much focus has been put on notions of variational quantum machine learning…