SearcharxivSearch

arXiv subjects

Anna Vershynina

Publications and source records attributed to Anna Vershynina.

At least 19 recordsLinked to original sources

Continuity inequalities for sandwiched R\'enyi and Tsallis conditional entropies with application to the channel entropy continuity

For the sandwiched R\'enyi entropy the conditional entropy can be defined two ways: $\widetilde{H}^\downarrow_\alpha(A|B)_\rho, \widetilde{H}^\uparrow_\alpha(A|B)_\rho$. In the limiting case, $\alpha=1$, both definitions consolidate into conditional entropy $H(A|B)=S(AB)-S(B)$. The continuity inequality for conditional entropy $H(A|B)$, called the Alicki-Fannes-Winter (AWF) inequality, shows that if the states are close in trace-distance, then the conditional entropies are also close. Having the AWF inequality for conditional entropy, we show that the channel entropy defined through the relative entropy is continuous with respect to the diamond-distance between channels. Inspired by this, similar continuity inequalities for the R\'enyi conditional entropy $\widetilde{H}^\uparrow_\alpha$ were obtained in the work [A. Marwah and F. Dupuis, J. Math. Phys. 63, 052201 (2022)]. We provide continuity bounds for the sandwiched R\'enyi and Tsallis conditional entropies $\widetilde{H}^\downarrow_\alpha(A|B)_\rho, \widetilde{T}^\downarrow_\alpha(A|B)_\rho$ for states with the same marginal on the conditioning system. Similar to the previous bounds, our bound depends only on the dimension of the conditioning system. We apply this result to prove continuity of the channel entropy for R\'enyi and Tsallis channel entropies defined through the sandwiched R\'enyi and Tsallis relative entropies.

math-ph

Coherence as entropy increment for Tsallis and Renyi entropies

Relative entropy of coherence can be written as an entropy difference of the original state and the incoherent state closest to it when measured by relative entropy. The natural question is, if we generalize this situation to Tsallis or Rényi entropies, would it define good coherence measures? In other words, we define a difference between Tsallis entropies of the original state and the incoherent state closest to it when measured by Tsallis relative entropy. Taking Rényi entropy instead of the Tsallis entropy, leads to the well-known distance-based Rényi coherence, which means this expression defined a good coherence measure. Interestingly, we show that Tsallis entropy does not generate even a genuine coherence monotone, unless it is under a very restrictive class of operations. Additionally, we provide continuity estimates for both Tsallis and Rényi coherence expressions. Furthermore, we present two coherence measures based on the closest incoherent state when measures by Tsallis or Rényi relative entropy.

quant-ph

Dynamical Coherence Measures

We present three measures of the dynamical coherence of channels, which are the generalization of several previous results. The measures are based on the generalized distance function between channels, which for example could be the divergence or a trace-distance. Free operations are considered to be detection-incoherent, creation-incoherent, and detection-creation incoherent. Free superchannels can be expressed using free pre- and post-processing channels. The new measures are monotone under free superchannels and convex.

math-ph

Measure of genuine coherence based of quasi-relative entropy

We present a genuine coherence measure based on a quasi-relative entropy as a difference between quasi-entropies of the dephased and the original states. The measure satisfies non-negativity and monotonicity under genuine incoherent operations (GIO). It is strongly monotone under GIO in two- and three-dimensions, or for pure states in any dimension, making it a genuine coherence monotone. We provide a bound on the error term in the monotonicity relation in terms of the trace distance between the original and the dephased states. Moreover, the lower bound on the coherence measure can also be calculated in terms of this trace distance.

quant-ph

Entanglement rates for Renyi, Tsallis and other entropies

We provide an upper bound on the maximal entropy rate at which the entropy of the expected density operator of a given ensemble of two states changes under nonlocal unitary evolution. A large class of entropy measures in considered, which includes Renyi and Tsallis entropies. The result is derived from a general bound on the trace-norm of a commutator, which can be expected to find other implementations. We apply this result to bound the maximal rate at which quantum dynamics can generate entanglement in a bipartite closed system with Renyi and Tsallis entanglement entropy taken as measures of entanglement in the system.

math-ph

Convexity of a certain operator trace functional

