Herald of Kazakh-British technical university

INVARIANT POLYNOMIALS WITH APPLICATIONS TO QUANTUM COMPUTING

Alimzhan Amanov

Published Jul 1, 2024• 1 citation

Abstract

In quantum information theory, understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving d qubits (or qudits) is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. The resulting classes can be distinguished using invariant polynomials, which serve as a measure of entanglement. This paper introduces a novel method for obtaining invariant polynomials of the smallest degrees, which significantly enhances the efficiency of characterizing SLOCC classes of entangled quantum states. Our method not only simplifies the process of identifying these classes but also provides a robust tool for analyzing the entanglement properties of complex quantum systems. As a practical application, we demonstrate the derivation of minimal degree invariants in specific cases, illustrating the effectiveness of our approach in real-world scenarios. This advancement has the potential to streamline various processes in quantum information theory, making it easier to understand, classify, and utilize entangled states effectively.

DOI: 10.55452/1998-6688-2024-21-2-95-105

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 universityOct 1, 20240 citations

Entanglement of four-qubit systems: A geometric atlas with polynomial compass II (the tame world)

Frédéric Holweck, Jean-Gabriel Luque, Jean‐Yves Thibon

We propose a new approach to the geometry of the four-qubit entanglement classes depending on parameters. More precisely, we use invariant theory and algebraic geometry to describe various stratifications of the Hilbert space by Stochastic Local Operations with Classical Communication (SLOCC) invariant algebraic varieties. The normal forms of the four-qubit classification of Verstraete et al. are interpreted as dense subsets of components of the dual variety of the set of separable states and an algorithm based on the invariants/covariants of the four-qubit quantum states is proposed to identify a state with a SLOCC equivalent normal form (up to qubits permutation).

arXiv:1606.05569Journal of Mathematical PhysicsFeb 1, 201719 citations

Multipartite Entanglement

Gilad Gour

Chapter 14 transitions the focus to multipartite entanglement, a realm that broadens the discussion from bipartite systems to those involving multiple parties. This complex form of entanglement plays a crucial role in quantum computing, cryptography, and communication networks. The chapter introduces the foundational concepts of multipartite entanglement, including its characterization and the challenges associated with its classification. Significant attention is given to the classification of multipartite entangled states through SL-invariant polynomials, which provide tools for understanding the structure and properties of these states. Stochastic Local Operations and Classical Communication (SLOCC) are introduced as a means to classify entanglement. Furthermore, the chapter explores the entanglement of assistance and the monogamy of entanglement, two concepts that illustrate the limitations and potential for distributing entanglement among multiple parties. Through detailed explanations and examples in three and four qubits, this chapter offers insights into the intricate world of multipartite entanglement, revealing both its potential and challenges.

Cambridge University Press eBooksApr 10, 202523 citations

Variational quantum entanglement classification discrimination

Shaoxuan Wang, Yingtong Shen, Xinjian Liu +2 more

With the rapid development of quantum technology, understanding the properties of entanglement states has become an urgent task.Various classifications of entanglement states have been proposed to cater to distinct quantum applications, highlighting the significance of entanglement classification. This paper presents a variational quantum classifier for entanglement classification discrimination which can effectively reduce the measurement resources, specifically for four-qubit entanglement equivalence classifications under SLOCC (Stochastic Local Operations and Classical Communication). Through training one-to-one and one-to-many models, our proposed method achieves excellent performance in the entanglement classification. We further investigate the impact of parameterized quantum circuit layers and various measurement settings on the classifier’s performance. Considering the inherent noise present in near-term quantum computers, we also analyze how noise affects the model’s performance. Moreover, we explore the classifier’s capabilities in the context of multi-qubit entanglement systems. Numerical simulations demonstrate that high-precision entanglement classification tasks can be accomplished with shallow circuit depths, and the model exhibits resilience to noise. Additionally, the results reveal the versatility and potential application of our proposed model in larger-scale quantum systems by effectively handling entanglement classification tasks involving an increased number of qubits.

Physica A Statistical Mechanics and its ApplicationsJan 18, 20242 citations

Entanglement of Three-Qubit Random Pure States

Marco Enríquez, Francisco Delgado, Karol Życzkowski

We study entanglement properties of generic three-qubit pure states. First, we obtain the distributions of both the coefficients and the only phase in the five-term decomposition of Acín et al. for an ensemble of random pure states generated by the Haar measure on U ( 8 ) . Furthermore, we analyze the probability distributions of two sets of polynomial invariants. One of these sets allows us to classify three-qubit pure states into four classes. Entanglement in each class is characterized using the minimal Rényi-Ingarden-Urbanik entropy. Besides, the fidelity of a three-qubit random state with the closest state in each entanglement class is investigated. We also present a characterization of these classes in terms of the corresponding entanglement polytope. The entanglement classes related to stochastic local operations and classical communication (SLOCC) are analyzed as well from this geometric perspective. The numerical findings suggest some conjectures relating some of those invariants with entanglement properties to be ground in future analytical work.

arXiv:1809.00642EntropySep 29, 201835 citations

Stochastic local operations and classical communication invariants via square matrix

Xin-Wei Zha, Irfan Ahmed, Da Zhang +2 more

Abstract In this paper, we raise a few corrections from the Li et al paper (2015 Phys. Rev . A 91 012302). We obtain some stochastic local operations and classical communication (SLOCC) invariants from second degree to sixth degree by defining square matrices. The relation of SLOCC invariants and the character polynomial of the square matrix are defined for three and four qubit states. This method comes as a useful resource in determining SLOCC invariants for n-qubit states.

Laser PhysicsJan 4, 20193 citations