6 papers
Verification Complexity and Extension of Classical Shadows
Georgios Karaiskos, Asad Raza, Dorian Rudolph +2
Classical shadows are an influential framework for compressing copies of a given quantum state into classical data , enabling many properties of to be predicted from rel…
Distinctness threshold for pseudorandom unitaries
Asad Raza, Jens Eisert, Bill Fefferman
Pseudorandomness is increasingly recognized as a key property of ensembles in quantum information theory, statistical mechanics, and quantum many-body physics. Yet it appears in tw…
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…
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…
Complexity of geometrically local stoquastic Hamiltonians
Asad Raza, Jens Eisert, Alex B. Grilo
The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of Hamiltonian complexity that studies the computational complexity of problems in quantum m…
Online learning of quantum processes
Asad Raza, Matthias C. Caro, Jens Eisert +1
Among recent insights into learning quantum states, online learning and shadow tomography procedures are notable for their ability to accurately predict expectation values even of…