Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLower semicontinuity of the entropic disturbance and its applications in quantum information theory
74
0
0.0
(
0
)
Added by
Maxim Shirokov Evgenyevich
Publication date
2016
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We prove that for any infinite-dimensional quantum channel the entropic disturbance (defined as difference between the $chi$-quantity of a generalized ensemble and that of the image of the ensemble under the channel) is lower semicontinuous on the natural set of its definition. We establish a number of useful corollaries of this property, in particular, we prove the continuity of the output $chitextrm{-}$quantity and the existence of $chi$-optimal ensemble for any quantum channel under the energy-type input constraint.
rate research
Read More
In the dynamics of open quantum systems, the backflow of information to the reduced system under study has been suggested as the actual physical mechanism inducing memory and thus leading to non-Markovian quantum dynamics. To this aim, the trace-distance or Bures-distance revivals between distinct evolved system states have been shown to be subordinated to the establishment of system-environment correlations or changes in the environmental state. We show that this interpretation can be substantiated also for a class of entropic quantifiers. We exploit a suitably regularized version of Umegakis quantum relative entropy, known as telescopic relative entropy, that is tightly connected to the quantum Jensen-Shannon divergence. In particular, we derive general upper bounds on the telescopic relative entropy revivals conditioned and determined by the formation of correlations and changes in the environment. We illustrate our findings by means of examples, considering the Jaynes-Cummings model and a two-qubit dynamics.
The purpose of this review article is to present some of the latest developments using random techniques, and in particular, random matrix techniques in quantum information theory. Our review is a blend of a rather exhaustive review, combined with more detailed examples -- coming from research projects in which the authors were involved. We focus on two main topics, random quantum states and random quantum channels. We present results related to entropic quantities, entanglement of typical states, entanglement thresholds, the output set of quantum channels, and violations of the minimum output entropy of random channels.
In this work we build a theoretical framework for the transport of information in quantum systems. This is a framework aimed at describing how out of equilibrium open quantum systems move information around their state space, using an approach inspired by transport theories. The main goal is to build new mathematical tools, together with physical intuition, to improve our understanding of non-equilibrium phenomena in quantum systems. In particular, we are aiming at unraveling the interplay between dynamical properties and information-theoretic features. The main rationale here is to have a framework that can imitate, and potentially replicate, the decades-long history of success of transport theories in modeling non-equilibrium phenomena.
The uncertainty principle bounds the uncertainties about incompatible measurements, clearly setting quantum theory apart from the classical world. Its mathematical formulation via uncertainty relations, plays an irreplaceable role in quantum technologies. However, neither the uncertainty principle nor uncertainty relations can fully describe the complementarity between quantum measurements. As an attempt to advance the efforts of complementarity in quantum theories, we formally propose a complementary information principle, significantly extending the one introduced by Heisenberg. First, we build a framework of black box testing consisting of pre- and post-testing with two incompatible measurements, introducing a rigorous mathematical expression of complementarity with definite information causality. Second, we provide majorization lower and upper bounds for the complementary information by utilizing the tool of semidefinite programming. In particular, we prove that our bounds are optimal under majorization due to the completeness of the majorization lattice. Finally, as applications to our framework, we present a general method to outer-approximating all uncertainty regions and also establish fundamental limits for all qualified joint uncertainties.
We develop a connection between tripartite information $I_3$, secret sharing protocols and multi-unitaries. This leads to explicit ((2,3)) threshold schemes in arbitrary dimension minimizing tripartite information $I_3$. As an application we show that Page scrambling unitaries simultaneously work for all secrets shared by Alice. Using the $I_3$-Ansatz for imperfect sharing schemes we discover examples of VIP sharing schemes.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
