Related papers: Necessary criterion for approximate recoverability
We propose polynomial-time algorithms to minimise labelled Markov chains whose transition probabilities are not known exactly, have been perturbed, or can only be obtained by sampling. Our algorithms are based on a new notion of an…
We give an explicit arithmetical condition which guarantees the existence of the unstable manifold of the MacKay approximate renormalisation scheme for the breakup of invariant tori in one and a half degrees of freedom Hamiltonian systems,…
For a state $\rho_{A_1^n B}$, we call a sequence of states $(\sigma_{A_1^k B}^{(k)})_{k=1}^n$ an approximation chain if for every $1 \leq k \leq n$, $\rho_{A_1^k B} \approx_\epsilon \sigma_{A_1^k B}^{(k)}$. In general, it is not possible to…
In this paper, we present a novel iterative Monte Carlo method for approximating the stationary probability of a single state of a positive recurrent Markov chain. We utilize the characterization that the stationary probability of a state…
A method of constructing Markov chains on finite state spaces is provided. The chain is specified by three constraints: stationarity, dependence and marginal distributions. The generalized Pythagorean theorem in information geometry plays a…
Recent contributions in the field of quantum state tomography have shown that, despite the exponential growth of Hilbert space with the number of subsystems, tomography of one-dimensional quantum systems may still be performed efficiently…
We consider a strictly substochastic matrix or an stochastic matrix with absorbing states. By using quasi-stationary distributions one shows there is a canonical associated stationary Markov chain. Based upon $2-$stringing representation of…
Suitable reachability conditions can make two different fixed point semantics of a transition system coincide. For instance, the total and partial expected reward semantics on Markov chains (MCs) coincide whenever the MC at hand is almost…
We use the replica method of statistical mechanics to examine a typical performance of correctly reconstructing $N$-dimensional sparse vector $bx=(x_i)$ from its linear transformation $by=bF bx$ of $P$ dimensions on the basis of…
The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…
The recent proposed realignment separability criterion for mixed is analyzed. We identify the essential part of this criterion is a swap operator followed by a partial transposition. Then we analyze the separability criterion of permutation…
We present three necessary separability criteria for bipartite mixed states, the violation of each of these conditions is a sufficient condition for entanglement. Some ideas on the issue of finding a necessary and sufficient criterion of…
We consider the problem of detecting the true quantum state among r possible ones, based on measurements performed on n of copies of a finite dimensional quantum system. It is known that the exponent for the rate of decrease of the averaged…
Any tripartite state which saturates the strong subadditivity relation for the quantum entropy is defined as the Markov state.A tripartite pure state describing an open system, its environment and their purifying system isa pure Markov…
We consider a stochastic image restoration model proposed by A. Gibbs (2004), and give an upper bound on the time it takes for a Markov chain defined by this model to be \epsilon - close in total variation to equilibrium. We use Gibbs'…
Several information measures have recently been defined which capture the notion of "recoverability." In particular, the fidelity of recovery quantifies how well one can recover a system $A$ of a tripartite quantum state, defined on systems…
In the context of control and estimation under information constraints, restoration entropy measures the minimal required data rate above which the state of a system can be estimated so that the estimation quality does not degrade over time…
The reconstruction of the state of a multipartite quantum mechanical system represents a fundamental task in quantum information science. At its most basic, it concerns a state of a bipartite quantum system whose subsystems are subjected to…
The Computable Cross Norm (CCN), or realignment criterion, is a widely used method for entanglement detection in quantum systems; however, it typically provides only a necessary condition. In this work, we advance the applicability of the…
The detection and estimation of quantum entanglement are the essential issues in the theory of quantum entanglement. We construct matrices based on the realignment of density matrices and the vectorization of the reduced density matrices,…