Related papers: Necessary criterion for approximate recoverability
We analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing…
Any bipartite quantum state has quasi-probability representations in terms of separable states. For entangled states these quasi-probabilities necessarily exhibit negativities. Based on the general structure of composite quantum states, one…
This paper studies the phase-only reconstruction problem of recovering a complex-valued signal $\textbf{x}$ in $\mathbb{C}^d$ from the phase of $\textbf{Ax}$ where $\textbf{A}$ is a given measurement matrix in $\mathbb{C}^{m\times d}$. The…
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\H{o}s-R\'enyi (ER) graphs. For a pair of correlated graphs on the same vertex set, the correspondence between the vertices can be obscured…
Scientific explanation often requires inferring maximally predictive features from a given data set. Unfortunately, the collection of minimal maximally predictive features for most stochastic processes is uncountably infinite. In such…
It is known that a necessary and sufficient condition for equality in the data processing inequality (DPI) for the quantum relative entropy is the existence of a recovery map. We show that equality in DPI for a sandwiched R\'enyi relative…
The cover time of a Markov chain on a finite state space is the expected time until all states are visited. We show that if the cover time of a discrete-time Markov chain with rational transitions probabilities is bounded, then it is a…
The uncertainty principle determines the distinction between the classical and quantum worlds. This principle states that it is not possible to measure two incompatible observables with the desired accuracy simultaneously. In quantum…
We derive a necessary and sufficient condition for the separability of tripartite three mode Gaussian states, that is easy to check for any such state. We give a classification of the separability properties of those systems and show how to…
We provide necessary and sufficient conditions for the partial transposition of bipartite harmonic quantum states to be nonnegative. The conditions are formulated as an infinite series of inequalities for the moments of the state under…
We study the computation of lower and upper probabilities of hitting a target set of states for imprecise Markov chains, where transition uncertainty is modelled by a convex set of transition matrices. In the precise case, hitting…
Let $\{Y_i\}_{i=1}^{\infty}$ be a stationary reversible Markov chain with state space $[N]$, let $(X, \| \cdot \|)$ be a real-valued Banach space and let $f_1, \ldots, f_n: [N] \rightarrow X$ be functions with mean $0$ such that $\|f_i(v)\|…
Matrix recovery is raised in many areas. In this paper, we build up a framework for almost everywhere matrix recovery which means to recover almost all the $P\in {\mathcal M}\subset {\mathbb H}^{p\times q}$ from $Tr(A_jP), j=1,\ldots,N$…
Necessary and sufficient conditions for bipartite entanglement are derived, which apply to arbitrary Hilbert spaces. Motivated by the concept of witnesses, optimized entanglement inequalities are formulated solely in terms of arbitrary…
A lumping of a Markov chain is a coordinate-wise projection of the chain. We characterise the entropy rate preservation of a lumping of an aperiodic and irreducible Markov chain on a finite state space by the random growth rate of the…
Interval Markov chains extend classical Markov chains with the possibility to describe transition probabilities using intervals, rather than exact values. While the standard formulation of interval Markov chains features closed intervals,…
Recovering Markov boundary -- the minimal set of variables that maximizes predictive performance for a response variable -- is crucial in many applications. While recent advances improve upon traditional constraint-based techniques by…
In this paper, we propose an approach to obtain reduced-order models of Markov chains. Our approach is composed of two information-theoretic processes. The first is a means of comparing pairs of stationary chains on different state spaces,…
Motivated by techniques developed in recent progress on lower bounds for sublinear time algorithms (Behnezhad, Roghani and Rubinstein, STOC 2023, FOCS 2023, and STOC 2024) we introduce and study a new class of randomized algorithmic…
The necessary and sufficient condition of separability of a mixed state of any systems is presented, which is practical in judging the separability of a mixed state. This paper also presents a method of finding the disentangled…