Recherche
On the one hand, the use of graphical language in quantum computing for the representation of algorithms, although intuitive, is not very useful for
(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of
In this talk we will discuss to what extent entanglement is a "feelable" (or efficiently observable) quantity of quantum systems. Inspired by recent
k-block-positivity is an important concept in quantum entanglement theory. A k-block-positive operator serves as a witness for states with Schmidt
Measurement incompatibility vs. Bell non-locality: an approach via tensor norms. Measurement incompatibility and quantum non-locality are two key
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
Towards “Good-Enough” Quantum Low-Density Parity-Check Codes The accumulation of errors in quantum computers obstructs the execution of powerful
In the first half of the talk, I will talk about the EXPSPACE lower bound for PTA reachability developed during my phd thesis. Parametric timed