Geometric Rényi divergence and its applications in quantum channel capacities
From MaRDI portal
Publication:2031126
DOI10.1007/s00220-021-04064-4OpenAlexW3165533811MaRDI QIDQ2031126
Publication date: 8 June 2021
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.05758
Channel models (including quantum) in information and communication theory (94A40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum state tomography, quantum state discrimination (81P18) Quantum channels, fidelity (81P47)
Related Items (6)
Variational quantum algorithms for trace norms and their applications ⋮ Optimal Self-Concordant Barriers for Quantum Relative Entropies ⋮ Channel divergences and complexity in algebraic QFT ⋮ Geometric distinguishability measures limit quantum channel estimation and discrimination ⋮ The α → 1 limit of the sharp quantum Rényi divergence ⋮ Uncertainty of quantum channels via modified generalized variance and modified generalized Wigner-Yanase-Dyson skew information
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization
- Quantum cryptography: public key distribution and coin tossing
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- On general minimax theorems
- The Chernoff lower bound for symmetric quantum hypothesis testing
- Quasi-entropies for finite quantum systems
- The proper formula for relative entropy and its asymptotics in quantum probability
- Means of positive linear operators
- Semidefinite approximations of the matrix logarithm
- Fault-tolerant quantum computation by anyons
- Separability of mixed states: necessary and sufficient conditions.
- Amortized channel divergence for asymptotic quantum channel discrimination
- Lower and upper bounds on nonunital qubit channel capacities
- Relative entropy bounds on quantum, private and repeater capacities
- A new quantum version of \(f\)-divergence
- On the semidefinite representation of real functions applied to symmetric matrices
- Quantum privacy and quantum wiretap channels
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Strong converse and Stein's lemma in quantum hypothesis testing
- Positivity of linear maps under tensor powers
- Strong converse for the quantum capacity of the erasure channel for almost all codes
- Efficient Approximation of Quantum Channel Capacities
- Strong Converse Rates for Quantum Communication
- The Squashed Entanglement of a Quantum Channel
- The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
- Graph Implementations for Nonsmooth Convex Programs
- The resource theory of stabilizer quantum computation
- Fault-Tolerant Quantum Computation with Constant Error Rate
- SECURITY OF QUANTUM KEY DISTRIBUTION
- On the capacities of bipartite hamiltonians and unitary gates
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
- The Quantum Capacity With Symmetric Side Channels
- Quantum computations: algorithms and error correction
- Quantum coding theorems
- The capacity of the quantum channel with general signal states
- On quantum fidelities and channel capacities
- A semidefinite program for distillable entanglement
- Approximate Degradable Quantum Channels
- Semidefinite Programming Strong Converse Bounds for Classical Capacity
- Approximate Quantum Markov Chains
- Efficient optimization of the quantum relative entropy
- Capacity bounds via operator space methods
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Additivity for unital qubit channels
- Min- and Max-Relative Entropies and a New Entanglement Monotone
- A strengthened data processing inequality for the Belavkin–Staszewski relative entropy
- Computing quantum discord is NP-complete
- Weighted means and Karcher equations of positive operators
- Semidefinite Programming Converse Bounds for Quantum Communication
- On Converse Bounds for Classical Communication Over Quantum Channels
- Converse Bounds for Private Communication Over Quantum Channels
- Entanglement Breaking Channels
- Entanglement Cost of Quantum Channels
- Alice and Bob Meet Banach
- Different quantum f-divergences and the reversibility of quantum operations
- On quantum Rényi entropies: A new generalization and some properties
- Quantum Information Processing with Finite Resources
- Conditional expectation in an operator algebra. IV. Entropy and information
This page was built for publication: Geometric Rényi divergence and its applications in quantum channel capacities
