We introduce block maps for subfactors and study their dynamic systems. We prove that the limit points of the dynamic system are positive multiples of biprojections and zero. For the \mathbb{Z}_2 case, the asymptotic phenomenon of the block map coincides with that of the 2D Ising model.The study of block maps requires a further development of our recent work on the Fourier analysis of subfactors.We generalize the notion of sum set estimates in additive combinatorics for subfactors and prove the exact inverse sum set theorem. Using this new method, we characterize the extremal pairs of Young's inequality for subfactors, as well as the extremal operators of the Hausdorff-Young inequality.

We introduce a pictorial approach to quantum information, called holographic software. Our software captures both algebraic and topological aspects of quantum networks. It yields a bi-directional dictionary to translate between a topological approach and an algebraic approach. Using our software, we give a topological simulation for quantum networks. The string Fourier transform (SFT) is our basic tool to transform product states into states with maximal entanglement entropy. We obtain a pictorial interpretation of Fourier transformation, of measurements, and of local transformations, including the n-qudit Pauli matrices and their representation by Jordan-Wigner transformations. We use our software to discover interesting new protocols for multipartite communication. In summary, we build a bridge linking the theory of planar para algebras with quantum information.

In this paper, we generalize Young's inequality for locally compact quantum groups and obtain some results for extremal pairs of Young's inequality and extremal functions of Hausdorff-Young inequality.