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

Xitong kexue yu shuxue

CHARACTERISTIC POLYNOMIAL PRESENTATION FOR QUBITS

Lijun Liu, Shuming Cheng, Zairong Xi

Published Mar 25, 2016• 0 citations
Publisher
DOI
10.12341/jssms12747

Related papers

COMPUTING THE DEGREE-4 INVARIANT POLYNOMIAL BASIS FOR 7 QUBITS

Alimzhan Amanov

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 university•Oct 1, 2024•0 citations

Computation with Qubits

WORLD SCIENTIFIC eBooks•Jul 15, 2020•0 citations

RESPONSE TO FEENBERG MEDAL PRESENTATION

Tony Leggett

Recent Progress in Many-Body Theories•Sep 1, 2000•0 citations

Computation with Qubits

WORLD SCIENTIFIC eBooks•Oct 28, 2013•0 citations

PRESENTATION OF QUANTUM MECHANICS. I. UNRELATIVISTIC WAVE EQUATIONS

Bernhard Mrowka

•Jun 29, 1951•26 citations

Properties of Qubits

CRC Press eBooks•Jul 21, 2015•0 citations
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.