SearcharxivSearch

arXiv subjects

Jennifer Ahiable

Publications and source records attributed to Jennifer Ahiable.

4 recordsLinked to original sources

The geometry of absolute separability and other convex matrix properties from spectrum

We investigate the geometric structure of the set of spectra of bipartite absolute separable states ($\mathrm{ASEP}_{m,n}$) and absolute positive partial transpose states ($\mathrm{APPT}_{m,n}$), i.e., bipartite quantum states that remain separable or PPT respectively, under all global unitary transformations. First, we establish general geometric properties of absolute convex sets of matrices, their spectra and extreme points. Regarding absolute separability, we present a permutation-symmetric reformulation of the absolute PPT criterion and use it to demonstrate that $\mathrm{APPT}_{m,n}$ is a spectrahedron for all $m\leq n$: in particular, all its faces are exposed. In contrast, while $\mathrm{ASEP}_{2,n}$ is also a spectrahedron, we prove that in general $\mathrm{ASEP}_{m,n}$ is a semialgebraic set for all $m\leq n$. Furthermore, we provide a complete characterization of the faces and extreme points of $\mathrm{APPT}_{m,n}$ and demonstrate that the dimension of a face is determined by the rank of a certain matrix, with maximal proper faces having dimension $(mn-m-1)$. In the quantitative setting, we provide a rigorous lower bound on the maximal attainable purity of $\mathrm{APPT}_{m,n}$ via an inscribed polytope $\mathcal{P}_{m,n}$ and conjecture that the maximal purity of $\mathrm{APPT}_{m,n}$ (along with its spectra) coincides with the polytope for arbitrary dimensions except when $m=n=2$. Additionally, we also provide a rigorous upper bound on the minimal von Neumann entropy of $\mathrm{APPT}_{m,n}$ and demonstrate numerically that the minimum entropy eventually coincides with the polytope $\mathcal{P}_{m,n}$ as the local system dimension $n$ increases. Finally, we show that the relative spectral volume of $\mathrm{APPT}_{m,n}$ decays exponentially in $n$ by a constant multiplicative factor of the relative volume of the inscribed polytope $\mathcal{P}_{m,n}$.

quant-ph

Certifying bipartite entangled states with few local measurements: from separable stabilizers to applications

We show a simple and systematic way to certify any given bipartite state as the unique joint $1$-eigenstate of two separable projectors, each of which can be measured with simple local observables. This is practically useful, as the detection probabilities of the two stabilizer projectors relate directly to the fidelity of certification. The same result gives a simple and effective lower bound on the entanglement fidelity of a quantum channel in terms of two ensemble fidelities. We then generalise the bipartite result recursively to multipartite systems, showing that every $n$-party pure state is the unique joint $1$-eigenstate of $2^{n-1}$ separable projectors, and an upper bound of the infidelity of the state in terms of the infidelities of the separable stabilizer projectors.

quant-ph

Multipartite entanglement in the diagonal symmetric subspace

We investigate the entanglement properties in the symmetric subspace of $N$-partite $d$-dimensional systems (qudits). For diagonal symmetric states, we show that there is no bound entanglement for $d = 3,4 $ and $N = 3$. Further, we present a constructive algorithm to map multipartite diagonal symmetric states of qudits onto bipartite symmetric states of larger local dimension. This technique greatly simplifies the analysis of multipartite states and allows to infer entanglement properties for any even $N \geq 4 $ due to the fact that the PPT conditions that arise from the bipartite symmetric state correspond to the same PPT conditions that appear in the multipartite diagonal symmetric state.

quant-ph

Entanglement Breaking Channels, Stochastic Matrices, and Primitivity

We consider the important class of quantum operations (completely positive trace-preserving maps) called entanglement breaking channels. We show how every such channel induces stochastic matrix representations that have the same non-zero spectrum as the channel. We then use this to investigate when entanglement breaking channels are primitive, and prove this depends on primitivity of the matrix representations. This in turn leads to tight bounds on the primitivity index of entanglement breaking channels in terms of the primitivity index of the associated stochastic matrices. We also present examples and discuss open problems generated by the work.

quant-ph