SearcharxivSearch

arXiv subjects

Masoud Gharahi

Publications and source records attributed to Masoud Gharahi.

9 recordsLinked to original sources

On the Kronecker Products of Symmetric Persistent Tensors

Persistent tensors form a recursively defined class adapted to the substitution method and provide nontrivial lower bounds on tensor rank. We study the behavior of symmetric persistent tensors under Kronecker products. We establish a global differentiation identity expressing the Hessian matrix of a Kronecker product of homogeneous polynomials in terms of the Hessian matrices of its factors; although no corresponding determinant identity holds globally, the Hessian polynomials factor exactly at decomposable points. This yields a multiplicative formula for the distinguished Hessian coefficients of isobaric forms and closure under Kronecker products for symmetric persistent tensors that are isobaric of the distinguished weight, including iterated products and powers. Combined with the classification in small dimensions, this implies closure when both factors have dimension at most three, and for persistent cubics when both have dimension at most four. We further give sufficient closure criteria via simultaneous strict triangularizability of normalized Hessian spaces, for cubics and then arbitrary degree, and show that the distinguished isobaric class satisfies this condition. Finally, we show that symmetric persistence is not preserved in general by constructing a persistent cubic $f\in\operatorname{Sym}^3\mathbb{C}^{12}$ such that $f\boxtimes f\in\operatorname{Sym}^3\mathbb{C}^{144}$ is not persistent. The obstruction occurs at a nondecomposable point, showing that the Hessian factorization on the Segre variety does not extend to the full tensor product space.

math.AG

$\ell$-Multiranks of Multipartite Quantum States via Tensor Flattening: A Mathematica Codebase

We present a Mathematica codebase for computing $\ell$-multilinear ranks ($\ell$-multiranks) of multiqudit quantum states using tensor-flattening techniques. By calculating the ranks of all bipartition-induced matricizations, the method provides an efficient criterion for detecting Genuine Multipartite Entangled (GME) states in systems with local dimension $d$. The code automatically generates all required tensor reshapes and outputs the full $\ell$-multirank profile, offering a practical tool for characterizing entanglement in high-dimensional multiqudit systems.

quant-ph

Pseudo quantum advantages in perceptron storage capacity

We investigate a generalized quantum perceptron architecture characterized by an oscillating activation function with a tunable frequency ranging from zero to infinity. Employing analytical techniques from statistical mechanics, we derive the optimal storage capacity and demonstrate that the classical result is recovered in the limit of vanishing frequency. As the frequency increases, however, the architecture exhibits enhanced quantum storage capabilities. Notably, this improvement stems solely from the specific form of the activation function and, in principle, could be emulated within a classical framework. Accordingly, we refer to this enhancement as a pseudo quantum advantage.

quant-ph

Symmetric Persistent Tensors and their Hessian

Persistent tensors, introduced in [Quantum 8 (2024), 1238], and inspired by quantum information theory, form a recursively defined class of tensors that remain stable under the substitution method and thereby yield nontrivial lower bounds on tensor rank. In this work, we investigate the symmetric case-namely, symmetric persistent tensors, or equivalently, persistent polynomials. We establish that a symmetric tensor in $\mathrm{Sym}^n \mathbb{C}^d$ is persistent if the determinant of its Hessian equals the $d(n-2)$-th power of a nonzero linear form. The converse is verified for cubic tensors ($n=3$) or for $d \leq 3$, by leveraging classical results of B. Segre. Moreover, we demonstrate that the Hessian of a symmetric persistent tensor factors as the $d$-th power of a form of degree $(n-2)$. Our main results provide an explicit necessary and sufficient criterion for persistence, thereby offering an effective algebraic characterization of this class of tensors. Beyond characterization, we present normal forms in small dimensions, place persistent polynomials within prehomogeneous geometry, and connect them with semi-invariants, homaloidal polynomials, and Legendre transforms. Particularly, we prove that all persistent cubics are homaloidal.

math.AG

Entangled Subspaces through Algebraic Geometry