In this article the operator trace function $ Λ_{r,s}(A)[K, M] := {\operatorname{tr}}(K^*A^r M A^r K)^s$ is introduced and its convexity and concavity properties are investigated. This function has a direct connection to several well-studied operator trace functions that appear in quantum information theory, in particular when studying data processing inequalities of various relative entropies. In the paper the interplay between $Λ_ {r,s}$ and the well-known operator functions $Γ_{p,s}$ and $Ψ_{p,q,s}$ is used to study the stability of their convexity (concavity) properties. This interplay may be used to ensure that $Λ_{r,s}$ is convex (concave) in certain parameter ranges when $M=I$ or $K=I.$ However, our main result shows that convexity (concavity) is surprisingly lost when perturbing those matrices even a little. To complement the main theorem, the convexity (concavity) domain of $Λ$ itself is examined. The final result states that $Λ_{r,s}$ is never concave and it is convex if and only if $r=1$ and $s\geq 1/2.$

quant-ph

Closest separable state when measured by a quasi-relative entropy

It is well known that for pure states the relative entropy of entanglement is equal to the reduced entropy, and the closest separable state is explicitly known as well. The same holds for Renyi relative entropy per recent results. We ask the same question for a quasi-relative entropy of entanglement, which is an entanglement measure defined as the minimum distance to the set of separable state, when the distance is measured by the quasi-relative entropy. First, we consider a maximally entangled state, and show that the closest separable state is the same for any quasi-relative entropy as for the relative entropy of entanglement. Then, we show that this also holds for a certain class of functions and any pure state. And at last, we consider any pure state on two qubit systems and a large class of operator convex function. For these, we find the closest separable state, which may not be the same one as for the relative entropy of entanglement.

quant-ph

Upper continuity bound on the quantum quasi-relative entropy

We provide an upper bound on the quasi-relative entropy in terms of the trace distance. The bound is derived for two cases: 1) any operator monotone decreasing function and full rank mixed qubit or classical states; 2) a large class of operator monotone decreasing function and any mixed qubit or classical states. Moreover, we derive an upper bound for the Umegaki and Tsallis relative entropies in the case of any finite-dimensional states. The bound for the relative entropy improves the known bounds for some states in any dimensions larger than four. The bound for the Tsallis entropy improves the known bounds.

quant-ph

Quantum coherence, discord and correlation measures based on Tsallis relative entropy

Several ways have been proposed in the literature to define a coherence measure based on Tsallis relative entropy. One of them is defined as a distance between a state and a set of incoherent states with Tsallis relative entropy taken as a distance measure. Unfortunately, this measure does not satisfy the required strong monotonicity, but a modification of this coherence has been proposed that does. We introduce three new Tsallis coherence measures coming from a more general definition that also satisfy the strong monotonicity, and compare all five definitions between each other. Using three coherence measures that we discuss, one can also define a discord. Two of these have been used in the literature, and another one is new. We also discuss two correlation measures based on Tsallis relative entropy. We provide explicit expressions for all three discord and two correlation measure on pure states. Lastly, we provide tight upper and lower bounds on two discord and correlations measures on any quantum state, with the condition for equality.

quant-ph

Recovery map stability for the Data Processing Inequality

The Data Processing Inequality (DPI) says that the Umegaki relative entropy $S(ρ||σ) := {\rm Tr}[ρ(\log ρ- \log σ)]$ is non-increasing under the action of completely positive trace preserving (CPTP) maps. Let ${\mathcal M}$ be a finite dimensional von Neumann algebra and ${\mathcal N}$ a von Neumann subalgebra if it. Let ${\mathcal E}_τ$ be the tracial conditional expectation from ${\mathcal M}$ onto ${\mathcal N}$. For density matrices $ρ$ and $σ$ in ${\mathcal N}$, let $ρ_{\mathcal N} := {\mathcal E}_τρ$ and $σ_{\mathcal N} := {\mathcal E}_τσ$. Since ${\mathcal E}_τ$ is CPTP, the DPI says that $S(ρ||σ) \geq S(ρ_{\mathcal N}||σ_{\mathcal N})$, and the general case is readily deduced from this. A theorem of Petz says that there is equality if and only if $σ= {\mathcal R}_ρ(σ_{\mathcal N} )$, where ${\mathcal R}_ρ$ is the Petz recovery map, which is dual to the Accardi-Cecchini coarse graining operator ${\mathcal A}_ρ$ from ${\mathcal M} $ to ${\mathcal N} $. In it simplest form, our bound is $$S(ρ||σ) - S(ρ_{\mathcal N} ||σ_{\mathcal N} ) \geq \left(\frac{1}{8π}\right)^{4} \|Δ_{σ,ρ}\|^{-2} \| {\mathcal R}_{ρ_{\mathcal N}} -σ\|_1^4 $$ where $Δ_{σ,ρ}$ is the relative modular operator. We also prove related results for various quasi-relative entropies. Explicitly describing the solutions set of the Petz equation $σ= {\mathcal R}_ρ(σ_{\mathcal N} )$ amounts to determining the set of fixed points of the Accardi-Cecchini coarse graining map. Building on previous work, we provide a throughly detailed description of the set of solutions of the Petz equation, and obtain all of our results in a simple self, contained manner.

