Related papers: Practical construction of positive maps which are …
Many problems in robotics require reasoning over a mix of continuous dynamics and discrete events, such as making and breaking contact in manipulation and locomotion. These problems are locally well modeled by linear complementarity…
Several characterizations are given for a square matrix that can be written as the product of two positive (semidefinite) projections. Based on one of these characterizations, and the theory of alternating projections, a Matlab program is…
Multipartite entanglement is a key resource for quantum computation. It is expected theoretically that entanglement transition may happen for multipartite random quantum states, however, which is still absent experimentally. Here, we report…
The positive and not completely positive maps of density matrices, which are contractive maps, are discussed as elements of a semigroup. A new kind of positive map (the purification map), which is nonlinear map, is introduced. The density…
In this thesis work, we have studied the role of positive and completely positive maps in detecting entanglement.
Quantum state preparation (QSP) is a fundamental task in quantum computing and quantum information processing. It is critical to the execution of many quantum algorithms, including those in quantum machine learning. In this paper, we…
We consider several basic questions pertaining to the geometry of image of a general quadratic map. In general the image of a quadratic map is non-convex, although there are several known classes of quadratic maps when the image is convex.…
We construct entangled states with positive partial transposes using indecomposable positive linear maps between matrix algebras. We also exhibit concrete examples of entangled states with positive partial transposes arising in this way,…
We study $k$-positive linear maps on matrix algebras and address two problems, (i) characterizations of $k$-positivity and (ii) generation of non-decomposable $k$-positive maps. On the characterization side, we derive optimization-based…
The Choi representation of completely positive (CP) maps, i.e. quantum channels is often used in the context of quantum information and computation as it is easy to work with. It is a correspondence between CP maps and quantum states also…
We study k-positive maps on operators. Proofs are given to different positivity criteria. Special attention is on positive maps arising in the study of quantum information science. Results of other researchers are extended and improved. New…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…
We provide a general and consistent formulation for linear subsystem quantum dynamical maps, developed from a minimal set of postulates, primary among which is a relaxation of the usual, restrictive assumption of uncorrelated initial…
A hierarchical, reversible mapping between levels of tree structured computation, applicable for structuring the Quantum Computation algorithm for NP-complete problem is presented. It is proven that confining the state of a quantum computer…
We present a MATLAB/Octave toolbox to decompose finite dimensionial representations of compact groups. Surprisingly, little information about the group and the representation is needed to perform that task. We discuss applications to…
We derive an extremal equation for optimal completely-positive map which most closely approximates a given transformation between pure quantum states. Moreover, we also obtain an upper bound on the maximal mean fidelity that can be attained…
One of the most challenging open problems in quantum information theory is to clarify and quantify how entanglement behaves when part of an entangled state is sent through a quantum channel. Of central importance in the description of a…
This document introduces a set of 24 box-constrained numerical global optimization problem instances, systematically constructed using the Generalized Numerical Benchmark Generator (GNBG). These instances cover a broad spectrum of problem…
We describe QGLAB, a new MATLAB package for analyzing partial differential equations on quantum graphs. The software is built on the existing, object-oriented MATLAB directed-graph class, inheriting its structure and adding additional…