12 citations · 27 across the 4 of their papers we have counts for
9 papers · 1 filter
On The Round Complexity of Secure Quantum Computation
James Bartusek, Andrea Coladangelo, Dakshita Khurana +1
We construct the first constant-round protocols for secure quantum computation in the two-party (2PQC) and multi-party (MPQC) settings with security against malicious adversaries.…
A Quantum Money Solution to the Blockchain Scalability Problem
Andrea Coladangelo, Or Sattath
We put forward the idea that classical blockchains and smart contracts are potentially useful primitives not only for classical cryptography, but for quantum cryptography as well.…
Non-interactive zero-knowledge arguments for QMA, with preprocessing
Andrea Coladangelo, Thomas Vidick, Tina Zhang
We initiate the study of non-interactive zero-knowledge (NIZK) arguments for languages in QMA. Our first main result is the following: if Learning With Errors (LWE) is hard for qua…
Additive entanglemement measures cannot be more than asymptotically continuous
Andrea Coladangelo, Debbie Leung
In this short note, we show that any non-constant quantity defined on density matrices that is additive on tensor products and invariant under permutations cannot be "more than asy…
A two-player dimension witness based on embezzlement, and an elementary proof of the non-closure of the set of quantum correlations
Andrea Coladangelo
We describe a two-player non-local game, with a fixed small number of questions and answers, such that an -close to optimal strategy requires an entangled state of dimension $2^…
Smart contracts meet quantum cryptography
Andrea Coladangelo
We put forward the idea that classical blockchains and smart contracts are potentially useful primitives not only for classical cryptography, but for quantum cryptography as well.…