Noisy channel coding theorem in quantum information Why Shannon's noisy channel coding theorem can't be used for quantum communication applications?
Schumacher proved the first Noiseless theorem and there are quantum error correction mechanisms out there.
I guess I am not sure what is the gap in knowledge to prove the noisy channel coding theorem?
You have two questions here.

Why can't Shannon's Noisy Coding Theorem be used for a quantum channel?

What gaps are there to proving a quantum noisy channel coding theorem?


I will concentrate on the first question.
Shannon's noisy coding theorem says that for a memoryless channel,
$$ {\displaystyle \ C=\sup _{p_{X}}I(X;Y)},$$
where $p_X$ is maximized over all probability distributions over the input variable $X$.
If you try to apply this naïvely to quantum channels, you run into a bunch of problems:

The input and the output of a quantum communication channel are never around simultaneously, so the classical definition of $I(X;Y)$ doesn't work at all.
The proof depends on the fact that the channel is a probabilistic map taking the input to the output. This isn't true for quantum channels; a quantum channel is a completely positive trace-preserving linear operator.
Classical channels essentially only have one capacity. There are many different capacities for quantum channels. Are you trying to send classical or quantum information?  Do the sender and receiver have access to quantum entanglement? Can the receiver communicate on a classical channel that sends information back to the sender? Neither of these last two abilities change the capacity of classical channels, but they do change the capacity of quantum channels.
There are two equivalent expressions for mutual information:
$$I(X;Y) =H(X) +H(Y) - H(X,Y) = H(Y) - H(Y|X). $$
The quantum equivalents of these two expressions are not equal. In fact, each of these corresponds to a different quantum channel capacity; the first corresponds to the entanglement-assisted classical capacity  and the second to the Holevo-Schumacher-Westmoreland capacity.

So to summarize, you can't apply Shannon's Noisy Channel Coding theorem directly to quantum channels because not only does the proof not work, but the standard formulation of Shannon's capacity formula isn't even defined for quantum channels, and mutual information has two plausible extensions to the quantum case.
For your second question, there are several different quantum noisy channel coding theorems. The main problem with most of them is that they have a regularization step in them. Instead of getting an answer that you can compute by maximizing over inputs to a single channel use, you get an answer that is difficult to compute: you need to maximize a quantity that depends on $n$ channel uses and divide by $n$, and then take $n$ to infinity. There may not be a single-channel-use formula; even a lot of quantities in classical information theory don't have a single-symbol formula.