Optimal probabilistic dense coding schemes
From MaRDI portal
Abstract: Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be perfectly distinguished due to the non-orthogonality of the quantum states carrying them. So far, the decoding process has been approached in two ways: (i) The message is always inferred, but with an associated (minimum) error; (ii) the message is inferred without error, but only sometimes; in case of failure, nothing else is done. Here, we generalize on these approaches and propose novel optimal probabilistic decoding schemes. The first uses quantum-state separation to increase the distinguishability of the messages with an optimal success probability. This scheme is shown to include (i) and (ii) as special cases and continuously interpolate between them, which enables the decoder to trade-off between the level of confidence desired to identify the received messages and the success probability for doing so. The second scheme, called multistage decoding, applies only for qudits (-level quantum systems with ) and consists of further attempts in the state identification process in case of failure in the first one. We show that this scheme is advantageous over (ii) as it increases the mutual information between the sender and receiver.
Recommendations
Cites work
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- DENSE CODING WITH MULTIPARTITE QUANTUM STATES
- Deterministic quantum state transformations
- Efficient bipartite quantum state purification in arbitrary dimensional Hilbert spaces
- Elements of Information Theory
- Extracting remaining information from an inconclusive result in optimal unambiguous state discrimination
- Optimal dense coding with mixed state entanglement
- Optimum measurements for discrimination among symmetric quantum states and parameter estimation
- Quantum cryptography based on Bell’s theorem
- Quantum cryptography using any two nonorthogonal states
- Quantum gates on hybrid qudits
- Quantum information.
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Tutorial review. Discrimination of quantum states
Cited in
(14)- Efficient prefix coding of uncertainty spaces
- Probabilistic coding of quantum states of different dimensions
- Design of extended dense coding protocol strategy based on combinatorial optimization
- Quantum binary channels with mixed states
- Optimal causal coding - decoding problems
- Probabilistic dense coding using a non-symmetric multipartite quantum channel
- scientific article; zbMATH DE number 1984078 (Why is no real title available?)
- Scheme of coding and decoding in high-dimensional quantum system
- Dense coding process with imperfect encoding operations
- Comparison and analysis of the control power between two different perfect controlled teleportation schemes using four-particle cluster state
- Efficient Coding and Risky Choice
- How to encode the states of two non-entangled qubits in one qutrit
- On the Number of Bits to Encode the Outputs of Densely Deployed Sensors
- Efficient Integer Coding for Arbitrary Probability Distributions
This page was built for publication: Optimal probabilistic dense coding schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412630)
