Unbounded Communication Power of a Qubit

Imagine you have a single, magical coin. In the world of classical physics, if you write a secret message on this coin and hand it to a friend, they can read the message once. But the moment they look at it, the "magic" is used up. If they hand it to a second friend, the second friend gets nothing new; the information is gone.

This is the standard rule of quantum mechanics: measuring a quantum particle (like a qubit) usually destroys the information it carries.

However, a new paper by Souradeep Sasmal, Som Kanjilal, and Debarshi Das suggests a surprising twist: You can actually pass that same single qubit to an unlimited number of friends, and every single one of them can still read the secret with better-than-chance success.

Here is how they explain this "unbounded" communication power using simple concepts and analogies.

The Setup: The "Random Access" Game

To understand the breakthrough, we first need the game they are playing, called a 2→1 Random Access Code (RAC).

The Sender (Alice): She has two secret bits of information (like two switches, each either ON or OFF). She encodes these two bits into a single qubit (our magical coin).
The Receivers (Bob 1, Bob 2, Bob 3...): They don't know which of the two bits Alice wants them to guess. Each Bob gets a random instruction: "Guess the first bit" or "Guess the second bit."
The Goal: Each Bob wants to guess the correct bit with a success rate higher than what is possible with a normal classical bit.

The Old Problem: The "Shattered Glass"

In the past, scientists thought this game had a hard limit. Because quantum measurements are "invasive" (like looking at a fragile soap bubble), the first person to look at the qubit would inevitably disturb it.

Bob 1 looks at the coin, guesses the bit, and passes the coin to Bob 2.
Because Bob 1 looked at it, the coin is now "bruised." Bob 2 might still get a hint, but the quantum advantage disappears quickly. Previous studies suggested only two people could get a quantum advantage before the information was completely exhausted.

The New Discovery: The "Soft Touch"

The authors realized that the "bruising" depends on how you look at the coin.

The Hard Look (Projective Measurement): If you look at the coin with a "hard" gaze (a sharp, precise measurement), you shatter the information. The coin is ruined for everyone else.
The Soft Touch (Unsharp Measurement): If you look at the coin with a "soft" gaze (a fuzzy, imprecise measurement), you can get some information without destroying the rest. It's like feeling the texture of a fruit without squeezing it too hard.

The paper's main trick is a trade-off strategy:

Bob 1 uses a "soft touch" to get a quantum advantage. He leaves the coin slightly bruised, but not broken.
Bob 2 receives the slightly bruised coin. To get his advantage, he uses a different type of soft touch.
Bob 3, 4, 5... continue this chain.

The Secret Sauce: "Preparation Distinguishability"

The authors introduce a new concept called Preparation Distinguishability. Think of this as the "clarity" of the message Alice originally wrote on the coin.

In the old view, every time someone looked at the coin, the clarity dropped to zero.
In this new view, the authors show that if Alice prepares the coin in a very specific, delicate way, and the Bobs use a specific sequence of "soft touches," the clarity does not drop to zero.

They found that by carefully tuning how "fuzzy" each Bob's measurement is, they can preserve enough of the coin's "clarity" for the next person.

The "Unbounded" Result

The most mind-blowing part of the paper is the conclusion: There is no limit to how many people can play.

The authors proved mathematically that you can have an infinite line of Bobs.

Bob 1 gets a quantum advantage.
Bob 1,000,000 can also get a quantum advantage.

How? By making the measurements of the earlier Bobs extremely "soft" (almost invisible) and the later Bobs slightly "sharper" as the information gets thinner. It's like passing a whisper down a line of people; if the first few people whisper very quietly, the last person can still hear the message clearly enough to win the game.

The Analogy of the "Infinite Whisper"

Imagine Alice whispers a secret into a very long, hollow tube.

Old Physics: The first person to put their ear to the tube hears the whisper, but the sound energy is absorbed, and the tube goes silent for everyone else.
This Paper: The first person puts their ear very close but doesn't block the sound completely. They hear the whisper, but the sound wave keeps traveling down the tube. The second person puts their ear in a slightly different spot, hears the echo, and passes it on.
Because the "sound" (information) is quantum, it doesn't behave like normal sound. With the right technique, the "echo" never fully dies out. An infinite number of people can listen in, and every single one of them can hear the secret better than if they were just guessing.

Summary

This paper shows that a single qubit is much more powerful than we thought. It's not a "one-time use" ticket. By carefully balancing how much information each person extracts (using "soft" measurements) and how the information was originally prepared, a single qubit can serve as a communication channel for an unlimited number of independent receivers, with every single one gaining a quantum advantage over classical methods.

The information encoded in a qubit does not have to be "used up" just because someone looked at it. It can be shared, sequentially, forever.

