Clément Pellegrini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Clément Pellegrini has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Tristan Benoist
Université de Toulouse, INUC, UT2J, INSA Toulouse, TSE, CNRS, IMT 2 , Toulouse
15 shared publications - Ion Nechita
Laboratoire de Physique Théorique, CNRS, UPS, Université de Toulouse, Toulouse, France
9 shared publications - Reda Chhaibi
Institut de mathématiques, UMR5219, Université de Toulouse, CNRS, UPS, Toulouse, France
7 shared publications - Cédric Bernardin
Faculty of Mathematics, National Research University Higher School of Economics, Moscow, Russia
5 shared publications - Joseph Najnudel
University of Bristol, Bristol, UK
4 shared publications - Martin Fraas
Department of Mathematics University of Califonia Davis Davis 95616 USA
4 shared publications
Latest Publications
- Open Access
- 1 August 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (8)
Asymptotic stability and ergodic properties of quantum trajectories under imperfect measurement
We investigate the asymptotic stability and ergodic properties of quantum trajectories under imperfect measurement, extending previous results established for the ideal case of perfect measurement. We establish a necessary and sufficient condition ensuring the convergence of the estimated trajectory, initialized from an estimated state, to the true trajectory. This result is obtained assuming that the associated quantum channel is irreducible. Building on this, we prove the uniqueness of the invariant measure and demonstrate convergence toward this measure.
- 1 August 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (8)
Open AccessAsymptotic stability and ergodic properties of quantum trajectories under imperfect measurement
We investigate the asymptotic stability and ergodic properties of quantum trajectories under imperfect measurement, extending previous results established for the ideal case of perfect measurement. We establish a necessary and sufficient condition ensuring the convergence of the estimated trajectory, initialized from an estimated state, to the true trajectory. This result is obtained assuming that the associated quantum channel is irreducible. Building on this, we prove the uniqueness of the invariant measure and demonstrate convergence toward this measure.
- Open Access
Entanglement in the Dicke subspace
In this paper, we provide a complete mathematical theory for the entanglement of mixtures of Dicke states. These quantum states form an important subclass of bosonic states arising in the study of indistinguishable particles. We introduce a tensor-based parametrization where the diagonal entries of these states are encoded as a symmetric tensor, enabling a direct translation between entanglement properties and well-studied convex cones of tensors. Our results bridge multipartite entanglement theory with semialgebraic geometry and the theory of completely positive and copositive tensors. This dictionary maps separability to completely positive tensors, the PPT property to moment tensors, entanglement witnesses to copositive tensors, and decomposable witnesses to sum of squares tensors. Using this framework, we construct explicit PPT entangled states in three or more qutrits. In this class of states, we establish that PPT entanglement exists for all multipartite systems with three qutrits or more, disproving a recent conjecture in [J. Math. Phys. 66, 022203 (2025)]. We also show that, for mixtures of Dicke states, the PPT condition with respect to the most balanced bipartition implies PPT with respect to any other bipartition. We further connect bosonic extendibility of mixtures of Dicke states to the duals of known hierarchies for non-negative polynomials, such as the ones by Reznick and Polya. We thus provide semidefinite programming relaxations for separability and entanglement testing in the Dicke subspace.
Open AccessEntanglement in the Dicke subspace
In this paper, we provide a complete mathematical theory for the entanglement of mixtures of Dicke states. These quantum states form an important subclass of bosonic states arising in the study of indistinguishable particles. We introduce a tensor-based parametrization where the diagonal entries of these states are encoded as a symmetric tensor, enabling a direct translation between entanglement properties and well-studied convex cones of tensors. Our results bridge multipartite entanglement theory with semialgebraic geometry and the theory of completely positive and copositive tensors. This dictionary maps separability to completely positive tensors, the PPT property to moment tensors, entanglement witnesses to copositive tensors, and decomposable witnesses to sum of squares tensors. Using this framework, we construct explicit PPT entangled states in three or more qutrits. In this class of states, we establish that PPT entanglement exists for all multipartite systems with three qutrits or more, disproving a recent conjecture in [J. Math. Phys. 66, 022203 (2025)]. We also show that, for mixtures of Dicke states, the PPT condition with respect to the most balanced bipartition implies PPT with respect to any other bipartition. We further connect bosonic extendibility of mixtures of Dicke states to the duals of known hierarchies for non-negative polynomials, such as the ones by Reznick and Polya. We thus provide semidefinite programming relaxations for separability and entanglement testing in the Dicke subspace.
- 2 January 2026
- Published by Springer Nature
- p. 31-47
Learning to Repair Infeasible$^*$ Problems with Deep Reinforcement Learning on Graphs- 2 January 2026
- Published by Springer Nature
- p. 31-47
Learning to Repair Infeasible$^*$ Problems with Deep Reinforcement Learning on Graphs- 11 November 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (3-4) , 1-53
To spike or not to spike: the whims of the Wonham filter in the strong noise regime
- 11 November 2025
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 195 (3-4) , 1-53
To spike or not to spike: the whims of the Wonham filter in the strong noise regime
- Open Access
- 17 September 2025
- Published by Springer Nature in Annales Henri Poincare
- Vol. 27 (10) , 1-53
Quantum Model Reduction for Continuous-Time Quantum Filters
The use of quantum stochastic models is widespread in dynamical reduction, simulation of open systems, feedback control and adaptive estimation. In many applications only part of the information contained in the filter’s state is actually needed to reconstruct the target observable quantities; thus, filters of smaller dimensions could be in principle implemented to perform the same task. In this work, we propose a systematic method to find, when possible, reduced-order quantum filters that are capable of exactly reproducing the evolution of expectation values of interest. In contrast with existing reduction techniques, the reduced model we obtain is exact and in the form of a Belavkin filtering equation, ensuring physical interpretability. This is attained by leveraging tools from the theory of both minimal realization and non-commutative conditional expectations. The proposed procedure is tested on prototypical examples, laying the groundwork for applications in quantum trajectory simulation and quantum feedback control.
- 17 September 2025
- Published by Springer Nature in Annales Henri Poincare
- Vol. 27 (10) , 1-53
Open AccessQuantum Model Reduction for Continuous-Time Quantum Filters
The use of quantum stochastic models is widespread in dynamical reduction, simulation of open systems, feedback control and adaptive estimation. In many applications only part of the information contained in the filter’s state is actually needed to reconstruct the target observable quantities; thus, filters of smaller dimensions could be in principle implemented to perform the same task. In this work, we propose a systematic method to find, when possible, reduced-order quantum filters that are capable of exactly reproducing the evolution of expectation values of interest. In contrast with existing reduction techniques, the reduced model we obtain is exact and in the form of a Belavkin filtering equation, ensuring physical interpretability. This is attained by leveraging tools from the theory of both minimal realization and non-commutative conditional expectations. The proposed procedure is tested on prototypical examples, laying the groundwork for applications in quantum trajectory simulation and quantum feedback control.
- 9 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (19) , 195303
A physical noise model for quantum measurements
In this paper, we introduce a novel noise model for quantum measurements motivated by an indirect measurement scheme with faulty preparation. Averaging over random dynamics governing the interaction between the quantum system and a probe, a natural and physical noise model emerges. We compare it to existing noise models (uniform and depolarizing) in the framework of incompatibility robustness. We observe that our model allows for larger compatibility regions for specific classes of measurements.
- 9 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (19) , 195303
A physical noise model for quantum measurements
In this paper, we introduce a novel noise model for quantum measurements motivated by an indirect measurement scheme with faulty preparation. Averaging over random dynamics governing the interaction between the quantum system and a probe, a natural and physical noise model emerges. We compare it to existing noise models (uniform and depolarizing) in the framework of incompatibility robustness. We observe that our model allows for larger compatibility regions for specific classes of measurements.
- Open Access
Dark Subspaces and Invariant Measures of Quantum Trajectories
Quantum trajectories are Markov processes describing the evolution of a quantum system subject to indirect measurements. They can be viewed as place dependent iterated function systems or the result of products of dependent and non identically distributed random matrices. In this article, we establish a complete classification of their invariant measures. The classification is done in two steps. First, we prove a Markov process on some linear subspaces called dark subspaces, defined in (Maassen, Kümmerer 2006), admits a unique invariant measure. Second, we study the process inside the dark subspaces. Using a notion of minimal family of isometries from a reference space to dark subspaces, we prove a set of measures indexed by orbits of a unitary group is the set of ergodic measures of quantum trajectories.
Open AccessDark Subspaces and Invariant Measures of Quantum Trajectories
Quantum trajectories are Markov processes describing the evolution of a quantum system subject to indirect measurements. They can be viewed as place dependent iterated function systems or the result of products of dependent and non identically distributed random matrices. In this article, we establish a complete classification of their invariant measures. The classification is done in two steps. First, we prove a Markov process on some linear subspaces called dark subspaces, defined in (Maassen, Kümmerer 2006), admits a unique invariant measure. Second, we study the process inside the dark subspaces. Using a notion of minimal family of isometries from a reference space to dark subspaces, we prove a set of measures indexed by orbits of a unitary group is the set of ergodic measures of quantum trajectories.
- Open Access
- 10 July 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1402
Algebra of Nonlocal Boxes and the Collapse of Communication Complexity
Communication complexity quantifies how difficult it is for two distant computers to evaluate a function, where the stringsandare distributed to the first and second computer respectively, under the constraint of exchanging as few bits as possible. Surprisingly, some nonlocal boxes, which are resources shared by the two computers, are so powerful that they allow tocommunication complexity, in the sense that any Boolean function f can be correctly estimated with the exchange of only one bit of communication. The Popescu-Rohrlich (PR) box is an example of such a collapsing resource, but a comprehensive description of the set of collapsing nonlocal boxes remains elusive.In this work, we carry out an algebraic study of the structure of wirings connecting nonlocal boxes, thus defining the notion of the "product of boxes", and we show related associativity and commutativity results. This gives rise to the notion of the "orbit of a box", unveiling surprising geometrical properties about the alignment and parallelism of distilled boxes. The power of this new framework is that it allows us to prove previously-reported numerical observations concerning the best way to wire consecutive boxes, and to numerically and analytically recover recently-identified noisyboxes that collapse communication complexity for different types of noise models.- 10 July 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1402
Open AccessAlgebra of Nonlocal Boxes and the Collapse of Communication Complexity
Communication complexity quantifies how difficult it is for two distant computers to evaluate a function, where the stringsandare distributed to the first and second computer respectively, under the constraint of exchanging as few bits as possible. Surprisingly, some nonlocal boxes, which are resources shared by the two computers, are so powerful that they allow tocommunication complexity, in the sense that any Boolean function f can be correctly estimated with the exchange of only one bit of communication. The Popescu-Rohrlich (PR) box is an example of such a collapsing resource, but a comprehensive description of the set of collapsing nonlocal boxes remains elusive.In this work, we carry out an algebraic study of the structure of wirings connecting nonlocal boxes, thus defining the notion of the "product of boxes", and we show related associativity and commutativity results. This gives rise to the notion of the "orbit of a box", unveiling surprising geometrical properties about the alignment and parallelism of distilled boxes. The power of this new framework is that it allows us to prove previously-reported numerical observations concerning the best way to wire consecutive boxes, and to numerically and analytically recover recently-identified noisyboxes that collapse communication complexity for different types of noise models. - 25 May 2024
- Published by Springer Nature
- p. 304-314
Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs
- 25 May 2024
- Published by Springer Nature
- p. 304-314
Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs
- Open Access
Sensitivity Analysis for Active Sampling, with Applications to the Simulation of Analog Circuits
We propose an active sampling flow, with the use-case of simulating the impact of combined variations on analog circuits. In such a context, given the large number of parameters, it is difficult to fit a surrogate model and to efficiently explore the space of design features. By combining a drastic dimension reduction using sensitivity analysis and Bayesian surrogate modeling, we obtain a flexible active sampling flow. On synthetic and real datasets, this flow outperforms the usual Monte-Carlo sampling which often forms the foundation of design space exploration.
Open AccessSensitivity Analysis for Active Sampling, with Applications to the Simulation of Analog Circuits
We propose an active sampling flow, with the use-case of simulating the impact of combined variations on analog circuits. In such a context, given the large number of parameters, it is difficult to fit a surrogate model and to efficiently explore the space of design features. By combining a drastic dimension reduction using sensitivity analysis and Bayesian surrogate modeling, we obtain a flexible active sampling flow. On synthetic and real datasets, this flow outperforms the usual Monte-Carlo sampling which often forms the foundation of design space exploration.