Everything about Superdense coding
Two-bit quantum communication protocol
In quantum information theory, superdense coding is a quantum communication protocol to communicate a number of classical bits of information by only transmitting a smaller number of qubits, under the assumption of sender and receiver pre-sharing an entangled resource. In its simplest form, the protocol involves two parties, often referred to as Alice and Bob in this context, which share a pair of maximally entangled qubits, and allows Alice to transmit two bits to Bob by sending only one qubit. This protocol was first proposed by Charles H. Bennett and Stephen Wiesner in 1970 and experimentally actualized in 1996 by Klaus Mattle, Harald Weinfurter, Paul G. Kwiat and Anton Zeilinger using entangled photon pairs. Superdense coding can be thought of as the opposite of quantum teleportation, in which one transfers one qubit from Alice to Bob by communicating two classical bits, as long as Alice and Bob have a pre-shared Bell pair. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Superdense codingA 5-minute orientation
- Skim a recent paper: Quantum key secure communication protocol via enhanced superdense codingInfluential work since 2022
- Pick up a classic book: Classical and Quantum Information TheoryThe most-reprinted book on the subject
- Read the landmark paper: Quantum secure direct communication with high-dimension quantum superdense codingCited 828 times
- Go sideways: Monogamy of entanglementA closely related topic
- Go sideways: Quantum channelA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Quantum secure direct communication with high-dimension quantum superdense coding
General scheme for superdense coding between multiparties
Superdense Coding of Quantum States
Classical information capacity of superdense coding
Probabilistic superdense coding
Symmetric scheme for superdense coding between multiparties
Efficient superdense coding in the presence of non-Markovian noise
High-capacity three-party quantum secret sharing with superdense coding
🆕 Influential since 2022
Quantum key secure communication protocol via enhanced superdense coding
Realizing ultrahigh capacity quantum superdense coding on quantum photonic chip
Absolutely secure distributed superdense coding: entanglement requirement for optimality
Superdense Coding Using Bragg Diffracted Hyperentangled Atoms
Multi-qubit teleportation and multi-bit superdense coding via cascade splitting
📚 Books worth reading
Classical and Quantum Information TheoryEmmanuel Desurvire · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Monogamy of entanglement In quantum physics, monogamy is the property of quantum entanglement that restricts entanglement from being freely shared between arbitrarily many parties…
- Quantum channel In quantum information theory, a quantum channel is a communication channel that can transmit quantum information, as well as classical information. An…
- Quantum pseudo-telepathy Quantum pseudo-telepathy describes the use of quantum entanglement to eliminate the need for classical communications. A nonlocal game is said to display…
- Quantum complex network Quantum complex networks are complex networks whose nodes are quantum computing devices. Quantum mechanics has been used to create secure quantum communications…
- Parity measurement Parity measurement (also referred to as Operator measurement) is a procedure in quantum information science used for error detection in quantum qubits…
- KLM protocol The KLM scheme or KLM protocol is an implementation of linear optical quantum computing (LOQC) developed in 2000 by Emanuel Knill, Raymond Laflamme and…
- Bell state In quantum information science, the Bell's states or EPR pairs are specific quantum states of two qubits that represent the simplest examples of quantum…
- Quantum coin flipping Consider two remote players, connected by a channel, that don't trust each other. The problem of them agreeing on a random bit by exchanging messages over…