Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0909.1039 · Journal of Physics A Mathematical and Theoretical

Tensor 2-sums and entanglement

Sandi Klavžar, Simone Severini B

Published May 4, 2010• 3 citations
arXivHTMLPDF

Abstract

To define a minimal mathematical framework for isolating some of the characteristic properties of quantum entanglement, we introduce a generalization of the tensor product of graphs. Inspired by the notion of a density matrix, the generalization is a simple one: every graph can be obtained by addition modulo two, possibly with many summands, of tensor products of adjacency matrices. In light of this, we are still able to prove a combinatorial analogue of the Peres–Horodecki criterion for testing separability.

DOI
10.1088/1751-8113/43/21/212001

Related papers

A combinatorial approach to multipartite quantum systems: basic formulation

Ali Saif M. Hassan, Pramod S. Joag

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study related issues such as classification of pure and mixed states, Von Neumann entropy, separability of multipartite quantum states and quantum operations in terms of the graphs associated with quantum states. In order to address the separability and entanglement questions using graphs, we introduce a modified tensor product of weighted graphs, and establish its algebraic properties. In particular, we show that Werner's definition (Werner 1989 Phys. Rev. A 40 4277) of a separable state can be written in terms of graphs, for the states in a real or complex Hilbert space. We generalize the separability criterion (degree criterion) due to Braunstein et al (2006 Phys. Rev. A 73 012320) to a class of weighted graphs with real weights. We have given some criteria for the Laplacian associated with a weighted graph to be positive semidefinite.

arXiv:quant-ph/0602053•Journal of Physics A Mathematical and Theoretical•Aug 1, 2007•13 citations

Extended tensor products and generalization of the notion of entanglement

Andrei Yu. Khrennikov, Elemér Elad Rosinger

Motivated by the novel applications of the mathematical formalism of quantum theory and its generalizations in cognitive science, psychology, social and political sciences, and economics, we extend the notion of the tensor product and entanglement. We also study the relation between conventional entanglement of complex qubits and our generalized entanglement. Our construction can also be used to describe entanglement in the framework of non-Archimedean physics. It is also possible to construct tensor products of non-Archimedean (e.g., p-adic) and complex Hilbert spaces.

arXiv:1203.0412•AIP conference proceedings•Jan 1, 2012•0 citations

Universal entanglement-inspired correlations

Elizabeth Agudelo, Laura Ares, Jan Sperling

Quantum correlations, crucial for the advantage and advancement of quantum science and technology, arise from the impossibility of expressing a quantum state as a tensor product over a given set of parties. In this work, a generalized notion of correlations via arbitrary products is formulated. Remarkably, as a universal property, the connection between such general products and tensor products is established, allowing one to relate generic non-product states to the common notion of entangled states. We construct the set of free operations for general types of products by extending the local-operation-and-classical-communication paradigm, familiar from standard entanglement theory, thereby establishing a resource theory of correlations for general products. A generalization is provided beyond two factors that can be universally related to multipartite entanglement. Applications that highlight the usefulness of the approach are discussed, such as the factorization of fermionic states, the non-local factorization of multi-photon states into single-photon states, and the interesting possibility of understanding prime numbers as a form of single-party entanglement.

quant-pharXiv:2602.15520•Feb 18, 2026•0 citations

The Tripartite Separability of Density Matrices of Graphs

Zhen Wang, Zhi‐Xi Wang

The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein et al. [Annals of Combinatorics, 10 (2006) 291] to tripartite states. Then we prove that the degree condition defined in Braunstein et al. [Phys. Rev. A, 73 (2006) 012320] is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.

arXiv:0705.2561•The Electronic Journal of Combinatorics•May 23, 2007•7 citations

A novel entanglement criterion of two-qubit system

Chao Zhao, Qizhi Guo, Weihan Tan

