When quantum memory is useful for dense coding

DOI10.1007/S11005-024-01831-XMaRDI QIDQ6571069FDO

Authors Ryuji Takagi, Masahito Hayashi

Publication date 11 July 2024

Published in Letters in Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

dense codinggroup representationquantum memorypreshared state

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Finite-dimensional groups and algebras motivated by physics and their representations (81R05) Quantum entropies (81P17) LOCC, teleportation, dense coding, remote state operations, distillation (81P48)

Recommendations

• On quantum advantage in dense coding
• DENSE CODING WITH MULTIPARTITE QUANTUM STATES
• Optimal dense coding with mixed state entanglement
• Simultaneous dense coding
• Quantum dense coding by spatial state entanglement

Cites work

• A group theoretic approach to quantum information. Translated from the Japanese
• Algebraic constructions of Shannon codes for regular channels
• Asymptotic Optimality of Group and Systematic Codes for Some Channels
• Classical capacity of a noiseless quantum channel assisted by noisy entanglement
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases
• Encoding Classical Information Into Quantum Resources
• Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification
• Genuine quantum coherence
• Novel method for one-way local distinguishability of generalized Bell states in arbitrary dimension
• On quantum advantage in dense coding
• Optimal dense coding with mixed state entanglement
• Quantum Wiretap Channel With Non-Uniform Random Number and Its Exponent and Equivocation Rate of Leaked Information
• Reference frames, superselection rules, and quantum information
• Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
• Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions
• Strong converse and Stein's lemma in quantum hypothesis testing
• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• Sufficient subalgebras and the relative entropy of states of a von Neumann algebra
• The capacity of a quantum channel for simultaneous transmission of classical and quantum information
• The capacity of the quantum channel with general signal states
• The proper formula for relative entropy and its asymptotics in quantum probability
• The theory of manipulations of pure state asymmetry. I: Basic tools, equivalence classes and single copy transformations

This page was built for publication: When quantum memory is useful for dense coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571069)