Related papers: Calculating Entanglement Eigenvalues for Non-Symme…
We present entcalc, a Python and MATLAB package for estimating the geometric entanglement of multipartite quantum states. The package operates as follows: given a multipartite quantum state as input, it outputs an estimate of its geometric…
We present a numerical method for solving the separability problem of Gaussian quantum states in continuous-variable quantum systems. We show that the separability problem can be cast as an equivalent problem of determining the feasibility…
We give an exact solution to the nonlinear optimization problem of approximating a Hermitian matrix by positive semi-definite matrices. Our algorithm was then used to judge whether a quantum state is entangled or not. We show that the exact…
Recently, a technique known as quantum symmetry test has gained increasing attention for detecting bipartite entanglement in pure quantum states. In this work we show that, beyond qualitative detection, a family of well-defined measures of…
We describe a factor-revealing convex optimization problem for the integrality gap of the maximum-cut semidefinite programming relaxation: for each $n \geq 2$ we present a convex optimization problem whose optimal value is the largest…
We propose two semi-device-independent approaches that are able to quantify unknown multipartite quantum entanglement experimentally, where the only information that has to be known beforehand is quantum dimension, and the concept that…
For many applications the presence of a quantum advantage crucially depends on the availability of resourceful states. Although the resource typically depends on the particular task, in the context of multipartite systems entangled quantum…
We demonstrate the feasibility to completely characterize entanglement by negativities of quasiprobabilities. This requires the complete solution of a sophisticated mathematical problem, the so-called separability eigenvalue problem. Its…
We consider a parametric family of quadratically constrained quadratic programs (QCQP) and their associated semidefinite programming (SDP) relaxations. Given a nominal value of the parameter at which the SDP relaxation is exact, we study…
The classic method for computing the spectral decomposition of a real symmetric matrix, the Jacobi algorithm, can be accelerated by using mixed precision arithmetic. The Jacobi algorithm is aiming to reduce the off-diagonal entries…
The convergence of the so-called quadratic method for computing eigenvalue enclosures of general self-adjoint operators is examined. Explicit asymptotic bounds for convergence to isolated eigenvalues are found. These bounds turn out to…
We present a measure of quantum entanglement which is capable of quantifying the degree of entanglement of a multi-partite quantum system. This measure, which is based on a generalization of the Schmidt rank of a pure state, is defined on…
In this paper we introduce a measure of genuine quantum incompatibility in the estimation task of multiple parameters, that has a geometric character and is backed by a clear operational interpretation. This measure is then applied to some…
Cubic invariants for two-dimensional Hamiltonian systems are investigated using the Jacobi geometrization procedure. This approach allows for a unified treatment of invariants at both fixed and arbitrary energy. In the geometric picture the…
We study the rank of a general tensor $u$ in a tensor product $H_1\ot...\ot H_k$. The rank of $u$ is the minimal number $p$ of pure states $v_1,...,v_p$ such that $u$ is a linear combination of the $v_j$'s. This rank is an algebraic measure…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
We present a concise introduction to quantum entanglement. Concentrating on bipartite systems we review the separability criteria and measures of entanglement. We focus our attention on geometry of the sets of separable and maximally…
Geometric properties of the set of quantum entangled states are investigated. We propose an explicit method to compute the dimension of local orbits for any mixed state of the general K x M problem and characterize the set of effectively…
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…