In this paper the density matrices derived from combinatorial Laplacian matrix of graphs is considered. More specifically, the paper places emphasis on the star-relevant graph, which means adding certain edges on peripheral vertices of star graph. Initially, we provide the spectrum of the density matrices corresponding to star-like graph (i.e., adding an edge on star graph) and present that the Von Neumann entropy increases under the graph operation (adding an edge on star graph) and the graph operation cannot be simulated by local operation and classical communication (LOCC). Subsequently, we illustrate the spectrum of density matrices corresponding to star-alike graph (i.e., adding one edge on star-like graph) and exhibit that the Von Neumann entropy increases under the graph operation (adding an edge on star-like graph) and the graph operation cannot be simulated by LOCC. Finally, the spectrum of density matrices corresponding to star-mlike graph (i.e., adding m nonadjacent edges on the peripheral vertices of star graph) is demonstrated and the relation between the graph operation and Von Neumann entropy, LOCC is revealed in this paper.
Quantum state representation Combinatorial Laplacian matrix Star-relevant graph Von Neumann entropy
This is a preview of subscription content, log in to check access
This project was supported by NSFC (Grant Nos. 61272514, 61170272, 61121061, 61411146001,61202082), NCET (Grant No. NCET-13-0681), the National Development Foundation for Cryptological Research (Grant No. MMJJ201401012) and the Fok Ying Tung Education Foundation (Grant No. 131067).
Von Neumann, J.: Mathematical Foundations of Quantum Mechanics, vol. 2, p. 5. Princeton University Press, Princeton (1955)Google Scholar
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, . pp. 101573–101578. Cambridge University Press, Cambridge (2010)Google Scholar
Balachandran, A.P., et al.: Algebraic approach to entanglement and entropy. Phys. Rev. A 88(2), 022301 (2013)CrossRefADSGoogle Scholar
Adhikari, B., Adhikari, S., Banerjee, S.: Graph representation of quantum states. arXiv preprint arXiv:1205.2747 (2012)
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)MathSciNetCrossRefMATHGoogle Scholar
Kocay, W., Kreher, D.L.: Graphs, Algorithms, and Optimization. CRC Press, Boca Raton (2004)MATHGoogle Scholar
Hein, M., et al.: Entanglement in graph states and its applications. arXiv preprint quant-ph/0602096 (2006)
Braunstein, S.L., Ghosh, S., Severini, S.: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states. Ann. Comb. 10(3), 291–317 (2006)MathSciNetCrossRefMATHGoogle Scholar
Hildebrand, R., Mancini, S., Severini, S.: Combinatorial laplacians and positivity under partial transpose. Math. Struct. Comput. Sci. 18(01), 205–219 (2008)MathSciNetCrossRefMATHGoogle Scholar