Two quantum information processing protocols are said to be dual under resource reversal if the resources consumed (generated) in one protocol are generated (consumed) in the other. Previously known examples include the duality between entanglement concentration and dilution, and the duality between coherent versions of teleportation and super-dense coding. A quantum feedback channel is an isometry from a system belonging to Alice to a system shared between Alice and Bob. We show that such a resource may be reversibly decomposed into a perfect quantum channel and pure entanglement, generalizing both of the above examples. The dual protocols responsible for this decomposition are the "feedback father" (FF) protocol and the "fully quantum reverse Shannon" (FQRS) protocol. Moreover, the "fully quantum Slepian-Wolf" protocol (FQSW), a generalization of the recently discovered "quantum state merging", is related to FF by source-channel duality, and to FQRS by time reversal duality, thus forming a triangle of dualities. The source-channel duality is identified as the origin of the previously poorly understood "mother-father" duality. Due to a symmetry breaking, the dualities extend only partially to classical information theory.The canonical example of an entangled state is an ebit, or EPR pair,shared between two spatially separated parties Alice and Bob. The systematic study of entanglement was initiated by the realization that a general pure bipartite state |φ AB is asymptotically equivalent to a real number E of ebits, where E = H(A) φ , and H(A) φ = −Tr φ A log φ A is the von Neumann entropy of the restriction φ A = Tr B (φ AB ) of the state φ AB = |φ φ| AB to Alice's system. For any ǫ, δ > 0 and sufficiently large number n, there exists a protocol which transforms n copies of |φ AB to a state that is ǫ-close (say, in trace distance) to ⌊n(E − δ)⌋ ebits. This protocol is called entanglement concentration [1], and we can symbolically write the statement of its existence as a resource inequality [2]Here φ is the infinite sequence (φ ⊗n ) ∞ n=1 . The notation used for ebits [q q] := Φ was introduced in [3], along with corresponding notation for qubit channels [q → q], classical bit channels [c → c] and bits of common randomness [c c]. R ξ is defined as (ξ ⊗⌊Rn⌋ ) ∞ n=1 . In general we write an inequality ≥ between (φ n ) ∞ n=1 and (ψ n ) ∞ n=1 if for any ǫ, δ > 0 and sufficiently large n there is a protocol transforming φ n into an ǫ-approximation of ψ ⌊(1−δ)n⌋ . As it turns out, the reverse is also true. The entanglement dilution [4] resource inequality readsDilution additionally consumes a sublinear amount classical communication, but this corresponds to an asymptotic rate of 0, and as such does not enter into the resource count. The two may be combined to give a resource equality(1) (2) with two EPR pairs Φ RA added to both sides of the equality. The second line represents the failure of the decomposition of two GHZ states into three EPR pairs Φ RA , Φ RB , Φ AB . The first line is a dynamic version of the second...