arXiv subjects

Clément Pellegrini

Publications and source records attributed to Clément Pellegrini.

At least 19 recordsLinked to original sources

arXiv2026

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.

math.PR↗

arXiv2026

Towards Unconditional Uncloneable Encryption

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 being able to simultaneously decrypt, given the key and quantum side-information produced from the ciphertext. Since its initial proposal and scheme in the random oracle model by Broadbent and Lord [TQC 2020], uncloneable encryption has developed into an important primitive at the foundation of quantum uncloneability for cryptographic primitives. Despite sustained efforts, however, the question of unconditional uncloneable encryption (and in particular of the simplest case, called an uncloneable bit) has remained elusive. Here, we propose a candidate for the unconditional uncloneable bit problem, and provide strong evidence that the adversary's success probability in the related security game converges quadratically as ${1}/{2}+{1}/{(2\sqrt{K})}$, where $K$ represents the number of keys and ${1}/{2}$ is trivially achievable. We prove this bound's validity for $K$ ranging from $2$ to $7$ and demonstrate the validity up to $K = 17$ using computations based on the NPA hierarchy. We furthemore provide compelling heuristic evidence towards the general case. In addition, we prove an asymptotic upper bound of ${5}/{8}$ and give a numerical upper bound of $\sim 0.5980$, which to our knowledge is the best-known value in the unconditional model.

quant-ph↗

arXiv2026

Entanglement in the Dicke subspace

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, disproving a recent conjecture. We establish that PPT entanglement exists for all multipartite systems with local dimension d >= 3 and n >= 3 parties. We also show that, for mixtures of Dicke states, the PPT condition with respect to the most balanced bipartition implies all other PPT conditions. 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.

quant-ph↗

arXiv2026

A Martingale Approach To Fluctuations of Rank Estimators in Sensitivity Analysis

Given a bivariate random pair $(X,Y)$, a natural problem is to estimate, from a single sample $(X_i,Y_i)_{1\le i\le n}$, quantities such as $\mathbb{E}\left[ \mathbb{E}[ Y\mid X ]^2 \right]$. More broadly, sensitivity indices are designed to quantify the possibly nonlinear influence of an input variable $X$ on an output variable $Y$. A classical example is the Sobol' index $$ \frac{\mathrm{Var}(\mathbb{E}[Y\mid X])}{\mathrm{Var}(Y)} \in [0,1] \ . $$ Another important example is the Cramér--von Mises (CvM) index. Following the pioneering work of Chatterjee \cite{chatterjee2021new}, consistent rank-based estimators are now available for such quantities. In this paper, we prove sharp fluctuation results using martingale methods. Our framework yields a unified treatment of the univariate Sobol' index, a multivariate extension involving several functions of the same scalar input, and the CvM index. As a consequence, we recover, unify, and simplify results from Gamboa et al. \cite{gamboa2022global, gamboa2023erratum}, Lin--Han \cite{lin2022limit}, and Kroll \cite{kroll2024asymptotic}. In particular, we work under minimal regularity assumptions. Furthermore, while the Gaussian fluctuation phenomenon itself was already known, the novelty lies in the structure of the asymptotic variance: for the CvM index, we obtain, to the best of our knowledge, the first explicit formula, while for the Sobol' index, we derive a new expression with a more structured form.

math.ST↗

arXiv2026

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.

math-ph↗

arXiv2025

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.

quant-ph↗

arXiv2025

Exponentially fast selection of sectors for quantum trajectories beyond non demolition measurements

We show that, in long time, quantum trajectories select an invariant subspace of the Hilbert space of the system being indirectly measured. This selection is shown to be exponentially fast in an almost sure sense and in average. This result generalizes a known result for non demolition measurements to arbitrary repeated indirect measurements. Our proofs are based on the introduction of a deformation of the original instrument to an equivalent one with a unique invariant state.

math-ph↗

arXiv2025

Quantum Trajectories. Spectral Gap, Quasi-compactness & Limit Theorems

Quantum trajectories are Markov processes modeling the evolution of a quantum system subjected to repeated independent measurements. Inspired by the theory of random products of matrices, it has been shown that these Markov processes admit a unique invariant measure under a purification and an irreducibility assumptions. This paper is devoted to the spectral study of the underlying Markov operator. Using Quasi-compactness, it is shown that this operator admits a spectral gap and the peripheral spectrum is described in a precise manner. Next two perturbations of this operator are studied. This allows to derive limit theorems (Central Limit Theorem, Berry-Esseen bounds and Large Deviation Principle) for the empirical mean of functions of the Markov chain as well as the Lyapounov exponent of the underlying random dynamical system.

math.PR↗

arXiv2024

To spike or not to spike: the whims of the Wonham filter in the strong noise regime

We study the celebrated Shiryaev-Wonham filter (1964) in its historical setup where the hidden Markov jump process has two states. We are interested in the weak noise regime for the observation equation. Interestingly, this becomes a strong noise regime for the filtering equations. Earlier results of the authors show the appearance of spikes in the filtered process, akin to a metastability phenomenon. This paper is aimed at understanding the smoothed optimal filter, which is relevant for any system with feedback. In particular, we exhibit a sharp phase transition between a spiking regime and a regime with perfect smoothing.

