COMPUTING THE DEGREE-4 INVARIANT POLYNOMIAL BASIS FOR 7 QUBITS

2024

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.55452/1998-6688-2024-21-3-128-136
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving several number qubits is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. Practically, tthe resulting classes can be distinguished using invariant polynomials, but the size of these polynomials grows rapidly. Hence, it is crucial to obtain the smallest possible invariants. In this short note, we compute the basis of invariant polynomials of 7 qubits of degree 4, which are the smallest degree invariants. We obtain these polynomials using the representation theory and algebraic combinatorics.