Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States

We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.Comment: 10 pages, 1 figure;v2. discussions improve

Multipartite Entanglement Measures and Quantum Criticality from Matrix and Tensor Product States

We compute the multipartite entanglement measures such as the global entanglement of various one- and two-dimensional quantum systems to probe the quantum criticality based on the matrix and tensor product states (MPSs/TPSs). We use infinite time-evolving block decimation (iTEBD) method to find the ground states numerically in the form of MPSs/TPSs, and then evaluate their entanglement measures by the method of tensor renormalization group (TRG). We find these entanglement measures can characterize the quantum phase transitions by their derivative discontinuity right at the critical points in all models considered here. We also comment on the scaling behaviors of the entanglement measures by the ideas of quantum state renormalization group transformations.Comment: 22 pages, 11 figure