math.OA

On quantum quasi-relative entropy

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 $f$-divergences (i.e. $K=I$). We also provide an error term for a class of operator inequalities, that generalize operator strong subadditivity inequality. We apply those results to demonstrate explicit bounds for the logarithmic function, that leads to the quantum relative entropy, and the power function, which gives, in particular, a Wigner-Yanase-Dyson skew information. In particular, we provide the remainder terms for the strong subadditivity inequality, operator strong subadditivity inequality, WYD-type inequalities, and the Cauchy-Schwartz inequality.

math-ph

Recovery and the Data Processing Inequality for quasi-entropies

We prove number of quantitative stability bounds for the cases of equality in Petz's monotonicity theorem for quasi-relative entropies defined in terms of an operator monotone decreasing functions. Included in our results is a bound in terms of the Petz recovery map, but we obtain more general results. The present treatment is entirely elementary and developed in the context of finite dimensional von Neumann algebras where the results are already non-trivial and of interest in quantum information theory.

math-ph

Geometric inequalities from phase space translations

We establish a quantum version of the classical isoperimetric inequality relating the Fisher information and the entropy power of a quantum state. The key tool is a Fisher information inequality for a state which results from a certain convolution operation: the latter maps a classical probability distribution on phase space and a quantum state to a quantum state. We show that this inequality also gives rise to several related inequalities whose counterparts are well-known in the classical setting: in particular, it implies an entropy power inequality for the mentioned convolution operation as well as the isoperimetric inequality, and establishes concavity of the entropy power along trajectories of the quantum heat diffusion semigroup. As an application, we derive a Log-Sobolev inequality for the quantum Ornstein-Uhlenbeck semigroup, and argue that it implies fast convergence towards the fixed point for a large class of initial states.

quant-ph

Entanglement rates for bipartite open systems

We provide upper bound on the maximal rate at which irreversible quantum dynamics can generate entanglement in a bipartite system. The generator of irreversible dynamics consists of a Hamiltonian and dissipative terms in Lindblad form. The relative entropy of entanglement is chosen as a measure of entanglement in an ancilla-free system. We provide an upper bound on the entangling rate which has a logarithmic dependence on a dimension of a smaller system in a bipartite cut. We also investigate the rate of change of quantum mutual information in an ancilla-assisted system and provide an upper bound independent of dimension of ancillas.

quant-ph

Complete criterion for convex-Gaussian state detection

We present a new criterion that determines whether a fermionic state is a convex combination of pure Gaussian states. This criterion is complete and characterizes the set of convex-Gaussian states from the inside. If a state passes a program it is a convex-Gaussian state and any convex-Gaussian state can be approximated with arbitrary precision by states passing the criterion. The criterion is presented in the form of a sequence of solvable semidefinite programs. It is also complementary to the one developed by de Melo, Cwiklinski and Terhal, which aims at characterizing the set of convex-Gaussian states from the outside. Here we present an explicit proof that criterion by de Melo et al. is complete, by estimating a distance between an n-extendible state, a state that passes the criterion, to the set of convex-Gaussian states.

quant-ph

Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction

We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a function of time to simulate the quantum circuit. We bound the eigenvalue gap above the unique groundstate by mapping our model onto the ferromagnetic XXZ chain with kink boundary conditions; the gap of this spin chain was computed exactly by Koma and Nachtergaele using its $q$-deformed version of SU(2) symmetry. We also discuss a related time-independent Hamiltonian which was shown by Janzing to be capable of universal computation. We observe that in the limit of large system size, the time evolution is equivalent to the exactly solvable quantum walk on Young's lattice.

quant-ph

Upper bounds on mixing rates

We prove upper bounds on the rate, called "mixing rate", at which the von Neumann entropy of the expected density operator of a given ensemble of states changes under non-local unitary evolution. For an ensemble consisting of two states, with probabilities of p and 1-p, we prove that the mixing rate is bounded above by 4\sqrt{p(1-p)} for any Hamiltonian of norm 1. For a general ensemble of states with probabilities distributed according to a random variable X and individually evolving according to any set of bounded Hamiltonians, we conjecture that the mixing rate is bounded above by a Shannon entropy of a random variable X. For this general case we prove an upper bound that is independent of the dimension of the Hilbert space on which states in the ensemble act.

quant-ph