A short review of algebraic geometry tools for the decomposition of tensors and polynomials is given from the point of view of applications to quantum and atomic physics.Examples of application to assemblies of indistinguishable twolevel bosonic atoms are discussed using modern formulations of the classical Sylvester algorithm for the decomposition of homogeneous polynomials in two variables.In particular, the symmetric rank and symmetric border rank of spin squeezed states are calculated as well as their Schrödinger-cat-like decomposition as the sum of macroscopically different coherent spin states; Fock states provide an example of states for which the symmetric rank and the symmetric border rank are different.
A short review of algebraic geometry tools for the decomposition of tensors and polynomials is given from the point of view of applications to quantum and atomic physics.Examples of application to assemblies of indistinguishable twolevel bosonic atoms are discussed using modern formulations of the classical Sylvester algorithm for the decomposition of homogeneous polynomials in two variables.In particular, the symmetric rank and symmetric border rank of spin squeezed states are calculated as well as their Schrödinger-cat-like decomposition as the sum of macroscopically different coherent spin states; Fock states provide an example of states for which the symmetric rank and the symmetric border rank are different.
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 paper covers characterization of multipartite entanglement using algebraic-geometric tools. First, we establish an algorithm to classify multipartite entanglement by [Formula: see text]-secant varieties of the Segre variety and [Formula: see text]-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 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.
The rank of a tensor is analyzed in context of quantum entanglement. A pure quantum state v of a composite system consisting of d subsystems with n levels each is viewed as a vector in the d-fold tensor product of n-dimensional Hilbert space and can be identified with a tensor with d indices, each running from 1 to n. We discuss the notions of the generic rank and the maximal rank of a tensor and review results known for the low dimensions. Another variant of this notion, called the border rank of a tensor, is shown to be relevant for characterization of orbits of quantum states generated by the group of special linear transformations. A quantum state v is called {\sl entangled}, if it {\sl cannot} be written in the product form, v=v1⊗v2⊗⋯⊗vd, what implies correlations between physical subsystems. A relation between various ranks and norms of a tensor and the entanglement of the corresponding quantum state is revealed..
The fundamental relation between quantum entanglement and convex algebraic geometry has unveiled a set of powerful tools, imported from the former to the study the latter. The space of separable mixed states is convex and so is the space of the corresponding observable values. Therefore, the problem of determining whether a set of observable values come from an entangled state is tantamount to checking for membership in a convex set, of a point with coordinates given by the set of observable values. Here, we use techniques from convex algebraic geometry to develop powerful criteria for entanglement in a many-body system of Bosonic atoms with a non-zero spin. The experimentally accessible observables are the spin expectation values <S_i> and <{S_i, S_j}> which, upon truncating at rank two, are 9 independent quantities. Recently, entanglement criteria in terms of 3 of these 9 quantities have been derived. We develop entanglement criteria using all of these 9 quantities. If we consider these numbers as coordinates of a point in a 9 dimensional space, those with a separable parent state lie within a convex region, also known as the moment cone. Therefore, the problem is to characterize this moment cone. Owing to the Bosonic exchange symmetry, this moment cone is the dual of the cone of non-negative symmetric polynomials. Together with a characterization of this cone, we also develop an entanglement criterion that is asymptotically tight, for large atom numbers.
The approximate coherent state rank is the minimal number of (classical) coherent states required to approximate a continuous-variable bosonic quantum state and directly relates to the classical complexity of simulating bosonic computations. Despite its importance, little is known about lower bounds on this quantity, even for basic families of states. In this work, we initiate a systematic study of lower bounds on the approximate coherent state rank. Our contributions are as follows.
(i) We introduce a technique based on low-rank approximation theory yielding generic lower bounds on the approximate coherent state rank of arbitrary single-mode states.
(ii) Using this technique, we find a complete characterization of all single-mode states of finite approximate coherent state rank, and we obtain in particular analytical expressions for the approximate coherent state rank of squeezed states and of finite superpositions of Fock states.
(iii) We further show that our single-mode lower bounds can be lifted to multimode lower bounds for finite superpositions of multimode Fock states.
(iv) Finally, we prove a super-polynomial lower bound on the approximate coherent state rank of the n-mode Fock state ∣1⟩⊗n, by exploiting a connection to the permanent. To do so, we show that the algebraic complexity of approximate multi-linear formulas for the permanent is super-polynomial, building upon the proof of a lower bound for exact formulas due to [Raz, JACM 2009].
Our results establish an unconditional barrier to efficient classical simulation of Boson Sampling via coherent state decompositions and connect non-classicality of bosonic quantum systems to central questions in algebraic complexity.
We study the problem of finding elements in the intersection of an arbitrary conic variety in Fn with a given linear subspace (where F can be the real or complex field). This problem captures a rich family of algorithmic problems under different choices of the variety. The special case of the variety consisting of rank-1 matrices already has strong connections to central problems in different areas like quantum information theory and tensor decompositions. This problem is known to be NP-hard in the worst case, even for the variety of rank-1 matrices.In this work, we propose and analyze an algorithm for solving this problem. Surprisingly, despite the above hardness results we show that our algorithm solves this problem efficiently for “typical” subspaces. Here, the subspace U⊆Fn is chosen generically of a certain dimension, potentially with some generic elements of the variety contained in it. Our main result is a guarantee that our algorithm recovers all the elements of U that lie in the variety, under some mild non-degeneracy assumptions on the variety. As corollaries, we obtain the following new results:•Polynomial time algorithms for several entangled subspaces problems in quantum entanglement, including determining r-entanglement, complete entanglement, and genuine entanglement of a subspace. While all of these problems are NP-hard in the worst case, our algorithm solves them in polynomial time for generic subspaces of dimension up to a constant multiple of the maximum possible.•Uniqueness results and polynomial time algorithmic guarantees for generic instances of a broad class of low-rank decomposition problems that go beyond tensor decompositions. Here, we recover a decomposition of the form ∑i=1Rvi⊗wi, where the vi are elements of the given variety X. This implies new uniqueness results and genericity guarantees even in the special case of tensor decompositions.
Recent algorithms for classical simulation of quantum mechanics have runtime whose superpolynomial component is given by a linear dependence on the number of terms required to write large tensor products of certain "magic" states as superpositions of "free" states (which may be stabilizer states, fermionic Gaussian states or others). Surprisingly little is known about the number of terms in such decompositions, called ranks (e.g. the stabilizer rank, fermionic-Gaussian rank etc.). For complexity theoretic reasons they are expected to grow exponentially in the number of tensor factors but, while exponential upper bounds are known for both the stabilizer and fermionic-Gaussian rank of magic states; the best known lower bounds on the stabiliser rank are quadratic, and no bounds on the fermionic-Gaussian rank are known beyond fixed constants. In this work we prove that any fermionic Gaussian decomposition of ∣M⟩⊗k consists of Ω(1.4k) terms. Here ∣M⟩ is the most standard magic state for fermionic linear optics: the 4 qubit state that may be consumed to implement a swap gate. We also prove essentially matching bounds on the δ-approximate rank of the same state, lower bounding it by the same quantity that bounds the exact rank, multiplied by a factor of 1−δ2. Our results on exact fermionic Gaussian rank apply directly to any product of k fixed parity non-Gaussian states, although the same is not true of the approximate rank. Finally, we prove that the coherent state border rank of an n-mode bosonic Fock state with mj bosons in mode j is exactly ∏j(1+mj), answering a conjecture of Ref. [1] and obtain lower bounds on the approximate coherent state rank given by the same quantity multiplied by a function of the fidelity of the approximation, emphasizing the broad applicability of the method we employ.