We propose an algebraic geometry-inspired approach for constructing entangled subspaces within the Hilbert space of a multipartite quantum system. Specifically, our method employs a modified Veronese embedding, restricted to the conic, to define subspaces within the symmetric part of the Hilbert space. By utilizing this technique, we construct the minimal-dimensional, non-orthogonal yet Unextendible Product Basis (nUPB), enabling the decomposition of the multipartite Hilbert space into a two-dimensional subspace, complemented by a Genuinely Entangled Subspace (GES) and a maximal-dimensional Completely Entangled Subspace (CES). In multiqudit systems, we determine the maximum achievable dimension of a symmetric GES and demonstrate its realization through this construction. Furthermore, we systematically investigate the transition from the conventional Veronese embedding to the modified one by imposing various constraints on the affine coordinates, which, in turn, increases the CES dimension while reducing that of the GES.

quant-ph

Classifying Entanglement by Algebraic Geometry

Quantum Entanglement is one of the key manifestations of quantum mechanics that separate the quantum realm from the classical one. Characterization of entanglement as a physical resource for quantum technology became of uppermost importance. While the entanglement of bipartite systems is already well understood, the ultimate goal to cope with the properties of entanglement of multipartite systems is still far from being realized. This dissertation covers characterization of multipartite entanglement using algebraic-geometric tools. Firstly, we establish an algorithm to classify multipartite entanglement by $k$-secant varieties of the Segre variety and $\ell$-multilinear ranks that are invariant under Stochastic Local Operations with Classical Communication (SLOCC). We present a fine-structure classification of multiqubit and tripartite entanglement based on this algorithm. Another fundamental problem in quantum information theory is entanglement transformation that is quite challenging regarding to multipartite systems. It is captivating that the proposed entanglement classification by algebraic geometry can be considered as a reference to study SLOCC and asymptotic SLOCC interconversions among different resources based on tensor rank and border rank, respectively. In this regard, we also introduce a new class of tensors that we call \emph{persistent tensors} and construct a lower bound for their tensor rank. We further cover SLOCC convertibility of multipartite systems considering several families of persistent tensors.

quant-ph

Persistent Tensors and Multiqudit Entanglement Transformation

We construct a lower bound of the tensor rank for a new class of tensors, which we call persistent tensors. We present three specific families of persistent tensors, of which the lower bound is tight. We show that there is a chain of degenerations between these three families of minimal-rank persistent tensors that can be used to study the entanglement transformation between them. In addition, we show that these three families of persistent tensors are indeed different generalizations of multiqubit $\rm{W}$ states within multiqudit systems and are geometrically in the orbit closure of multiqudit $\rm{GHZ}$ states. Consequently, we show that one can obtain every one of the generalizations of $\rm{W}$ state from a multiqudit $\rm{GHZ}$ state via asymptotic Stochastic Local Operations and Classical Communication (SLOCC) with rate one. Finally, we extend the obtained lower bound of the tensor rank to direct sums with persistent summands and to even more general combinations of tensors, which we call block pyramidal tensors. As a result, we show that the tensor rank is multiplicative under the Kronecker and tensor products of minimal-rank persistent tensors with the $\rm{GHZ}$ tensor.

quant-ph

An Algebraic-Geometric Characterization of Tripartite Entanglement

To characterize entanglement of tripartite $\mathbb{C}^d\otimes\mathbb{C}^d\otimes\mathbb{C}^d$ systems, we employ algebraic-geometric tools that are invariants under Stochastic Local Operation and Classical Communication (SLOCC), namely $k$-secant varieties and one-multilinear ranks. Indeed, by means of them, we present a classification of tripartite pure states in terms of a finite number of families and subfamilies. At the core of it stands out a fine-structure grouping of three-qutrit entanglement.

quant-ph

Fine-Structure Classification of Multiqubit Entanglement by Algebraic Geometry

We present a fine-structure entanglement classification under stochastic local operation and classical communication (SLOCC) for multiqubit pure states. To this end, we employ specific algebraic-geometry tools that are SLOCC invariants, secant varieties, to show that for $n$-qubit systems there are $\lceil\frac{2^{n}}{n+1}\rceil$ entanglement families. By using another invariant, $\ell$-multilinear ranks, each family can be further split into a finite number of subfamilies. Not only does this method facilitate the classification of multipartite entanglement, but it also turns out to be operationally meaningful as it quantifies entanglement as a resource.

quant-ph