相关论文: For Distinguishing Conjugate Hidden Subgroups, the…

We experimentally demonstrate a two-particle collective measurement proposed as the optimal solution to a quantum state estimation game. Our results suggest that, in practice, the collective measurement strategy is at least as good as the…

Paper withdrawn. Results are similar to V. P. Belavkin, "Optimum distinction of non-orthogonal quantum signals," Radio Engineering and Electronic Physics, vol. 20, June 1975, p. 39-47.

Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the sublinear regime $k = n^{\theta}$ (with $\theta \in (0,1)$), with…

In the present article we study the following problem. Let G be a linear algebraic group over Q, $\Gamma$ be an arithmetic lattice and H be an observable Q-subgroup. There is a H-invariant measure $\mu_H$ supported on the closed submanifold…

A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect matching polytope, one may assume that $G$ is matching covered --- that is, it is a…

We study the convergence rate of the optimal quantization for a probability measure sequence $(\mu_{n})_{n\in\mathbb{N}^{*}}$ on $\mathbb{R}^{d}$ converging in the Wasserstein distance in two aspects: the first one is the convergence rate…

The basic goal in combinatorial group testing is to identify a set of up to $d$ defective items within a large population of size $n \gg d$ using a pooling strategy. Namely, the items can be grouped together in pools, and a single…

It is common in pose graph optimization (PGO) algorithms to assume that noise in the translations and rotations of relative pose measurements is uncorrelated. However, existing work shows that in practice these measurements can be highly…

The problem of quickest change detection (QCD) in anonymous heterogeneous sensor networks is studied. There are $n$ heterogeneous sensors and a fusion center. The sensors are clustered into $K$ groups, and different groups follow different…

We study criteria for the existence of a dense or comeager conjugacy class in the automorphism group of a given measure on the Cantor space. We concentrate on good measures, defined by Akin [\emph{Trans.\ Amer.\ Math.\ Soc.} \textbf{357}…

Given a group size m and a sensitive dataset D, group privacy (GP) releases information about D with the guarantee that the adversary cannot infer with high confidence whether the underlying data is D or a neighboring dataset D' that…

In this paper we prove that the cone $\PPD$ of positive, positive definite, discrete and strong almost periodic measures has an interesting property: given any positive and positive definite measure $\mu$ smaller than some measure in…

Direct methods for the simulation of optimal control problems apply a specific discretization to the dynamics of the problem, and the discrete adjoint method is suitable to calculate corresponding conditions to approximate an optimal…

We consider the problem of discovering subgroup $H$ of permutation group $S_{n}$. Unlike the traditional $H$-invariant networks wherein $H$ is assumed to be known, we present a method to discover the underlying subgroup, given that it…

Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…

We consider the problem of computing tight privacy guarantees for the composition of subsampled differentially private mechanisms. Recent algorithms can numerically compute the privacy parameters to arbitrary precision but must be carefully…

A discrete group $\Gamma$ is called exact if the reduced group C*-algebra ${C_{\lambda}}^{*}(\Gamma)$ is exact as C*-algebras, and a discrete group $\Lambda$ is called residually exact if every nonunital element $g \in \Lambda$ admits a…

In this work we study the problem of single-shot discrimination of von Neumann measurements, which we associate with measure-and-prepare channels. There are two possible approaches to this problem. The first one is simple and does not…

Statistical heterogeneity is a measure of how skewed the samples of a dataset are. It is a common problem in the study of differential privacy that the usage of a statistically heterogeneous dataset results in a significant loss of…

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…