7 citations · 10 across the 6 of their papers we have counts for
6 papers
Pauli Encodings & Unclonable Encryption
Pierre Botteron, Sébastien Designolle, Omar Fawzi
The unclonable bit question asks whether quantum encryption can prevent an adversary from producing two systems that both reveal the plaintext once the key is disclosed. We introdu…
Nonlocal Games Through Communication Complexity and Quantum Cryptography
Pierre Botteron
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the…
Towards Unconditional Uncloneable Encryption
Pierre Botteron, Anne Broadbent, Eric Culf +3
Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of…
Communication Complexity of Graph Isomorphism, Coloring, and Distance Games
Pierre Botteron, Moritz Weber
In quantum information, nonlocal games are particularly useful for differentiating classical, quantum, and non-signalling correlations. An example of differentiation is given by th…
Algebra of Nonlocal Boxes and the Collapse of Communication Complexity
Pierre Botteron, Anne Broadbent, Reda Chhaibi +2
Communication complexity quantifies how difficult it is for two distant computers to evaluate a function f(X,Y), where the strings X and Y are distributed to the first and second c…
Extending the Known Region of Nonlocal Boxes that Collapse Communication Complexity
Pierre Botteron, Anne Broadbent, Marc-Olivier Proulx
Non-signalling boxes (NS) are theoretical resources defined by the principle of no-faster-than-light communication. They generalize quantum correlations, and some of them are known…