Non-Linear Strong Data-Processing for Quantum Hockey-Stick Divergences
Theshani Nuradha, Ian George, Christoph Hirche

TL;DR
This paper introduces non-linear strong data-processing inequalities for quantum hockey-stick divergences, improving bounds over existing linear inequalities and enhancing privacy guarantees in quantum information processing.
Contribution
It establishes non-linear SDPI for quantum hockey-stick divergence, generalizes Dobrushin curves to quantum channels, and applies results to quantum privacy guarantees.
Findings
Non-linear SDPI provide tighter bounds than linear SDPI.
Results improve privacy guarantees for sequential quantum channels.
Derived reverse-Pinsker inequalities for constrained f-divergences.
Abstract
Data-processing is a desired property of classical and quantum divergences and information measures. In information theory, the contraction coefficient measures how much the distinguishability of quantum states decreases when they are transmitted through a quantum channel, establishing linear strong data-processing inequalities (SDPI). However, these linear SDPI are not always tight and can be improved in most of the cases. In this work, we establish non-linear SDPI for quantum hockey-stick divergence for noisy channels that satisfy a certain noise criterion. We also note that our results improve upon existing linear SDPI for quantum hockey-stick divergences and also non-linear SDPI for classical hockey-stick divergence. We define curves generalizing Dobrushin curves for the quantum setting while characterizing SDPI for the sequential composition of heterogeneous channels. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Wireless Communication Security Techniques · Quantum Computing Algorithms and Architecture
