Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics
暂无分享,去创建一个
[1] C. Wu. Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices , 2005, quant-ph/0508163.
[2] Zhen Wang,et al. The Tripartite Separability of Density Matrices of Graphs , 2007, Electron. J. Comb..
[3] Simone Severini,et al. Some families of density matrices for which separability is easily tested (10 pages) , 2006 .
[4] S. Severini,et al. The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States , 2004, quant-ph/0406165.
[5] M. Horodecki,et al. Separability of mixed states: necessary and sufficient conditions , 1996, quant-ph/9605038.
[6] Leonid Gurvits. Classical deterministic complexity of Edmonds' Problem and quantum entanglement , 2003, STOC '03.
[7] Pérès. Separability Criterion for Density Matrices. , 1996, Physical review letters.
[8] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[9] Chai Wah Wu. On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism , 2010, Discret. Math..
[10] Wah Wu. Multipartite separability of Laplacian matrices of graphs , 2009 .