The “separability problem” in quantum information theory is a quite important and well-known hard problem. The low-dimensional system satisfies the PPT criterion. However, the high-dimensional system problem has been shown to be NP-hard problem. In general, it is very difficult to find the analytic solution of the density matrix for the high-dimensional system. Therefore, getting an analytic solution for two-qubit system is an interesting and useful problem. We propose a novel criterion for separability and entanglement-verification of two-qubit system. We expressed the density matrix by a sum of a principal density matrix and six separable density matrices. The necessary and sufficient conditions for the two-qubit system include that if the four involved coefficients [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and the principal density matrix [Formula: see text] are separable, then the two-qubit system is separable, otherwise the two-qubit system is entangled. Finally, our criterion results in a totally different conclusion compared to Horodecki’s criterion. We believe that the new criterion is more stringent than existing PPT methods.

International Journal of Modern Physics B•Feb 17, 2020•1 citation

Entanglement beyond tensor product structure: algebraic aspects of quantum non-separability

Łukasz Derkacz, Marek Gwóźdź, Lech Jakóbczyk

An algebraic approach to quantum non-separability is applied to the case of two qubits. It is based on the partition of the algebra of observables into independent subalgebras and the tensor product structure of the Hilbert space is not exploited. Even in this simple case, such a general formulation has some advantages. Using algebraic formalism, we can explicitly show the relativity of the notion of entanglement to the observables measured in the system and characterize separable and non-separable pure states. As a universal measure of non-separability of pure states, we propose to take the so-called total correlation. This quantity depends on the state as well as on the algebraic partition. Its numerical value is given by the norm of the corresponding correlation matrix.

arXiv:1109.0818•Journal of Physics A Mathematical and Theoretical•Dec 8, 2011•13 citations
To define a minimal mathematical framework for isolating some of the characteristic properties of quantum entanglement, we introduce a generalization of the tensor product of graphs. Inspired by the notion of a density matrix, the generalization is a simple one: every graph can be obtained by addition modulo two, possibly with many summands, of tensor products of adjacency matrices. In light of this, we are still able to prove a combinatorial analogue of the Peres–Horodecki criterion for testing separability.
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study related issues such as classification of pure and mixed states, Von Neumann entropy, separability of multipartite quantum states and quantum operations in terms of the graphs associated with quantum states. In order to address the separability and entanglement questions using graphs, we introduce a modified tensor product of weighted graphs, and establish its algebraic properties. In particular, we show that Werner's definition (Werner 1989 Phys. Rev. A 40 4277) of a separable state can be written in terms of graphs, for the states in a real or complex Hilbert space. We generalize the separability criterion (degree criterion) due to Braunstein et al (2006 Phys. Rev. A 73 012320) to a class of weighted graphs with real weights. We have given some criteria for the Laplacian associated with a weighted graph to be positive semidefinite.
Motivated by the novel applications of the mathematical formalism of quantum theory and its generalizations in cognitive science, psychology, social and political sciences, and economics, we extend the notion of the tensor product and entanglement. We also study the relation between conventional entanglement of complex qubits and our generalized entanglement. Our construction can also be used to describe entanglement in the framework of non-Archimedean physics. It is also possible to construct tensor products of non-Archimedean (e.g., p-adic) and complex Hilbert spaces.
Quantum correlations, crucial for the advantage and advancement of quantum science and technology, arise from the impossibility of expressing a quantum state as a tensor product over a given set of parties. In this work, a generalized notion of correlations via arbitrary products is formulated. Remarkably, as a universal property, the connection between such general products and tensor products is established, allowing one to relate generic non-product states to the common notion of entangled states. We construct the set of free operations for general types of products by extending the local-operation-and-classical-communication paradigm, familiar from standard entanglement theory, thereby establishing a resource theory of correlations for general products. A generalization is provided beyond two factors that can be universally related to multipartite entanglement. Applications that highlight the usefulness of the approach are discussed, such as the factorization of fermionic states, the non-local factorization of multi-photon states into single-photon states, and the interesting possibility of understanding prime numbers as a form of single-party entanglement.
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein et al. [Annals of Combinatorics, 10 (2006) 291] to tripartite states. Then we prove that the degree condition defined in Braunstein et al. [Phys. Rev. A, 73 (2006) 012320] is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.
The “separability problem” in quantum information theory is a quite important and well-known hard problem. The low-dimensional system satisfies the PPT criterion. However, the high-dimensional system problem has been shown to be NP-hard problem. In general, it is very difficult to find the analytic solution of the density matrix for the high-dimensional system. Therefore, getting an analytic solution for two-qubit system is an interesting and useful problem. We propose a novel criterion for separability and entanglement-verification of two-qubit system. We expressed the density matrix by a sum of a principal density matrix and six separable density matrices. The necessary and sufficient conditions for the two-qubit system include that if the four involved coefficients [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and the principal density matrix [Formula: see text] are separable, then the two-qubit system is separable, otherwise the two-qubit system is entangled. Finally, our criterion results in a totally different conclusion compared to Horodecki’s criterion. We believe that the new criterion is more stringent than existing PPT methods.
An algebraic approach to quantum non-separability is applied to the case of two qubits. It is based on the partition of the algebra of observables into independent subalgebras and the tensor product structure of the Hilbert space is not exploited. Even in this simple case, such a general formulation has some advantages. Using algebraic formalism, we can explicitly show the relativity of the notion of entanglement to the observables measured in the system and characterize separable and non-separable pure states. As a universal measure of non-separability of pure states, we propose to take the so-called total correlation. This quantity depends on the state as well as on the algebraic partition. Its numerical value is given by the norm of the corresponding correlation matrix.