Computable lower bounds on the entanglement cost of quantum channels

DOI10.1088/1751-8121/aca731OpenAlexW4310992455MaRDI QIDQ5879198

Bartosz Regula, Ludovico Lami

Publication date: 27 February 2023

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.09257

zbMATH Keywords

quantum channelsirreversibilitysemidefinite programquantum capacityentanglement costno second law

Mathematics Subject Classification ID

Quantum theory (81-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Monotonicity of the quantum relative entropy under positive maps
• Equivalence of additivity questions in quantum information theory
• Faithful squashed entanglement
• The quantum reverse Shannon theorem based on one-shot information theory
• On general minimax theorems
• A reversible theory of entanglement and its relation to the second law
• Completely positive linear maps on complex matrices
• The physics and mathematics of the second law of thermodynamics
• On the energy-constrained diamond norm and its application in quantum information theory
• Amortized channel divergence for asymptotic quantum channel discrimination
• Relative entropy bounds on quantum, private and repeater capacities
• Subalgebras of \(C^ *\)-algebras
• The asymptotic entanglement cost of preparing a quantum state
• Squashed entanglement in infinite dimensions
• On the Power of PPT-Preserving and Non-Signalling Codes
• The Squashed Entanglement of a Quantum Channel
• The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
• Quantum Computation and Quantum Information
• Convexity and Optimization in Banach Spaces
• Optimum unambiguous discrimination of two mixed quantum states
• On the notion of entanglement in Hilbert spaces
• On the capacities of bipartite hamiltonians and unitary gates
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• A Resource Framework for Quantum Shannon Theory
• Quantum computations: algorithms and error correction
• Separability Criterion for Density Matrices
• Quantifying Entanglement
• General teleportation channel, singlet fraction, and quasidistillation
• A semidefinite program for distillable entanglement
• Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• “Squashed entanglement”: An additive entanglement measure
• Theoretical framework for quantum networks
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• On approximation of infinite-dimensional quantum channels
• Semidefinite Programming Converse Bounds for Quantum Communication
• Entanglement Breaking Channels
• Entanglement Cost of Quantum Channels
• Mixed-state entanglement and quantum error correction
• Positive Functions on C ∗ -Algebras