Optimal probabilistic dense coding schemes

DOI10.1007/s11128-017-1545-7zbMath1373.81165arXiv1703.00804OpenAlexW3105751143MaRDI QIDQ2412630

Leonardo Neves, Roger A. Kögler

Publication date: 24 October 2017

Published in: Quantum Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

dense codingmultistage decodingmaximum-confidence measurementsquantum-state separation

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum coding (general) (81P70)

Related Items (1)

Comparison and analysis of the control power between two different perfect controlled teleportation schemes using four-particle cluster state

Cites Work

• Unnamed Item
• Extracting remaining information from an inconclusive result in optimal unambiguous state discrimination
• Deterministic quantum state transformations
• Optimum measurements for discrimination among symmetric quantum states and parameter estimation
• Optimal dense coding with mixed state entanglement
• Discrimination of quantum states
• Quantum cryptography based on Bell’s theorem
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Quantum cryptography using any two nonorthogonal states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Efficient bipartite quantum state purification in arbitrary dimensional Hilbert spaces
• Quantum gates on hybrid qudits
• DENSE CODING WITH MULTIPARTITE QUANTUM STATES
• Elements of Information Theory

This page was built for publication: Optimal probabilistic dense coding schemes