arXiv:2109.12518 · PRX Quantum

Dense Coding with Locality Restriction on Decoders: Quantum Encoders versus Superquantum Encoders

Masahito Hayashi, Kun Wang

Published Sep 28, 2022• 14 citations

Abstract

We investigate dense coding by imposing various locality restrictions to our decoder by employing the resource theory of asymmetry framework. In this task, the sender Alice and the receiver Bob share an entangled state. She encodes the classical information into it using a symmetric preserving encoder and sends the encoded state to Bob through a noiseless quantum channel. The decoder is limited to a measurement to satisfy a certain locality condition on the bipartite system composed of the receiving system and the preshared entanglement half. Our contributions are summarized as follows: First, we derive an achievable transmission rate for this task dependently of conditions of encoder and decoder. Surprisingly, we show that the obtained rate cannot be improved even when the decoder is relaxed to local measurements, two-way LOCCs, separable measurements, or partial transpose positive (PPT) measurements for the bipartite system. Moreover, depending on the class of allowed measurements with a locality condition, we relax the class of encoding operations to super-quantum encoders in the framework of general probability theory (GPT). That is, when our decoder is restricted to a separable measurement, theoretically, a positive operation is allowed as an encoding operation. Surprisingly, even under this type of super-quantum relaxation, the transmission rate cannot be improved. This fact highlights the universal validity of our analysis beyond quantum theory.

DOI: 10.1103/prxquantum.3.030346

Related papers

On quantum advantage in dense coding

Michał Horodecki, Marco Piani

The quantum advantage of dense coding—the increase in the rate of classical information transmission due to shared entanglement—is studied. General encoding quantum operations are considered. Particular attention is devoted to the case of many senders and one receiver. It is shown that restrictions on the possible operations among the many senders can strongly affect the usefulness of a shared quantum state for dense coding. It is shown, e.g., that there are states that do not provide any quantum advantage if communication among the senders is not allowed, but are useful for dense coding as soon as the senders can communicate classically. These results are actually independent of the particular quantification of the quantum advantage, being valid for any reasonable definition of such a rate increase. It is further shown that the quantum advantage of dense coding satisfies a monogamy relation with the so-called entanglement of purification.

arXiv:quant-ph/0701134Journal of Physics A Mathematical and TheoreticalFeb 24, 201251 citations

Coherent Communication with Noisy Resources

Mark M. Wilde

This chapter demonstrates the power of both coherent communication from Chapter 7 and the particular protocol for entanglement-assisted classical coding from the previous chapter. Recall that coherent dense coding is a version of the dense coding protocol in which the sender and receiver perform all of its steps coherently.1 Since our protocol for entanglement-assisted classical coding from the previous chapter is really just a glorified dense coding protocol, the sender and receiver can perform each of its steps coherently, generating a protocol for entanglement-assisted coherent coding. Then, by exploiting the fact that two coherent bits are equivalent to a qubit and an ebit, we obtain a protocol for entanglement-assisted quantum coding that consumes far less entanglement than a naive strategy would in order to accomplish this task. We next combine this entanglement-assisted quantum coding protocol with entanglement distribution (Section 6.2.1) and obtain a protocol for quantum communication at a rate equal to the channel's coherent information (Section 13.5). This sequence of steps demonstrates an alternate proof of the direct part of the quantum capacity theorem stated in Chapter 24. Entanglement-assisted classical communication is one generalization of superdense coding, in which the noiseless qubit channel becomes an arbitrary noisy quantum channel while the noiseless ebits remain noiseless. Another generalization of super-dense coding is a protocol named noisy super-dense coding , in which the shared entanglement becomes a shared noisy state ρ AB and the noiseless qubit channels remain noiseless. Interestingly, the protocol that we employ in this chapter for noisy super-dense coding is essentially equivalent to the protocol from the previous chapter for entanglement-assisted classical communication, with some slight modifications to account for the different setting. We can also construct a coherent version of noisy super-dense coding, leading to a protocol that we name coherent state transfer . Coherent state transfer accomplishes not only the task of generating coherent communication between Alice and Bob, but it also allows Alice to transfer her share of the state ρ AB to Bob.

Cambridge University Press eBooksNov 2, 20160 citations

On the Power of PPT-Preserving and Non-Signalling Codes

Debbie Leung, William Matthews

