Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Wu (2005)
Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matricesPhysics Letters A, 351
A. Miyake (2002)
Classification of multipartite entangled states by multidimensional determinantsPhysical Review A, 67
Ozols, L. Mančinska (2007)
Generalized Bloch Vector and the Eigenvalues of a Density Matrix Māris
G. Walter, M. Contreras (1999)
Graphs and Matrices
Supriyo Dutta, Bibhas Adhikari, Subhashis Banerjee (2015)
A graph theoretical approach to states and unitary operationsQuantum Information Processing, 15
Nathan Reff (2011)
Spectral properties of complex unit gain graphsLinear Algebra and its Applications, 436
Z. Man, Y. Xia, N. An (2007)
Genuine multiqubit entanglement and controlled teleportationPhysical Review A, 75
D. Cvetkovic, P. Rowlinson, S. Simic (2007)
Signless Laplacians of finite graphsLinear Algebra and its Applications, 423
(1994)
A discrete analogue of periodic magnetic Schrödinger operators, Geometry of the spectrum, Contemp
H. Briegel, R. Raussendorf (2000)
Persistent entanglement in arrays of interacting particles.Physical review letters, 86 5
(2018)
Einstein-Podolsky-Rosen Paradox
Supriyo Dutta, Bibhas Adhikari, Subhashis Banerjee, R. Srikanth (2016)
Bipartite separability and nonlocal quantum operations on graphsPhysical Review A, 94
A. Einstein, B. Podolsky, N. Rosen (1935)
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?Physical Review, 47
R. Bapat, D. Kalita, S. Pati (2012)
On weighted directed graphsLinear Algebra and its Applications, 436
DM Greenberger, MA Horne, A Shimony, A Zeilinger (1990)
Bell’s theorem without inequalitiesA. J. Phys., 58
Y. Yeo, Wee Chua (2005)
Teleportation and dense coding with genuine multipartite entanglement.Physical review letters, 96 6
S. Braunstein, Sibasish Ghosh, S. Severini (2004)
The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed StatesAnnals of Combinatorics, 10
JS Bell (1964)
On the Einstein–Podolsky–Rosen paradoxPhysics (Long Island City, N. Y.), 1
C. Wu (2008)
Multipartite Separability of Laplacian Matrices of GraphsElectron. J. Comb., 16
Ali Hassan, P. Joag (2006)
A combinatorial approach to multipartite quantum systems: basic formulationJournal of Physics A: Mathematical and Theoretical, 40
W. Dür, G. Vidal, J. Cirac (2000)
Three qubits can be entangled in two inequivalent waysPhysical Review A, 62
W. Wootters (1997)
Entanglement of Formation of an Arbitrary State of Two QubitsPhysical Review Letters, 80
Iain Brown, S. Stepney, A. Sudbery, S. Braunstein (2005)
Searching for highly entangled multi-qubit statesJournal of Physics A, 38
D. Greenberger, M. Horne, A. Shimony, A. Zeilinger (1990)
Bell’s theorem without inequalitiesAmerican Journal of Physics, 58
Representing graphs as quantum states is becoming an increasingly important approach to study entanglement of mixed states, alternate to the standard linear algebraic density matrix-based approach of study. In this paper, we propose a general weighted directed graph framework for investigating properties of a large class of quantum states which are defined by three types of Laplacian matrices associated with such graphs. We generalize the standard framework of defining density matrices from simple connected graphs to density matrices using both combinatorial and signless Laplacian matrices associated with weighted directed graphs with complex edge weights and with/without self-loops. We also introduce a new notion of Laplacian matrix, which we call signed Laplacian matrix associated with such graphs. We produce necessary and/or sufficient conditions for such graphs to correspond to pure and mixed quantum states. Using these criteria, we finally determine the graphs whose corresponding density matrices represent entangled pure states which are well known and important for quantum computation applications. We observe that all these entangled pure states share a common combinatorial structure.
Quantum Information Processing – Springer Journals
Published: Feb 6, 2017
Access the full text.
Sign up today, get DeepDyve free for 14 days.