Related papers: Approximate recoverability and the quantum data pr…
We study the interconversion of families of quantum states ("statistical experiments") via positive, trace-preserving (PTP) maps and clarify its mathematical structure in terms of minimal sufficient Jordan algebras, which can be seen to…
In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an \emph{approximate recovery} criterion that allows for a…
Models based on approximation capabilities have recently been studied in the context of Optimal Recovery. These models, however, are not compatible with overparametrization, since model- and data-consistent functions could then be…
We establish two complementarity relations for the relative entropy of coherence in quantum information processing, i.e., quantum dense coding and teleportation. We first give an uncertaintylike expression relating local quantum coherence…
Quantum generalizations of Renyi's entropies are a useful tool to describe a variety of operational tasks in quantum information processing. Two families of such generalizations turn out to be particularly useful: the Petz quantum Renyi…
Signal to noise ratio is key to any measurement. Recent progress in semi/super-conductor technology have pushed the signal detection sensitivity to the ultimate quantum level, but the noise issue remains largely untouched and, in many…
We derive a strengthened monotonicity inequality for quantum relative entropy by employing properties of $\alpha$-R\'{e}nyi relative entropy. We develop a unifying treatment towards the improvement of some quantum entropy inequalities. In…
Among the most fundamental questions in the manipulation of quantum resources such as entanglement is the possibility of reversibly transforming all resource states. The key consequence of this would be the identification of a unique…
We introduce a new algebraic framework for understanding nonperturbative gravitational aspects of bulk reconstruction with a finite or infinite-dimensional boundary Hilbert space. We use relative entropy equivalence between bulk and…
The fundamental goal of information theory is to characterize complex operational tasks using efficiently computable information quantities, Shannon's capacity formula being the prime example of this. However, many tasks in quantum…
We present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the…
We propose a new probabilistic method for unsupervised recovery of corrupted data. Given a large ensemble of degraded samples, our method recovers accurate posteriors of clean values, allowing the exploration of the manifold of possible…
We investigate the possibility of correcting errors occurring on a multipartite system through a feedback mechanism that acquires information from partial access to the environment. A partial control scheme of this kind might be useful when…
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…
Given two density matrices $\rho$ and $\sigma$, there are a number of different expressions that reduce to the $\alpha$-R\'enyi relative entropy of $\rho$ with respect to $\sigma$ in the classical case; i.e., when $\rho$ and $\sigma$…
We consider a quantum quasi-relative entropy $S_f^K$ for an operator $K$ and an operator convex function $f$. We show how to obtain the error bounds for the monotonicity and joint convexity inequalities from the recent results for the…
We propose an extension of the sandwiched R\'enyi relative $\alpha$-entropy to normal positive functionals on arbitrary von Neumann algebras, for the values $\alpha>1$. For this, we use Kosaki's definition of noncommutative $L_p$-spaces…
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…
We study quantum process tomography given the prior information that the map is a unitary or close to a unitary process. We show that a unitary map on a $d$-level system is completely characterized by a minimal set of $d^2{+}d$ elements…
Time reversibility is absent from some recently proposed quantum memory protocols such as Absorption Frequency Comb (AFC). Focusing on AFC memory, we show that quantum efficiency and fidelity are reduced dramatically, as a consequence of…