We derive one-shot upper bounds for quantum noisy channel codes. We do so by regarding a channel code as a bipartite operation with an encoder belonging to the sender and a decoder belonging to the receiver, and imposing constraints on the bipartite operation. We investigate the power of codes whose bipartite operation is non-signalling from Alice to Bob, positive-partial transpose (PPT) preserving, or both, and derive a simple semidefinite program for the achievable entanglement fidelity. Using the semidefinite program, we show that the non-signalling-assisted quantum capacity for memoryless channels is equal to the entanglement-assisted capacity. We also relate our PPT-preserving codes and the PPT-preserving entanglement distillation protocols studied by Rains. Applying these results to a concrete example, the 3-dimensional Werner-Holevo channel, we find that codes that are non-signalling and PPT-preserving can be strictly less powerful than codes satisfying either one of the constraints, and therefore provide a tighter bound for unassisted codes. Furthermore, PPT-preserving non-signalling codes can send 1 qubit perfectly over two uses of the channel, which has no quantum capacity. We discuss whether this can be interpreted as a form of superactivation of quantum capacity.

arXiv:1406.7142IEEE Transactions on Information TheoryJun 2, 201583 citations

Dense coding capacity of a quantum channel

Riccardo Laurenza, Cosmo Lupo, Seth Lloyd +1 more

The authors consider a realistic dense coding scenario where noise is affecting both the transmission of quantum systems from the sender (Bob) to the receiver (Alice), and the distribution of the resource state from Alice to Bob. Assuming that this noise is described by the same quantum channel, the authors define its dense coding capacity by optimizing over all adaptive strategies that Alice can implement, while Bob encodes the information by means of Pauli operators.

arXiv:1903.09168Physical Review ResearchApr 9, 202025 citations

Performance of dense coding and teleportation for random states: Augmentation via preprocessing

Rivu Gupta, Shashank Gupta, Shiladitya Mal +1 more

In order to understand the resourcefulness of a natural quantum system in quantum communication tasks, we study the dense coding capacity (DCC) and teleportation fidelity of Haar uniformly generated random multipartite states of various ranks. We prove that when a rank-2 two-qubit state, a Werner state, and a pure state possess the same amount of entanglement, the DCC of a rank-2 state belongs to the envelope made by pure and Werner states. In a similar way, we obtain an upper bound via the generalized Greenberger-Horne-Zeilinger state for rank-2 three-qubit states when the dense coding with two senders and a single receiver is performed and entanglement is measured in the senders:receiver bipartition. The normalized frequency distributions of DCC for randomly generated two-, three-, and four-qubit density matrices with global as well as local decodings at the receiver's end are reported. The estimation of mean DCC for two-qubit states is found to be in good agreement with the numerical simulations. Universally, we observe that the performance of random states for dense coding as well as teleportation decreases with the increase of the rank of states, which we have shown to be surmounted by the local preprocessing operations performed on the shared states before starting the protocols, irrespective of the rank of the states. The local preprocessing employed here is based on positive operator valued measurements along with classical communication and we show that unlike dense coding with two-qubit random states, the senders' operations are always helpful to probabilistically enhance the capabilities of implementing dense coding as well as teleportation.

arXiv:2012.05865Physical Review AMar 15, 202110 citations

Coherent Communication with Noisy Resources

Mark M. Wilde

This chapter demonstrates the power of both coherent communication from Chapter 7 and the particular protocol for entanglement-assisted classical coding from the previous chapter. Recall that coherent dense coding is a version of the dense coding protocol in which the sender and receiver perform all of its steps coherently. Since our protocol for entanglement-assisted classical coding from the previous chapter is really just a glorified dense coding protocol, the sender and receiver can perform each of its steps coherently, generating a protocol for entanglement-assisted coherent coding. Then, by exploiting the fact that two coherent bits are equivalent to a qubit and an ebit, we obtain a protocol for entanglement-assisted quantum coding that consumes far less entanglement than a naive strategy would in order to accomplish this task. We next combine this entanglement-assisted quantum coding protocol with entanglement distribution (Section 6.2.1) and obtain a protocol for which the channel's coherent information (Section 12.5) is an achievable rate for quantum communication. This sequence of steps demonstrates an alternate proof of the direct part of the quantum channel coding theorem stated in Chapter 23. Entanglement-assisted classical communication is one generalization of superdense coding, in which the noiseless qubit channel becomes an arbitrary noisy quantum channel while the noiseless ebits remain noiseless. Another generalization of super-dense coding is a protocol named noisy super-dense coding , in which the shared entanglement becomes a shared noisy state ρ AB and the noiseless qubit channels remain noiseless.

Cambridge University Press eBooksApr 18, 20130 citations