COMPUTING THE DEGREE-4 INVARIANT POLYNOMIAL BASIS FOR 7 QUBITS

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.

Authors

Institutions

Publication Details

Journal
Herald of Kazakh-British technical university
Published
2024-10-01
DOI
https://doi.org/10.55452/1998-6688-2024-21-3-128-136
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

COMPUTING THE DEGREE-4 INVARIANT POLYNOMIAL BASIS FOR 7 QUBITS

Alimzhan Amanov
Herald of Kazakh-British technical university
Quantum Computing Algorithms and Architecture
article

COMPUTING THE DEGREE-4 INVARIANT POLYNOMIAL BASIS FOR 7 QUBITS

Alimzhan Amanov
article en

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.

Herald of Kazakh-British technical universityVol. 21(3)
Kazakh-British Technical University (KZ)
Openalex Percentile: Top 85%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.