Technical Summary: Unbounded Communication Power of a Qubit

Problem Statement
Quantum mechanics is known to provide information-processing advantages over classical systems even at the single-qubit level, exemplified by the $2 \to 1$ random access code (RAC). In a standard RAC, a sender (Alice) encodes two classical bits into a single qubit, allowing a receiver (Bob) to retrieve either bit with a success probability exceeding the classical limit. However, a fundamental constraint in the standard formulation is that quantum measurements are inherently invasive; projective decoding measurements typically destroy the encoded information, restricting the quantum advantage to a single receiver. While recent work demonstrated that up to two sequential receivers could extract information using non-projective (unsharp) measurements, it remained an open question whether a single qubit could support an arbitrarily long sequence of independent receivers, each achieving a quantum advantage.

Methodology
The authors address this question by analyzing a sequential RAC scenario involving one sender (Alice) and a sequence of independent receivers ( $Bob^{(k)}$ for $k=1, 2, \dots$ ). The study introduces preparation distinguishability ( $\Delta$ ) as a key operational resource associated with the sender's state preparation. This quantity is defined as the maximum total variation distance between the outcome distributions of two marginal ensembles prepared by the sender.

The analysis proceeds through the following steps:

Decomposition of the RAC: The $2 \to 1$ RAC task is decomposed into two binary discrimination tasks corresponding to the two marginal ensembles of the encoded bits. The average success probability is shown to be bounded by the sum of the preparation distinguishabilities of these ensembles.
Resource Trade-off: The paper establishes a trade-off relation between the sender's preparation distinguishability and the receiver's measurement incompatibility (quantified by unsharpness parameters $\lambda$ ). The authors derive that a quantum advantage is achievable if and only if the measurements are incompatible ( $\lambda_1^2 + \lambda_2^2 > 1$ for anticommuting observables).
Sequential Evolution: The authors model the state evolution as the qubit passes through a chain of receivers. Each receiver performs either a projective measurement (on one observable) or an unsharp measurement (on the other). The state passed to the next receiver is the result of a non-selective measurement channel (Lüders instrument).
Recursive Analysis: By assuming anticommuting observables ( $\{B_1, B_2\} = 0$ ), the authors prove that the optimal measurement basis (Helstrom measurements) remains invariant for all subsequent receivers, even as the state is disturbed. They derive recursive relations for the evolution of the preparation distinguishabilities $\Delta^{(k)}_1$ and $\Delta^{(k)}_2$ as functions of the unsharpness parameters $\lambda_k$ .

Key Results

Unbounded Sequential Advantage: The central result is the proof that for any integer $N$ , there exists a sequence of unsharpness parameters $\{\lambda_k\}$ and an initial state preparation such that $N$ independent sequential receivers can each achieve a quantum advantage (success probability $> 3/4$ ).
Asymptotic Preservation: The authors demonstrate that by choosing an initial preparation where the distinguishability of one marginal ensemble approaches unity ( $\Delta_1 \to 1$ ) and the other approaches zero ( $\Delta_2 \to 0$ ), the decoding measurements can be tuned to preserve the preparation distinguishability maximally. Specifically, in the limit where the initial angle parameter $\omega \to 0$ , the sequence of unsharpness parameters $\lambda_k$ can be chosen to be arbitrarily small, ensuring that the disturbance to the qubit is minimal while still maintaining a quantum advantage for each receiver.
Trade-off Dynamics: The study reveals that while symmetric unsharpness requires a high degree of incompatibility to sustain advantage as distinguishability approaches classical limits, an asymmetric strategy (one projective, one unsharp measurement) allows for quantum advantage even when preparation distinguishabilities approach the classical bound. This asymmetry is crucial for enabling the unbounded sequence.

Significance and Claims
The paper claims to reveal a previously unexplored operational feature of the qubit: its ability to retain encoded information and support quantum advantages across an arbitrarily long sequence of independent decoding attempts. This challenges the conventional view that measurement-induced disturbance inevitably exhausts the communication power of a single qubit after a few steps.

The authors position this work as establishing "unbounded sequential sharing" in a prepare-measure communication framework, distinct from previous results on the unbounded sharing of nonlocal quantum correlations (entanglement). By identifying preparation distinguishability as a necessary resource alongside measurement incompatibility, the paper suggests a more complete resource-theoretic understanding of RACs. The results imply that information encoded in a qubit need not be entirely exhausted by repeated measurements, opening the possibility for one-to-many communication protocols across time, not just space.

The authors remain modest regarding immediate applications, noting that the work is theoretical and focuses on the fundamental limits of sequential quantum communication. They suggest future investigations could explore the role of preparation distinguishability in more general prepare-measure scenarios and identify other families of state preparations that enable similar unbounded advantages.