Carmen M. Constantin

dblp:187/4157 · also Carmen Maria Constantin · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0003-4508-9312ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2024 Commutation Groups and State-Independent Contextuality
abstract
We introduce an algebraic structure for studying state-independent contextuality arguments, a key form of quantum non-classicality exemplified by the well-known Peres-Mermin magic square, and used as a source of quantum advantage. We introduce commutation groups presented by generators and relations, and analyse them in terms of a string rewriting system. There is also a linear algebraic construction, a directed version of the Heisenberg group. We introduce contextual words as a general form of contextuality witness. We characterise when contextual words can arise in commutation groups, and explicitly construct non-contextual value assignments in other cases. We give unitary representations of commutation groups as subgroups of generalized Pauli n-groups.
Samson Abramsky, Serban-Ion Cercelescu, Carmen M. Constantin
FSCD3
2022 Localisable Monads
abstract
Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip monads with fine-grained structure in a ''top-down'' way, using techniques from tensor topology. This provides an intrinsic theory of local computational effects without needing to know how constituent effects interact beforehand. Specifically, any monoidal category decomposes as a sheaf of local categories over a base space. We identify a notion of localisable monads which characterises when a monad decomposes as a sheaf of monads. Equivalently, localisable monads are formal monads in an appropriate presheaf 2-category, whose algebras we characterise. Three extended examples demonstrate how localisable monads can interpret the base space as locations in a computer memory, as sites in a network of interacting agents acting concurrently, and as time in stochastic processes.
Carmen M. Constantin, Nuiok Dicaire, Chris Heunen
CSL1
2016 Hardy is (almost) everywhere: Nonlocality without inequalities for almost all entangled multipartite states
Samson Abramsky, Carmen M. Constantin, Shenggang Ying
Inf. Comput.2