QLunch: Mikka Stasiuk

Speaker: Mikka Stasiuk

Abstract: A question ubiquitous in many areas of quantum information theory is the amount of entanglement necessary to perform a given computation under specified resource constraints. In the context of certain classes of non-local quantum computation (NLQC), a characterization of entanglement cost would imply significant breakthroughs in complexity theory, with further applications in quantum position-verification, AdS/CFT, and Hamiltonian complexity. In this work, we address the question of resource requirements in NLQC in the framework of a complexity theorist, asking for not explicit calculations, but rather resource-efficient reductions between different classes of NLQC.