math.PR↗

arXiv2024

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 f(X,Y), where the strings X and Y are 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 to collapse communication 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" $P\boxtimes Q$, 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 noisy PR boxes that collapse communication complexity for different types of noise models.

quant-ph↗

arXiv2024

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, 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.

quant-ph↗

arXiv2024

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.

stat.ML↗

arXiv2024

Quantum trajectory of the one atom maser

The evolution of a quantum system undergoing repeated indirect measurements naturally leads to a Markov chain on the set of states which is called a quantum trajectory. In this paper we consider a specific model of such a quantum trajectory associated to the one-atom maser model. It describes the evolution of one mode of the quantized electromagnetic field in a cavity interacting with two-level atoms. When the system is non-resonant we prove that this Markov chain admits a unique invariant probability measure. We moreover prove convergence in the Wasserstein metric towards this invariant measure. These results rely on a purification theorem: almost surely the state of the system approaches the set of pure states. Compared to similar results in the literature, the system considered here is infinite dimensional. While existence of an invariant measure is a consequence of the compactness of the set of states in finite dimension, in infinite dimension existence of an invariant measure is not free. Furthermore usual purification criterions in finite dimension have no straightforward equivalent in infinite dimension.

math-ph↗

arXiv2023

Exponential Selection and Feedback Stabilization of Invariant Subspaces of Quantum Trajectories

We show that quantum trajectories become exponentially fast supported by one of their minimal invariant subspaces. Exponential convergence is shown in expectation using Lyapunov techniques. The proof is based on an in-depth study of the identifiability of the probability distributions generated in the different subspaces. We furthermore introduce a feedback control strategy that allows for the targeted convergence towards a desired subspace. This convergence is also achieved at exponential speed.

quant-ph↗

arXiv2023

Limit theorems for Quantum Trajectories

Quantum trajectories are Markov processes modeling the evolution of a quantum system subjected to repeated independent measurements. Under purification and irreducibility assumptions, these Markov processes admit a unique invariant measure - see Benoist et al. Probab. Theory Relat. Fields 2019. In this article we prove, finer limit theorems such as Law of Large Numbers (LLN), Functional Central Limit Theorem, Law of Iterated Logarithm and Moderate Deviation Principle. The proof of the LLN is based on Birkhoff's ergodic theorem and an analysis of harmonic functions. The other theorems are proved using martingale approximation of empirical sums.

math.PR↗

arXiv2022

The Asymmetric Quantum Cloning Region

Quantum cloning is a fundamental protocol of quantum information theory. Perfect universal quantum cloning is prohibited by the laws of quantum mechanics, only imperfect copies being reachable. Symmetric quantum cloning is concerned with case when the quality of the clones is identical. In this work, we study the general case of $1 \to N$ asymmetric cloning, where one asks for arbitrary qualities of the clones. We characterize, for all Hilbert space dimensions and number of clones, the set of all possible clone qualities. This set is realized as the nonnegative part of the unit ball of a newly introduced norm, which we call the $\mathcal{Q}$-norm. We also provide a closed form expression for the quantum cloner achieving a given clone quality vector. Our analysis relies on the Schur-Weyl duality and on the study of the spectral properties of partially transposed permutation operators.

quant-ph↗

arXiv2022

Parameter Estimation for Quantum Trajectories: Convergence Result

A quantum trajectory describes the evolution of a quantum system undergoing indirect measurement. In the discrete-time setting, the state of the system is updated by applying Kraus operators according to the measurement results. From an experimental perspective, these Kraus operators can depend on unknown physical parameters p. An interesting and powerful method has been proposed in [1] to estimate a parameter in a finite set; however, complete results of convergence were lacking. This article fills this gap by rigorously showing the consistency of the method, whereas there was only numerical evidence so far. When the parameter belongs to a continuous set, we propose an algorithm to approach its value and show simulation results.

quant-ph↗

arXiv2022

On the cost of Bayesian posterior mean strategy for log-concave models

In this paper, we investigate the problem of computing Bayesian estimators using Langevin Monte-Carlo type approximation. The novelty of this paper is to consider together the statistical and numerical counterparts (in a general log-concave setting). More precisely, we address the following question: given $n$ observations in $\mathbb{R}^q$ distributed under an unknown probability $\mathbb{P}_{θ^\star}$ with $θ^\star \in \mathbb{R}^d$ , what is the optimal numerical strategy and its cost for the approximation of $θ^\star$ with the Bayesian posterior mean? To answer this question, we establish some quantitative statistical bounds related to the underlying Poincaré constant of the model and establish new results about the numerical approximation of Gibbs measures by Cesaro averages of Euler schemes of (over-damped) Langevin diffusions. These last results include in particular some quantitative controls in the weakly convex case based on new bounds on the solution of the related Poisson equation of the diffusion.

math.PR↗