Related papers: Compatibility of subsystem states and convex geome…
We study the relationship between bipartite entanglement, subsystem particle number and topology in a half-filled free fermion system. It is proposed that the spin-projected particle numbers can distinguish the quantum spin Hall state from…
We investigate the issue of finding common entanglement witness for certain class of states and extend this study to the case of Schmidt number witnesses. We also introduce the notion of common decomposable and non-decomposable witness…
Symmetries are of fundamental interest in many areas of science. In quantum information theory, if a quantum state is invariant under permutations of its subsystems, it is a well-known and widely used result that its marginal can be…
We study the problem of determining whether a given temporal specification can be implemented by a symmetric system, i.e., a system composed from identical components. Symmetry is an important goal in the design of distributed systems,…
In 2008, the conjecture that structural physical approximations to optimal entanglement witnesses are separable states (in general unnormalized) was posed. In an attempt to disprove it, in [K.-C. Ha and S.-H. Kye, Separable states with…
An entanglement witness (EW) is a Hermitian operator that can distinguish an entangled state from all separable states. We drive and implement a numerical method based on machine learning to create a multipartite EW. Using support vector…
We suggest an optical method which tests a nonclassical feature with a coherent state input. The test is designed with a multiplexer of on/off detectors and post-selection, adopting sub-binomiality as a nonclassical feature, replacing…
The de Finetti representation theorem for continuous variable quantum system is first developed to approximate an N-partite continuous variable quantum state with a convex combination of independent and identical subsystems, which requires…
Finding a point in the intersection of a collection of closed convex sets, that is the convex feasibility problem, represents the main modeling strategy for many computational problems. In this paper we analyze new stochastic reformulations…
In this paper, we present sufficient conditions ensuring that the sum of the image of quadratic functions and the nonnegative orthant is convex. The hidden convexity of the trust-region problem with linear inequality constraints is…
This paper deals with the convex feasibility problem, where the feasible set is given as the intersection of a (possibly infinite) number of closed convex sets. We assume that each set is specified algebraically as a convex inequality,…
Entanglement between remote quantum mechanical systems enables a range of quantum information tasks in communication, computation and distributed sensing. Large numbers of entangled subsystems also require experimentally accessible and…
Due to the increasing complexity and interconnectedness of different components in modern automotive software systems there is a great number of interactions between these system components and their environment. These interactions result…
In mutation testing the question whether a mutant is equivalent to its program is important in order to compute the correct mutation score. Unfortunately, answering this question is not always possible and can hardly be obtained just by…
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…
We consider a huge quantum system that is subject to the charge superselection rule, which requires that any pure state must be an eigenstate of the total charge. We regard some parts of the system as "subsystems," and the rest as an…
The separability detecting problem of mixed states is one of the fundamental problems in quantum information theory. In the last 20 years, almost all methods are based on the sufficient or necessary conditions for entanglement. However, in…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
Although entanglement is a basic resource for reaching quantum advantange in many computation and information protocols, we lack a universal recipe for detecting it, with analytical results obtained for low dimensional systems and few…
Semidefinite programs (SDPs) -- some of the most useful and versatile optimization problems of the last few decades -- are often pathological: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs…