Simple sufficient condition for subspace to be completely or genuinely entangled

• URL: http://arxiv.org/abs/2107.07530v2
• Date: Mon, 1 Nov 2021 17:53:15 GMT
• Title: Simple sufficient condition for subspace to be completely or genuinely entangled
• Authors: Maciej Demianowicz, Grzegorz Rajchel-Mieldzio\'c, and Remigiusz Augusiak
• Abstract summary: We introduce a simple sufficient criterion, which allows one to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a simple sufficient criterion, which allows one to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace expressed for geometrical measures of entanglement. The criterion is applicable to both completely and genuinely entangled subspaces. We explore its usefulness in several important scenarios. Further, an entanglement criterion for mixed states following directly from the condition is stated. As an auxiliary result we provide a formula for the generalized geometric measure of entanglement of the $d$--level Dicke states.

Related papers

• Krylov Cubic Regularized Newton: A Subspace Second-Order Method with Dimension-Free Convergence Rate [83.3933097134767]
  We introduce a novel subspace cubic regularized Newton method that achieves a dimension-independent global convergence rate of $Oleft(frac1mk+frac1k2right)$. Our method converges faster than existing random subspace methods, especially for high-dimensional problems.
  arXiv  Detail & Related papers  (2024-01-05T20:24:18Z)
• A Geometric Notion of Causal Probing [91.14470073637236]
  In a language model's representation space, all information about a concept such as verbal number is encoded in a linear subspace. We give a set of intrinsic criteria which characterize an ideal linear concept subspace. We find that LEACE returns a one-dimensional subspace containing roughly half of total concept information.
  arXiv  Detail & Related papers  (2023-07-27T17:57:57Z)
• Principal Component Analysis in Space Forms [7.822210329345704]
  We study Principal Component Analysis (PCA) in space forms. Finding the optimal low-dimensional affine subspace for given points in a space form amounts to dimensionality reduction. We propose proper cost functions that enjoy two properties: (1) their optimal affine subspace is the solution to an eigenequation, and (2) optimal affine subspaces of different dimensions form a nested set.
  arXiv  Detail & Related papers  (2023-01-06T23:48:37Z)
• Continuous percolation in a Hilbert space for a large system of qubits [58.720142291102135]
  The percolation transition is defined through the appearance of the infinite cluster. We show that the exponentially increasing dimensionality of the Hilbert space makes its covering by finite-size hyperspheres inefficient. Our approach to the percolation transition in compact metric spaces may prove useful for its rigorous treatment in other contexts.
  arXiv  Detail & Related papers  (2022-10-15T13:53:21Z)
• Fully non-positive-partial-transpose genuinely entangled subspaces [0.0]
  We provide a construction of multipartite subspaces that are not only genuinely entangled but also fully non-positive-partial-transpose (NPT) Our construction originates from the stabilizer formalism known for its use in quantum error correction.
  arXiv  Detail & Related papers  (2022-03-31T09:11:16Z)
• Sion's Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm [46.97925335733651]
  This paper takes a step towards understanding problems that do remain tractable. The first result is a class of geodesic space version Sion's minimax problems. The second result is a result to geodesically completeian complexity.
  arXiv  Detail & Related papers  (2022-02-13T15:18:07Z)
• Universal construction of genuinely entangled subspaces of any size [0.0]
  We construct subspaces supporting only genuinely multipartite entangled states of any permissible dimensionality. An immediate consequence of our result is the possibility of constructing in the general multiparty scenario genuinely multiparty entangled mixed states with ranks up to the maximal dimension of a genuinely entangled subspace.
  arXiv  Detail & Related papers  (2021-11-19T13:04:43Z)
• Self-testing maximally-dimensional genuinely entangled subspaces within the stabilizer formalism [0.0]
  We introduce a framework allowing to efficiently check whether a given stabilizer subspace is genuinely entangled. We then determine the maximal dimension of genuinely entangled subspaces. We construct Bell inequalities that are maximally violated by any entangled state from those subspaces.
  arXiv  Detail & Related papers  (2020-12-02T13:02:52Z)
• Geometry of Similarity Comparisons [51.552779977889045]
  We show that the ordinal capacity of a space form is related to its dimension and the sign of its curvature. More importantly, we show that the statistical behavior of the ordinal spread random variables defined on a similarity graph can be used to identify its underlying space form.
  arXiv  Detail & Related papers  (2020-06-17T13:37:42Z)
• Is an Affine Constraint Needed for Affine Subspace Clustering? [27.00532615975731]
  In computer vision applications, the subspaces are linear and subspace clustering methods can be applied directly. In motion segmentation, the subspaces are affine and an additional affine constraint on the coefficients is often enforced. This paper shows, both theoretically and empirically, that when the dimension of the ambient space is high relative to the sum of the dimensions of the affine subspaces, the affine constraint has a negligible effect on clustering performance.
  arXiv  Detail & Related papers  (2020-05-08T07:52:17Z)
• Quantum Geometric Confinement and Dynamical Transmission in Grushin Cylinder [68.8204255655161]
  We classify the self-adjoint realisations of the Laplace-Beltrami operator minimally defined on an infinite cylinder. We retrieve those distinguished extensions previously identified in the recent literature, namely the most confining and the most transmitting.
  arXiv  Detail & Related papers  (2020-03-16T11:37:23Z)

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.