Recherche
Contextuality in composite systems: entanglement vs. the Kochen-Specker theorem The Kochen-Specker (KS) theorem is often taken as a notion of
Quantum Chemistry and Physics have been identified as key applications for quantum computers and quantum algorithms have been designed to solve the
On the one hand, the use of graphical language in quantum computing for the representation of algorithms, although intuitive, is not very useful for
Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries
Runtime verification consists in checking whether a program satisfies a given specification by observing the trace it produces during its execution
Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which
k-block-positivity is an important concept in quantum entanglement theory. A k-block-positive operator serves as a witness for states with Schmidt
In this talk, I will present the research activities undertaken by our group focused on the study of the electronic structure of molecular systems
Towards “Good-Enough” Quantum Low-Density Parity-Check Codes The accumulation of errors in quantum computers obstructs the execution of powerful