Asymptotic LOCC dense coding with the symmetric four-qubit W state
Read the paper (PDF, 5 pages) · Zenodo record
Plain-English explanation · Read on this page · Collaboration
Abstract
The distributed dense-coding question posed by Bruß and collaborators asks whether the symmetric four-qubit W state gives a strict advantage when two independent senders each transmit one qubit to a different receiver and the receivers decode using local operations and classical communication (LOCC). We give an affirmative answer in their asymptotic unitary-encoding model. Independent Pauli encodings followed by a complete Bell measurement at one receiver produce a finite classical–quantum multiple-access channel whose entire output is local to the other receiver. Winter’s coding theorem gives an achievable sum-rate supremum of 3/2 + h₂(1/4) = 2.311278… bits per resource copy. In particular, both senders can transmit 9/8 bits per copy with vanishing average error. This settles the stated W-state classification question using established measurement and coding ingredients; it does not determine the optimal LOCC capacity or assert a one-copy advantage.
The idea in plain English
Two senders and two receivers share a four-qubit W state. Each sender encodes an independent message and sends one qubit to their own receiver. The receivers can exchange ordinary classical messages, but cannot send quantum systems to each other.
The paper shows that, by coding across many copies, they can transmit more than the two-bit total available without the shared entangled resource. Its protocol approaches a combined rate of about 2.311278 bits per copy. A concrete rate safely inside the proven region is 1.125 bits per sender, or 2.25 bits in total.
One receiver measures in the Bell basis and forwards the outcome. The other keeps their quantum systems and decodes them together across many copies. Keeping those systems quantum until the final decoding step is what allows a standard multiple-access coding theorem to be used.
The result answers the specified W-state classification question in an asymptotic unitary-encoding model. It does not say that a single copy beats two bits, or that 2.311278 is the best possible rate for all allowed protocols.
The precise result
For the symmetric state |W₄⟩ = (|1000⟩ + |0100⟩ + |0010⟩ + |0001⟩)/2 in the order A₁A₂B₁B₂, sender i initially holds Aᵢ and receiver i holds Bᵢ. Each sender transmits their encoded qubits noiselessly to their corresponding receiver.
With independent uniformly distributed messages, separate fixed codebooks and local unitary encoders, every nonnegative rate pair with R₁ < 3/2, R₂ < 3/2 and R₁ + R₂ < 3/2 + h₂(1/4) is achievable with vanishing uniform average decoding error.
The protocol’s achievable sum-rate supremum is 3/2 + h₂(1/4) ≈ 2.311278 bits per resource copy, giving a lower bound on the optimal LOCC capacity. In particular, R₁ = R₂ = 9/8 gives a total rate of 9/4 bits per copy.
Independent single-qubit Pauli operations suffice for encoding. A complete Bell measurement at the first receiver, classical forwarding and a collective local measurement at the second receiver implement the decoder; no extra shared entanglement or quantum communication between receivers is supplied.
This places the symmetric W₄ state in the LOCC-dense-codeable class of the stated original unitary-encoding model. The paper also connects its vanishing-error rate statement to the source’s asymptotic accessible-information formulation.
Why the result holds
A paired Bell decomposition makes the effect of independent Pauli encodings explicit. The first receiver performs a complete Bell measurement and forwards every outcome, without postselecting successful events.
That measurement produces a finite classical–quantum multiple-access channel. The classical outcome and remaining quantum state are both held by the second receiver, so Winter’s ordinary single-output coding theorem applies to this channel.
The channel output entropy is 3/2 for each input pair. Averaging over either sender gives entropy 3, while averaging over both gives 3 + h₂(1/4). These yield the two individual bounds 3/2 and the sum bound 3/2 + h₂(1/4).
The many-copy decoder can be conditioned on the forwarded classical outcome string, leaving its quantum measurement entirely inside the second receiver’s laboratory. Separate Pauli codebooks implement independent senders.
The rate pair (9/8,9/8) lies strictly inside the achievable region and exceeds the two-bit classical benchmark. A Fano inequality transfers reliable message decoding to the accessible-information formulation of the original question.
Scope and limitations
The rate is asymptotic over many independent resource copies and allows collective quantum decoding inside a receiver’s laboratory. It is not a one-copy advantage, a finite-block performance guarantee or an explicit practical family of codebooks.
The theorem gives a capacity lower bound. It does not prove that 3/2 + h₂(1/4) is the optimal LOCC capacity, characterize every achievable rate pair or rule out better protocols.
The error criterion is uniform average error over independent messages. Zero-error and maximal-error coding are not established.
The ownership and routing are fixed: each independent sender sends one qubit per copy to their own receiver, and receiver operations are local across A₁B₁ : A₂B₂. There is no sender message disclosure, feedback to senders, additional shared entanglement or quantum communication between receivers.
The two-bit calculation when both receivers immediately use Bell measurements concerns that particular one-copy measurement and input ensemble. It is not a converse bound for arbitrary one-copy LOCC strategies.
Bell forwarding and multiple-access dense coding have earlier precedents. The claimed addition is the specific retained-quantum-output channel and its achievable region for this W₄ problem, using Winter’s established coding theorem. This bounded comparison does not certify worldwide first priority, formal proof verification or completed human peer review.
Status and AI use
AI tools were used extensively in developing the solution, checking the proof, reviewing the literature and preparing the paper. Internal AI reviews do not constitute conventional human peer review or refereeing; exact finite channel checks supplement the mathematical argument.
Read the paper
Open PDF in a full window · Download the original from Zenodo
Supporting materials
Collaborate on this result
I welcome substantive collaboration on independent verification of the channel and coding argument, comparison with earlier distributed dense-coding protocols, and preparation for journal review. Expertise in quantum Shannon theory, multiple-access coding or LOCC measurements would be especially useful.
Authorship and responsibilities would be discussed in relation to the substantive contributions made.
Cite this paper
Alec Kriebel. (2026). Asymptotic LOCC dense coding with the symmetric four-qubit W state (Version 1.0) [Preprint]. Zenodo. https://doi.org/10.5281/zenodo.23147866
Background and prior work
- Bruß and collaborators, Distributed quantum dense coding: Introduces the distributed task, unitary-encoding framework and usefulness classification. Several-receiver bounds must be distinguished from achieved rates.
- Bruß, distributed dense-coding contribution, Oberwolfach Report 4/2005: Printed pages 203–205 explicitly ask whether the four-qubit W state belongs to the LOCC-dense-codeable class.
- Winter, The capacity of the quantum multiple-access channel: Theorem 9 gives product-prior multiple-access achievability with separate encoder maps and vanishing uniform average error. Its single quantum output must be available in one receiver’s laboratory.
- Pradhan, Agrawal and Pati, Teleportation and superdense coding with genuine quadripartite entangled states: Section 4.2.3 already uses Bell measurements and classical forwarding for a two-bit W-state protocol. The present protocol retains the second receiver’s quantum output for many-copy decoding.
- Cao and Song, Quantum secure direct communication with W state: An earlier W-state communication scheme using Bell measurements and classical communication, credited by the manuscript for its paired Bell decomposition. Its security task is distinct from the independent-message rate theorem here.
- Huang, Zhang and Hou, Classical capacity of a quantum multiple-access channel: Earlier work already connects multiple-access coding with dense coding. That general connection is not claimed as a new idea here.
- Hayashi and Wang, Dense Coding with Locality Restriction on Decoders: Studies a sender, receiver and helper with a different ownership and transmission arrangement. Its capacity formula cannot be imported without checking the receiver partition used here.