arXiv:quant-ph/0101117 · Physical Review A

Classical information capacity of superdense coding

Garry Bowen

Published Jan 10, 2001• 91 citations

Abstract

Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum classical channel capacity for states that are not maximally entangled is derived. Particular schemes are then shown to attain this capacity, first for pairs of qubits, and second for pairs of qutrits.

DOI: 10.1103/physreva.63.022302

Related papers

Quantum Authentication Protocol for Secure Quantum Superdense Coding

Teo Kim, Jinsuk Baek, John T. Yi

In quantum information theory, superdense coding allows two network entities to exchange two classical bits via a quantum channel using a single quantum bit (qubit) transmission, provided they have pre-shared an entangled qubit. An attacker intercepting the qubit during transmission cannot extract meaningful data without the other entangled qubit from the pair. However, an attacker can disrupt the communication by introducing its own qubit to the receiver. To enhance the security of superdense coding, we propose an authentication mechanism through a classical communication channel.

IEEE SoutheastConMar 15, 20243 citations

Superdense coding using multipartite states

Gustavo Rigolin

We show that with the fourpartite quantum channel used to teleport an arbitrary two qubit state, we can construct a superdense coding protocol where it is possible to transmit 4 bits of classical information sending only 2 qubits. Alice and Bob initially share a four qubit maximally entangled state and by locally manipulating her two qubits Alice can generate 16 orthogonal maximally entangled states, which are used to encode the message transmitted to Bob. He reads the 4 bit message by a generalized Bell state measurement. A generalized protocol in which 2N bits of classical information is transmitted via N qubits is also presented. We also show that this four(2N-)partite channel is equivalent to two(N) Bell states, which proves that we need two(N) Bell states to teleport a two(N) qubit system.

arXiv:quant-ph/0407193Jul 23, 20043 citations

Hyperdense coding and superadditivity of classical capacities in hypersphere theories

Serge Massar, Stefano Pironio, Damián Pitalúa-García

In quantum superdense coding, two parties previously sharing entanglement can communicate a two bit message by sending a single qubit.We study this feature in the broader framework of general probabilistic theories.We consider a particular class of theories in which the local state space of the communicating parties corresponds to Euclidian hyperballs of dimension n (the case n = 3 corresponds to the Bloch ball of quantum theory).We show that a single n-ball can encode at most one bit of information, independently of n.We introduce a bipartite extension of such theories for which there exist dense coding protocols such that n log 1 2 + ( ) bits are communicated if entanglement is previously shared by the communicating parties.For n 3, > these protocols are more powerful than the quantum one, because more than two bits are communicated by transmission of a system that locally encodes at most one bit.We call this phenomenon hyperdense coding (HDC).Our HDC protocols imply superadditive classical capacities: two entangled systems can encode n log 1 2 2 + > ( ) bits, even though each system individually encodes at most one bit.In our examples, HDC and superadditivity of classical capacities come at the expense of violating tomographic locality or dynamical continuous reversibility.

arXiv:1504.05147New Journal of PhysicsOct 26, 201514 citations

Exploring the Scalability and Error Tolerance of N-Qubit Superdense Coding

Heinz, Benjamin

Superdense coding is a quantum communication protocol that enables the transmission of more than one classical bit of information per qubit, using entangled states. While superdense coding with 2-qubits is well understood and directly maps to the Bell states, the same cannot be said for higher numbers of qubits. This project aims to develop an algorithm for superdense coding using a larger number of qubits, while analyzing how the capacity for information transmission scales with qubit count. Additionally, we will determine the error thresholds for accurately reconstructing the encoded information and investigate how error scales as the number of qubits increases. Gaining a deeper understanding of superdense coding has significant applications in quantum cryptography, as superdense coding schemes can be used to set up quantum secure direct communication (QSDC) protocols.

Apr 12, 20250 citations

Quantum Hyperdense Coding for Distributed Communications

Sándor Imre

Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a pre-shared entangled Bell pair. This paper introduces a new protocol which is intended for distributed communication. Using a pre-shared entangled Bell pair and 1 classical bit 2,5 classical bits can be transmitted in average. This means not only valuable increase in capacity but the two-way distributed operation opens new fields of investigation.

arXiv:1210.2856Oct 10, 20121 citation

Classical Error-correcting Codes in Quantum Communications

Christopher Boyd

This thesis investigates the feasibility of utilising classical error-correcting codes in quantum communications, specifically in the entanglement-assisted communication of classical information over quantum depolarising channels. A classical-quantum communication system is presented, which relies on error-correction in the classical domain to achieve a classical information rate that approaches the entanglement-assisted capacity of a depolarising channel. Classical information is transmitted over the quantum channel by means of the superdense coding protocol. Different scenarios for the system are considered, including the noiseless and noisy distribution of initial entanglement resources and the use of higher-order entangled states. The overall transmission model corresponding to each scenario is shown to reduce to a classical, discrete and memoryless channel. The capacities of these equivalent classical channels are derived, and an inherent capacity loss when binary classical error correcting codes are employed is identified, motivating the use of non-binary codes. It is ultimately demonstrated that duo-binary turbo codes outperform binary turbo codes in all investigated scenarios, a result of the former's ability to exploit correlations between the pairs of classical bits communicated via the superdense coding protocol.

Oct 20, 20143 citations