Related papers: Remarks on the Cross Norm Criterion for Separabili…
We define a measure of redundant information based on projections in the space of probability distributions. Redundant information between random variables is information that is shared between those variables. But in contrast to mutual…
For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…
Split conformal prediction (CP) is arguably the most popular CP method for uncertainty quantification, enjoying both academic interest and widespread deployment. However, the original theoretical analysis of split CP makes the crucial…
We present an inequality that classifies mixed multipartite systems of an arbitrary dimension with respect to separability and positivity of partial transpose properties. This inequality gives a way to experimentally classify the observed…
A very explicit analytic formula of the separability criterion of two-party Gaussian systems is given. This formula is compared to the past formulation of the separability criterion of continuous variables two-party Gaussian systems.
We study the quantum separability problem by using general symmetric informationally complete measurements and present a separability criterion for arbitrary dimensional bipartite systems. We show by detailed examples that our criterion is…
A converse method is developed for the source broadcast problem. Specifically, it is shown that the separation architecture is optimal for a variant of the source broadcast problem and the associated source-channel separation theorem can be…
We present an approach to showing that a linear code is resilient to random errors. We use this approach to obtain decoding results for both transitive codes and Reed-Muller codes. We give three kinds of results about linear codes in…
Inseparability criteria for continuous and discrete bipartite quantum states based on moments of annihilation and creation operators are studied by developing the idea of Shchukin-Vogel criterion [Phys. Rev. Lett. {\bf 95}, 230502 (2005)].…
Gathering the most information by picking the least amount of data is a common task in experimental design or when exploring an unknown environment in reinforcement learning and robotics. A widely used measure for quantifying the…
Making a decision is often a matter of listing and comparing positive and negative arguments. In such cases, the evaluation scale for decisions should be considered bipolar, that is, negative and positive values should be explicitly…
In this paper, we first present simple proofs of Choi's results [4], then we give a short alternative proof for Fiedler and Markham's inequality [6]. We also obtain additional matrix inequalities related to partial determinants.
The statistics and machine learning communities have recently seen a growing interest in classification-based approaches to two-sample testing. The outcome of a classification-based two-sample test remains a rejection decision, which is not…
The notion of well-separated sets is crucial in fast multipole methods as the main idea is to approximate the interaction between such sets via cluster expansions. We revisit the one-parameter multipole acceptance criterion in a general…
We consider stopping criteria that balance algebraic and discretization errors for the conjugate gradient algorithm applied to high-order finite element discretizations of Poisson problems. Firstly, we introduce a new stopping criterion…
We study violations of n particle Bell inequalities (as developed by Mermin and Klyshko) under the assumption that suitable partial transposes of the density operator are positive. If all transposes with respect to a partition of the system…
Transcendence criteria inspired by Kolberg's paper dated 1962. This is the second part of a note about Kolberg's proof that the values of the sums of a class of certain power series in x, for algebraic values of x, are transcendent. A…
It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the…
We derive a separability criterion for bipartite quantum systems which generalizes the already known criteria. It is based on observables having generic commutation relations. We then discuss in detail the relation among these criteria.
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…