The study of ground state energies of local Hamiltonians has played a fundamental role in quantum complexity theory. In this article, we take a new direction by introducing the physically motivatedâ€¦ (More)

In this work we study the sets of two-party correlations generated from a Bell scenario involving two spatially separated systems with respect to various physical models. We show that the sets ofâ€¦ (More)

The class QMA plays a fundamental role in quantum complexity theory and it has found surprising connections to condensed matter physics and in particular in the study of the minimum energy of quantumâ€¦ (More)

Random Access Codes is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an n-bit string x, and wishes toâ€¦ (More)

Encoding information in quantum systems can offer surprising advantages but at the same time there are limitations that arise from the fact that measuring an observable may disturb the state of theâ€¦ (More)

An nÃ—n matrix X is called completely positive semidefinite (cpsd) if there exist dÃ—d Hermitian positive semidefinite matrices {Pi}i=1 (for some d â‰¥ 1) such that Xij = Tr(PiPj), for all i, j âˆˆ {1, . .â€¦ (More)

We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each ofâ€¦ (More)

Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest playersâ€™â€¦ (More)

Coin-flipping is a cryptographic task in which two physically separated, mistrustful parties wish to generate a fair coin-flip by communicating with each other. Chailloux and Kerenidis (2009)â€¦ (More)