We provide an in-depth study of tripartite entanglement of qudits. We start with a short review of tripartite entanglement invariants, prove a theorem about the complete list of all allowed values of three (out of the total of four) such invariants, and give several bounds on the allowed values of the fourth invariant. After introducing several operations on entangled states (that allow us to build new states from old states) and deriving general properties pertaining to their invariants, we arrive at the decomposition theorem as one of our main results. The theorem relates the algebraic invariants of any entanglement class with the invariants of its corresponding components in each of its direct sum decompositions. This naturally leads to the definition of reducible and irreducible entanglement classes. We explicitly compute algebraic invariants for several families of irreducible classes and show how the decomposition theorem allows computations of invariants for compounded classes to be carried out efficiently. This theorem also allows us to compute the invariants for the infinite number of entanglement classes constructed from irreducible components. We proceed with the complete list of the entanglement classes for three tribits with decompositions of each class into irreducible components, and provide a visual guide to interrelations of these decompositions. We conclude with numerous examples of building classes for higher-spin qudits.
We provide an in-depth study of tripartite entanglement of qudits. We start with a short review of tripartite entanglement invariants, prove a theorem about the complete list of all allowed values of three (out of the total of four) such invariants, and give several bounds on the allowed values of the fourth invariant. After introducing several operations on entangled states (that allow us to build new states from old states) and deriving general properties pertaining to their invariants, we arrive at the decomposition theorem as one of our main results. The theorem relates the algebraic invariants of any entanglement class with the invariants of its corresponding components in each of its direct sum decompositions. This naturally leads to the definition of reducible and irreducible entanglement classes. We explicitly compute algebraic invariants for several families of irreducible classes and show how the decomposition theorem allows computations of invariants for compounded classes to be carried out efficiently. This theorem also allows us to compute the invariants for the infinite number of entanglement classes constructed from irreducible components. We proceed with the complete list of the entanglement classes for three tribits with decompositions of each class into irreducible components, and provide a visual guide to interrelations of these decompositions. We conclude with numerous examples of building classes for higher-spin qudits.
We provide a classification of entangled states that uses new discrete entanglement invariants. The invariants are defined by algebraic properties of linear maps associated with the states. We prove a theorem on a correspondence between the invariants and sets of equivalent classes of entangled states. The new method works for an arbitrary finite number of finite-dimensional state subspaces. As an application of the method, we considered a large selection of cases of three subspaces of various dimensions. We also obtain an entanglement classification of four qubits, where we find 27 fundamental sets of classes.
Multipartite entanglement is a natural generalization of bipartite entanglement, but is relatively poorly understood. In this paper, we develop tools to calculate a class of multipartite entanglement measures - known as multi-invariants - for stabilizer states. We give an efficient numerical algorithm that computes multi-invariants for stabilizer states. For tripartite stabilizer states, we also obtain an explicit formula for any multi-invariant using the GHZ-extraction theorem. We then present a counting argument that calculates any Coxeter multi-invariant of a q-partite stabilizer state. We conjecture a closed form expression for the same. We uncover hints of an interesting connection between multi-invariants, stabilizer states and topology. We show how our formulas are further simplified for a restricted class of stabilizer states that appear as ground states of interesting models like the toric code and the X-cube model.
Encoding the state of physical systems, the many-body wavefunction lives in a Hilbert space that conveniently offers a tensor factor to each constituent of the system. Consequentially, the wavefunction inherits structural properties such as entanglement, a new type of quantum correlation across the tensor factors. Entanglement can be quantified by forming polynomials in the wavefunction that remain invariant under local operations, which in turn naturally imply the properties we intuit about entanglement. It follows from the Tarski-Seidenberg theorem that these polynomial entanglement measures must obey polynomial constraints. It is among these constraints that the core features separating quantum correlations from classical correlations are illuminated, such as their monogamous nature. The smallest non-trivial system which exhibits entanglement monogamy tradeoffs governed by polynomial constraints is three qubits, for which we find novel constraints that are stronger than the previously known constraints, and which may as well be a complete description of three-qubit entanglement since the number of degrees of freedom matches the number of entanglement measures. A remarkable redundancy known in three qubits is that any party's total entanglement decomposes exactly into bipartite and tripartite type entanglement; we find that this behavior is merely part of the GHZ family tradition, and that any party within the n-qubit GHZ SLOCC equivalence class also has total entanglement which decomposes exactly into all k-partite type entanglements, thus providing insight into strong versions of monogamy relations. Refocusing back to tripartite systems, we then suppose arbitrarily many degrees of freedom into our subsystems, which appear to refuse all temptations of polygamy. Up to this point we have only been considering idealized isolated systems as it is known that monogamy relations aren't sensitive to the total purity, however we then find entanglement constraints which are violated by globally mixed states, ultimately suggesting that environments can enable entanglement to grow beyond what is otherwise allowed. Finally, we address the dynamical behavior of entanglement under several key interactions, and characterize the couplings according to their ability to generate entanglement.
We introduce a real-valued functional I(n1,n2) of four three-qubit correlations that turns the Greenberger-Horne-Zeilinger (GHZ) algebraic paradox into a quantitative witness of genuine tripartite entanglement. For every three-qubit state ρ and every pair of directions, ∣I(n1,n2;ρ)∣≤2, with equality if and only if n1⊥n2 and ρ is locally unitarily equivalent to the GHZ state. On the five-parameter Acín family, I(x^,y^) depends only on λ0λ4 and is maximised by the GHZ state; for the W state I(x^,y^)=0 and max∣IW∣=35/27. Maximising over independent local orthonormal frames yields a local-unitary invariant measure EGHZ∈[0,1], computable from four three-body Pauli correlators, that equals one exactly on the GHZ orbit and takes the values 35/54 on the W state and 1/2 on product states. We show that EGHZ is not convex: an equal mixture of three biseparable states has EGHZ=14/27, larger than the average 1/2 of its components. We also relate EGHZ to GHZ fidelity witnesses, discuss its behaviour under local operations and classical communication, and outline a generalisation to three qudits via Heisenberg-Weyl operators.
In this dissertation, we investigate algebraic structures in finite-dimensional Hilbert spaces, as concerns quantum computation and quantum information, as well as these structures' applications to lattices. On the quantum computation side, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies these axioms. Subsequently, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, using the algebraic framework developed. We build our graphical calculus out of a fixed set of graphical primitives defined by algebraic expressions constructed out of elements of a given generalized Clifford algebra, a graphical primitive corresponding to the ground state, and also graphical primitives corresponding to projections onto the ground state of each qudit. We establish many algebraic identities, including a novel algebraic proof of a Yang-Baxter equation. We also derive a new identity for the braid elements, which is key to our proofs. We then use the Yang-Baxter equation proof to resolve an open question of Cobanera and Ortiz. We demonstrate that in many cases, the verification of involved vector identities can be reduced to the combinatorial application of two basic vector identities. In addition, we show how to explicitly compute various vector states in an efficient manner using algebraic methods. On the quantum information side, we introduce a new decomposition of quantum channels acting on group algebras, which we term Kraus-like operator decompositions (Kraus-like decompositions for short). An important motivation for this new decomposition is a general nonexistence result that we show for Kraus operator decompositions for quantum channels in this setting. We show that the notion of convex Kraus-like operator decompositions (in which the coefficients in the sum decomposition are nonnegative and satisfy a sum rule) that are induced by the irreducible characters of a finite group is equivalent to the notion of a conditionally negative-definite length when the length is a class function. For a general finite group G, we prove a stability condition which shows that if the semigroup associated with a length has a convex Kraus-like operator decomposition for all t>0 small enough, then it has a convex Kraus-like operator decomposition for all time t>0. Using the stability condition, we show that for a general finite group, conditional negativity of the length function is equivalent to a set of semidefinite linear constraints on the length function. By a result of Schoenberg, our result implies that in the group algebra setting, a semigroup P_t induced by a length function which is a class function is a quantum channel for all t greater than or equal to 0 if and only if it possesses a convex Kraus-like operator decomposition for all t>0. Finally, motivated by the importance of lattice problems in quantum cryptography, we extend the algebraic framework for multi-qudit representations of generalized Clifford algebras to d-dimensional lattices mod P. We show that under suitable number-theoretic conditions, the subalgebra induced by a lattice has trivial center. Under the trivial center constraint, we construct for pairs of lattice vectors satisfying an algebraic constraint a unitary operator based on the product of generalized Clifford algebra generators associated to each lattice vector.