Article
Computer Science, Information Systems
Chaosheng Zhu, Fuyuan Xiao, Zehong Cao
Summary: This paper introduces a new belief Renyi divergence measurement to quantify the differences between BPAs, addressing the flaw of D-S evidence theory in handling highly conflicting evidence.
INFORMATION SCIENCES
(2022)
Article
Computer Science, Information Systems
Christopher Perry, Peter Vrana, Albert H. Werner
Summary: In this study, we investigate quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen's theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on unnormalized dichotomies, can be characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum. These strong constraints allow us to classify and explicitly describe all such monotones, leading to a rate formula expressed as an optimization involving sandwiched Renyi divergences. As an application, we provide a new derivation of the strong converse error exponent in quantum hypothesis testing.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2022)
Article
Computer Science, Information Systems
Ho-Joon Kim, Soojoon Lee, Ludovico Lami, Martin B. Plenio
Summary: In this study, the dynamic resource theory of quantum entanglement was formulated using the superchannel theory, with separable channels and free superchannels identified as free resources, and swap channels chosen as dynamic entanglement golden units. The main results showed that the one-shot dynamic entanglement cost and distillable dynamic entanglement of a bipartite quantum channel under free superchannels are bounded by specific criteria involving channel robustness and resource monotones. Furthermore, the one-shot catalytic dynamic entanglement cost under a larger class of free superchannels was found to be limited by the generalized log-robustness of channels.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Article
Quantum Science & Technology
Paul Boes, Nelly H. Y. Ng, Henrik Wilming
Summary: The study comprehensively explores the application of variance of surprisal in (quantum) information theory and finds that it can be used to derive genuine approximate state transition conditions in the single-shot setting. It also clarifies its relation to entropy and proposes a monotone for resource theories. Certain properties of the variance of surprisal are determined, which are useful for further investigations.
Article
Physics, Multidisciplinary
Yuan Zhai, Bo Yang, Zhengjun Xi
Summary: This paper investigates the characteristics of the Belavkin-Staszewski relative entropy in relation to the noncommutativity of quantum states. By introducing new conditional entropy and mutual information terms and replacing the quantum relative entropy, the basic properties of these terms are analyzed, focusing on classical-quantum settings. The paper establishes the weak concavity of the Belavkin-Staszewski conditional entropy and the chain rule for the Belavkin-Staszewski mutual information. Additionally, the subadditivity of the Belavkin-Staszewski relative entropy is proven, along with a certain subadditivity of the geometric Renyi relative entropy.
Article
Computer Science, Artificial Intelligence
Chaosheng Zhu, Fuyuan Xiao
Summary: Multi-source information fusion technology maximizes the use of information from multiple data sources for decision making. This paper proposes a new belief Renyi divergence to handle highly conflicting evidence sources and designs a multi-source information fusion method based on this divergence.
APPLIED INTELLIGENCE
(2023)
Article
Materials Science, Multidisciplinary
Shaojie Xiong, Rui Zhang, Bo Liu, Wangjun Lu, Zhe Sun, Xiaoguang Wang
Summary: Distilling quantum coherence is essential for optimizing quantum technologies, but it is not always guaranteed. Thus, probabilistic distillation of quantum coherence has been developed and successfully implemented. We propose a scheme to achieve one-shot coherence distillation in a superconducting circuit system. By using appropriate incoherent operations, the target maximally coherent state can be extracted from a single prepared state with a finite error tolerance. Our scheme is easy to implement in experiments, requiring only a superconducting qubit as the auxiliary system. Numerical simulations under typical experimental conditions show that the distillation rate of coherence resource can be well achieved with current techniques.
RESULTS IN PHYSICS
(2023)
Article
Physics, Multidisciplinary
Reza Asgharzadeh Jelodar, Hossein Mehri-Dehnavi, Hamzeh Agahi
Summary: This paper introduces a new class of information-theoretic divergence measures based on Shannon entropy, and discusses their quantum extension for two density matrices. It also studies the properties of Tsallis and Tsallis-Lin quantum relative entropies and their relationship to quantum Tsallis-Jensen-Shannon divergence.
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
(2021)
Article
Physics, Multidisciplinary
Li Gao, Mark M. Wilde
Summary: The optimized quantum f-divergences provide distinguishability measures that include special cases like quantum relative entropy and sandwiched Renyi relative quasi-entropy. Physically meaningful refinements of data-processing inequality for the optimized f-divergence have been established, showing the upper bound on recovering a quantum state using a rotated Petz recovery channel. These results have implications for perfect reversibility of optimized f-divergences and have been extended to a general von Neumann algebraic setting beyond finite-dimensional quantum information theory.
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL
(2021)
Article
Quantum Science & Technology
Eyuri Wakakuwa, Yoshifumi Nakata, Min-Hsiu Hsieh
Summary: This study investigates state redistribution of a hybrid information source that consists of both classical and quantum components. It explores the transmission of classical and quantum information simultaneously, using shared entanglement and noiseless classical and quantum communication channels. The study presents direct and converse bounds for these three resources based on the smooth conditional entropies of the source state. It also derives various coding theorems for two-party source coding problems, some of which have not been addressed in previous literature.
Article
Computer Science, Information Systems
Ke Li, Yongsheng Yao, Masahito Hayashi
Summary: In this paper, we derive the exact exponent for the asymptotic decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance. We then apply this result to the problem of privacy amplification against quantum side information, and we obtain an upper bound for the exponent of the asymptotic decreasing of the insecurity, measured using either purified distance or relative entropy. Lastly, we investigate the asymptotics of equivocation and its exponent under the security measure using the sandwiched Renyi divergence of order $s\in (1,2]$ , which has not been addressed previously in the quantum setting.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2023)
Article
Computer Science, Information Systems
Gilad Gour, Marco Tomamichel
Summary: The text introduces an axiomatic approach to entropies and relative entropies based on minimal information-theoretic axioms, showing that these axioms are sufficient to ensure continuity and meaningful bounds. It further demonstrates a one-to-one correspondence between entropies and relative entropies.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Article
Mathematics, Applied
Suvrit Sra
Summary: This study focuses on the metric properties of symmetric divergences on Hermitian positive definite matrices, proving that the square root of these divergences serves as a distance metric. It also provides proof of the metric property for Quantum Jensen-Shannon-(Tsallis) divergences, including the conjecture made by Lamberti et al. (2008) and the recent proof by Virosztek (2019). Additionally, the study establishes metric properties of Jensen-Renyi divergences, developing a technique that may be of independent interest.
LINEAR ALGEBRA AND ITS APPLICATIONS
(2021)
Article
Computer Science, Information Systems
Michael G. Jabbour, Nilanjana Datta
Summary: We prove a tight uniform continuity bound for Arimoto's version of the conditional alpha-Renyi entropy for the range alpha is an element of [0, 1). The conditional alpha-Renyi entropy is a natural and widely used concept in information theory, and it has applications in various tasks such as guessing and decoding. Our result also reveals the relationship between the conditional alpha-Renyi entropy and the conditional Shannon entropy.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2022)
Article
Computer Science, Information Systems
Milan Mosonyi, Fumio Hiai
Summary: One possible way to define the quantum Renyi a-divergence of two quantum states is to optimize the classical Renyi a-divergence of their post-measurement probability distributions over all possible measurements, and maybe regularize these quantities over multiple copies of the two states. It is observed that the regularized measured Renyi a-divergence coincides with the sandwiched Renyi a-divergence when a > 1. However, it is shown that even for commuting states, the attainable regularized quantity using 2-outcome measurements is generally smaller than the Renyi a-divergence, indicating that the regularized test-measured Renyi a-divergence is not a quantum extension of the classical Renyi divergence when a < 1.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2023)
Article
Computer Science, Information Systems
Felix Leditzky, Nilanjana Datta
IEEE TRANSACTIONS ON INFORMATION THEORY
(2016)
Article
Physics, Mathematical
Felix Leditzky, Cambyse Rouze, Nilanjana Datta
LETTERS IN MATHEMATICAL PHYSICS
(2017)
Correction
Computer Science, Information Systems
Nilanjana Datta, Felix Leditzky
IEEE TRANSACTIONS ON INFORMATION THEORY
(2017)
Article
Computer Science, Information Systems
Felix Leditzky, Nilanjana Datta, Graeme Smith
IEEE TRANSACTIONS ON INFORMATION THEORY
(2018)
Article
Physics, Multidisciplinary
Felix Leditzky, Debbie Leung, Graeme Smith
PHYSICAL REVIEW LETTERS
(2018)
Article
Physics, Multidisciplinary
Felix Leditzky, Debbie Leung, Graeme Smith
PHYSICAL REVIEW LETTERS
(2018)
Article
Physics, Multidisciplinary
Johannes Bausch, Felix Leditzky
NEW JOURNAL OF PHYSICS
(2020)
Article
Multidisciplinary Sciences
Felix Leditzky, Mohammad A. Alhejji, Joshua Levin, Graeme Smith
NATURE COMMUNICATIONS
(2020)
Article
Computer Science, Information Systems
Rotem Arnon-Friedman, Felix Leditzky
Summary: The research focuses on entanglement in device-independent quantum key distribution (DIQKD) protocols and its role in protocol design, including the derivation of new upper bounds on key rates and the exploration of bound entangled states in DIQKD.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2021)
Article
Physics, Mathematical
Felix Leditzky
Summary: This paper provides an explicit proof that the pretty good measurement is optimal for the port-based teleportation (PBT) protocol. It also demonstrates that this measurement remains optimal even when the port state is optimized. The paper rederives the representation-theoretic formulas for the performance of PBT protocols using standard techniques.
LETTERS IN MATHEMATICAL PHYSICS
(2022)
Article
Computer Science, Information Systems
Christoph Hirche, Felix Leditzky
Summary: This study provides operationally motivated bounds on several capacities, including the quantum capacity, private capacity, one-way distillable entanglement, and private key. These bounds are generally expressed in terms of capacity quantities involving the complementary channel or state. The study also discusses partial orders on quantum channels and states as a tool to obtain these bounds.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2023)
Article
Computer Science, Information Systems
Felix Leditzky, Debbie Leung, Vikesh Siddhu, Graeme Smith, John A. Smolin
Summary: Understanding quantum channels and their capacities is important in quantum information theory. This study focuses on a simple family of quantum channels with exotic features. The capabilities of these channels behave in interesting ways, such as having equal private and classical capacities. The quantum capacity can be explicitly computed with the assumption of a conjecture. The study also generalizes the channels and shows similar behavior in different cases.
IEEE TRANSACTIONS ON INFORMATION THEORY
(2023)
Article
Physics, Multidisciplinary
Felix Leditzky, Debbie Leung, Vikesh Siddhu, Graeme Smith, John A. Smolin
Summary: Determining capacities of quantum channels is a fundamental question in quantum information theory. The study of superadditivity effects in quantum channels is important for deepening our understanding of quantum information. In this research, the authors study a family of channels called platypus channels and show that they exhibit superadditivity of coherent information and quantum capacity when used jointly with other channels. The results demonstrate that superadditivity is more prevalent than previously thought and can occur between channels with large quantum capacity.
PHYSICAL REVIEW LETTERS
(2023)
Article
Computer Science, Theory & Methods
Johannes Bausch, Felix Leditzky
Summary: In this study, numerical lower bounds were computed for the error thresholds of one-parameter families of Pauli quantum channels, revealing substantial increases in error thresholds for regions corresponding to biased noise. Additionally, a new family of quantum codes based on tree graphs was identified, outperforming traditional codes in large regions of the Pauli simplex and showing promising error correction properties.
SIAM JOURNAL ON COMPUTING
(2021)
Article
Optics
Felix Leditzky, Eneet Kaur, Nilanjana Datta, Mark M. Wilde