Practical construction of positive maps which are not completely positive

• URL: http://arxiv.org/abs/2001.01181v1
• Date: Sun, 5 Jan 2020 07:39:44 GMT
• Title: Practical construction of positive maps which are not completely positive
• Authors: Abhishek Bhardwaj
• Abstract summary: This article introduces PnCP, a toolbox for constructing positive maps which are not completely positive. We show how this package can be applied to the problem of classifying entanglement in quantum states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This article introduces PnCP, a MATLAB toolbox for constructing positive maps which are not completely positive. We survey optimization and sum of squares relaxation techniques to find the most numerically efficient methods for this construction. We also show how this package can be applied to the problem of classifying entanglement in quantum states.

Related papers

• PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently [0.0]
  We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. As a side product, we provide an optimized method for one key calculus in quantum simulations: the Pauli basis decomposition of Hamiltonians.
  arXiv  Detail & Related papers  (2023-01-02T08:48:47Z)
• Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimization [46.30376601157526]
  We introduce pointwise map smoothness via the Dirichlet energy into the functional map pipeline. We propose an algorithm for optimizing it efficiently, which leads to high-quality results in challenging settings.
  arXiv  Detail & Related papers  (2022-10-05T14:07:17Z)
• Positive maps from the walled Brauer algebra [4.4378250612684]
  We present positive maps and matrix inequalities for variables from the positive cone. Using our formalism, these maps can be obtained in a systematic and clear way.
  arXiv  Detail & Related papers  (2021-12-23T17:42:45Z)
• New examples of entangled states on $\mathbb{C}^3 \otimes \mathbb{C}^3$ [0.0]
  We use the Buckley-vSivic method for simultaneous construction of families of positive maps on $3 times 3$ self-adjoint matrices. We obtain entanglement witnesses that are indecomposable and belong to extreme rays of the cone of positive maps. The constructed states as well as the method of their construction offer some valuable insights for quantum information theory.
  arXiv  Detail & Related papers  (2021-12-23T15:29:06Z)
• Near-optimal estimation of smooth transport maps with kernel sums-of-squares [81.02564078640275]
  Under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. The object of interest for applications such as generative modeling is the underlying optimal transport map. We propose the first tractable algorithm for which the statistical $L2$ error on the maps nearly matches the existing minimax lower-bounds for smooth map estimation.
  arXiv  Detail & Related papers  (2021-12-03T13:45:36Z)
• Optimal radial basis for density-based atomic representations [58.720142291102135]
  We discuss how to build an adaptive, optimal numerical basis that is chosen to represent most efficiently the structural diversity of the dataset at hand. For each training dataset, this optimal basis is unique, and can be computed at no additional cost with respect to the primitive basis. We demonstrate that this construction yields representations that are accurate and computationally efficient.
  arXiv  Detail & Related papers  (2021-05-18T17:57:08Z)
• Characterization of $k$-positive maps [0.6827423171182154]
  We construct a family of positive maps between matrix algebras of different dimensions depending on a parameter. The estimate bounds on the parameter to obtain the $k$-positivity are better than those derived from the spectral conditions considered by Chru'sci'nski and Kossakowski.
  arXiv  Detail & Related papers  (2021-04-29T00:46:58Z)
• Pathwise Conditioning of Gaussian Processes [72.61885354624604]
  Conventional approaches for simulating Gaussian process posteriors view samples as draws from marginal distributions of process values at finite sets of input locations. This distribution-centric characterization leads to generative strategies that scale cubically in the size of the desired random vector. We show how this pathwise interpretation of conditioning gives rise to a general family of approximations that lend themselves to efficiently sampling Gaussian process posteriors.
  arXiv  Detail & Related papers  (2020-11-08T17:09:37Z)
• Local optimization on pure Gaussian state manifolds [63.76263875368856]
  We exploit insights into the geometry of bosonic and fermionic Gaussian states to develop an efficient local optimization algorithm. The method is based on notions of descent gradient attuned to the local geometry. We use the presented methods to collect numerical and analytical evidence for the conjecture that Gaussian purifications are sufficient to compute the entanglement of purification of arbitrary mixed Gaussian states.
  arXiv  Detail & Related papers  (2020-09-24T18:00:36Z)
• Decomposable Pauli diagonal maps and Tensor Squares of Qubit Maps [91.3755431537592]
  We show that any positive product of a qubit map with itself is decomposable. We characterize the cone of decomposable ququart Pauli diagonal maps.
  arXiv  Detail & Related papers  (2020-06-25T16:39:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.