skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Tensorization of the strong data processing inequality for quantum chi-square divergences
It is well-known that any quantum channel E satisfies the data processing inequality (DPI), with respect to various divergences, e.g., quantum χ κ 2 divergences and quantum relative entropy. More specifically, the data processing inequality states that the divergence between two arbitrary quantum states ρ and σ does not increase under the action of any quantum channel E . For a fixed channel E and a state σ , the divergence between output states E ( ρ ) and E ( σ ) might be strictly smaller than the divergence between input states ρ and σ , which is characterized by the strong data processing inequality (SDPI). Among various input states ρ , the largest value of the rate of contraction is known as the SDPI constant. An important and widely studied property for classical channels is that SDPI constants tensorize. In this paper, we extend the tensorization property to the quantum regime: we establish the tensorization of SDPIs for the quantum χ κ 1 / 2 2 divergence for arbitrary quantum channels and also for a family of χ κ 2 divergences (with κ ≥ κ 1 / 2 ) for arbitrary quantum-classical channels.  more » « less
Award ID(s):
1910571 1454939
PAR ID:
10176305
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Quantum
Volume:
3
ISSN:
2521-327X
Page Range / eLocation ID:
199
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We investigate the problem of predicting the output behavior of unknown quantum channels. Given query access to an n-qubit channel E and an observable O, we aim to learn the mapping ρ↦Tr(OE[ρ]) to within a small error for most ρ sampled from a distribution D. Previously, Huang, Chen, and Preskill proved a surprising result that even if E is arbitrary, this task can be solved in time roughly nO(log(1/ϵ)), where ϵ is the target prediction error. However, their guarantee applied only to input distributions D invariant under all single-qubit Clifford gates, and their algorithm fails for important cases such as general product distributions over product states ρ. In this work, we propose a new approach that achieves accurate prediction over essentially any product distribution D, provided it is not "classical" in which case there is a trivial exponential lower bound. Our method employs a "biased Pauli analysis," analogous to classical biased Fourier analysis. Implementing this approach requires overcoming several challenges unique to the quantum setting, including the lack of a basis with appropriate orthogonality properties. The techniques we develop to address these issues may have broader applications in quantum information. 
    more » « less
  2. Holevo's just-as-good fidelity is a similarity measure for quantum states that has found several applications. One of its critical properties is that it obeys a data processing inequality: the measure does not decrease under the action of a quantum channel on the underlying states. In this paper, I prove a refinement of this data processing inequality that includes an additional term related to recoverability. That is, if the increase in the measure is small after the action of a partial trace, then one of the states can be nearly recovered by the Petz recovery channel, while the other state is perfectly recovered by the same channel. The refinement is given in terms of the trace distance of one of the states to its recovered version and also depends on the minimum eigenvalue of the other state. As such, the refinement is universal, in the sense that the recovery channel depends only on one of the states, and it is explicit, given by the Petz recovery channel. The appendix contains a generalization of the aforementioned result to arbitrary quantum channels. 
    more » « less
  3. null (Ed.)
    The quantum relative entropy is a measure of the distinguishability of two quantum states, and it is a unifying concept in quantum information theory: many information measures such as entropy, conditional entropy, mutual information, and entanglement measures can be realized from it. As such, there has been broad interest in generalizing the notion to further understand its most basic properties, one of which is the data processing inequality. The quantum f-divergence of Petz is one generalization of the quantum relative entropy, and it also leads to other relative entropies, such as the Petz--Renyi relative entropies. In this contribution, I introduce the optimized quantum f-divergence as a related generalization of quantum relative entropy. I prove that it satisfies the data processing inequality, and the method of proof relies upon the operator Jensen inequality, similar to Petz's original approach. Interestingly, the sandwiched Renyi relative entropies are particular examples of the optimized f-divergence. Thus, one benefit of this approach is that there is now a single, unified approach for establishing the data processing inequality for both the Petz--Renyi and sandwiched Renyi relative entropies, for the full range of parameters for which it is known to hold. 
    more » « less
  4. null (Ed.)
    We study repeated independent Blackwell experiments; standard examples include drawing multiple samples from a population, or performing a measurement in different locations. In the baseline setting of a binary state of nature, we compare experiments in terms of their informativeness in large samples. Addressing a question due to Blackwell (1951), we show that generically an experiment is more informative than another in large samples if and only if it has higher Rényi divergences. We apply our analysis to the problem of measuring the degree of dissimilarity between distributions by means of divergences. A useful property of Rényi divergences is their additivity with respect to product distributions. Our characterization of Blackwell dominance in large samples implies that every additive divergence that satisfies the data processing inequality is an integral of Rényi divergences. 
    more » « less
  5. Abstract Quantum channels that break CHSH nonlocality on all input states are known as CHSH-breaking channels. In quantum networks, such channels are useless for distributing correlations that can violate the CHSH Inequality. Motivated by previous work on activation of nonlocality in quantum states, here we demonstrate an analogous activation of CHSH-breaking channels. That is, we show that certain pairs of CHSH-breaking channels are no longer CHSH-breaking when used in combination. We find that this type of activation can emerge in both uni-directional and bi-directional communication scenarios. 
    more » « less