Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

In the quiet, controlled world of quantum information, scientists study how messages travel through noisy paths and how much effort is required to build a perfect copy of a communication line. Imagine a telephone line that occasionally drops words or scrambles them; in the quantum world, this is a channel that disturbs the delicate states of particles like electrons or photons. To understand how much useful information such a line can carry, researchers must look at what happens when the line is used many times in a row. Usually, using the line repeatedly creates complex connections between the different uses, making the total capacity hard to calculate. It is as if the noise in one call changes the noise in the next, requiring a complicated averaging process over an infinite number of calls to find the true limit. Similarly, figuring out how much "entanglement"—a special quantum resource that links particles together—is needed to simulate such a channel also usually demands this same difficult, infinite averaging.

A specific type of noise, known as amplitude damping, models a very common physical event: an excited atom losing energy and falling back to a calm, ground state. This process is fundamental to how quantum computers might fail or how signals degrade in real-world devices. For decades, scientists have known how much information this specific channel could carry in a single use, but it remained a mystery whether using the channel many times with clever, entangled strategies could squeeze out even more information. The question was whether the simple, single-use calculation was the whole story or just a lower bound. A new study by researchers at the Hong Kong University of Science and Technology and QudeLeap Research has finally settled this. They proved that for this type of channel, and for a broad class of similar quantum lines, the complicated infinite averaging is unnecessary. The simple, single-use calculation is exactly the right answer.

The researchers discovered a specific structural rule that makes this simplification possible. They found that if a quantum channel can produce a perfectly pure, undisturbed state from a specific input, a hidden constraint appears in the mathematics of the system. This constraint prevents the different parts of the system from interacting in a way that would lower the cost of simulation or increase the information capacity beyond the simple limit. It is a bit like a room with a locked door; if a certain path is blocked, the people inside cannot take a shortcut that would otherwise change the outcome. In this case, the "locked door" is a specific region of the quantum system that remains empty. Because this region is empty, the complex correlations that usually make these problems difficult simply cannot form.

This finding allows the team to remove the need for regularization, the mathematical process of averaging over infinite uses, for every qubit-to-qubit channel that admits a pure output. A qubit is the basic unit of quantum information, analogous to a bit in a classical computer but capable of being in a superposition of states. The study shows that for these channels, the amount of information they can carry is exactly what was calculated for a single use. Furthermore, the amount of entanglement required to simulate the channel is also exactly equal to the entanglement of a single copy of the channel's output state. This means that for the amplitude damping channel, the cost to simulate it is precisely a specific value determined by the probability of the damping event. If the probability of the atom losing energy is denoted by a number between zero and one, the cost is a specific function of that number, measured in units called ebits, which quantify the strength of the quantum link.

The team did not stop at the general rule; they applied it directly to the amplitude damping channel to provide exact formulas. They confirmed that the best way to send information is to use a specific pair of pure states, a method previously known to be good but not proven to be the absolute best when used in long sequences. They showed that even if the sender uses entangled states across many uses of the channel, they cannot beat the rate achieved by this simple, single-use strategy. They also identified the exact average input state that maximizes this rate for any given level of noise. For the simulation cost, they derived a precise formula that tells exactly how many ebits are needed per use of the channel. This cost is equal to the entanglement of formation of the channel's Choi state, a specific mathematical representation of the channel, which they calculated explicitly.

To ensure their results were robust, the researchers developed a new mathematical tool, a triangular block entropy inequality, to prove that the entanglement cost cannot be reduced by adding extra systems or using complex strategies. This proof works for systems of any finite size and relies on the fact that the "forbidden" region of the system remains empty. They also constructed a specific, simple method for simulating the channel using only two possible outcomes, which achieves the theoretical limit uniformly across all possible inputs. This construction acts as a concrete certificate that the theoretical limit is reachable. The study also clarifies that while these results hold for the amplitude damping channel, they do not automatically apply to more complex scenarios, such as channels at finite temperatures, where the "locked door" might not be fully sealed.

The implications of this work are clear for the field of quantum communication. It removes a major uncertainty about the capacity of one of the most important quantum channels. By proving that the single-use limit is the true limit, the researchers have provided a definitive answer to a long-standing question. They have shown that for this class of channels, the complex behavior of many uses does not offer an advantage over the simple behavior of a single use. This simplifies the design of future quantum networks, as engineers can rely on single-use calculations to determine the maximum data rates and resource costs. The study also provides a clear path for finding other channels with similar properties: one simply needs to check if the channel admits a pure output, which guarantees that the complicated regularizations are not needed.

The researchers were careful to distinguish between what they proved and what remains open. They established that the classical capacity and entanglement cost are additive, meaning the total capacity of two channels used together is simply the sum of their individual capacities. This holds true even when the channels are different. However, they noted that their results apply to standard, non-adaptive communication and simulation. They did not address scenarios where the sender and receiver can adapt their strategies based on previous outcomes, nor did they cover the "strong converse" thresholds, which describe how quickly the error rate rises if one tries to send information faster than the capacity. These remain distinct challenges for future research.

In the end, the paper delivers a rare sense of closure in a field often defined by approximations and bounds. By identifying a simple geometric constraint—the absence of support in a specific sector of the system—the team unlocked the exact values for capacity and cost. They replaced a vague, infinite process with a concrete, finite calculation. For the amplitude damping channel, the answer is no longer a range of possibilities but a single, precise number. This clarity allows scientists to move forward with a solid foundation, knowing exactly how much information can be sent and how much resource is needed to build the channel, without the shadow of uncertainty hanging over the many-use limit.