Universal construction of genuinely entangled subspaces of any size

• URL: http://arxiv.org/abs/2111.10193v4
• Date: Sat, 5 Nov 2022 22:09:03 GMT
• Title: Universal construction of genuinely entangled subspaces of any size
• Authors: Maciej Demianowicz
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We put forward a simple construction of genuinely entangled subspaces -- subspaces supporting only genuinely multipartite entangled states -- of any permissible dimensionality for any number of parties and local dimensions. The method uses nonorthogonal product bases, which are built from totally nonsingular matrices with a certain structure. We give an explicit basis for the constructed subspaces. 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.

Related papers

• Relative intrinsic dimensionality is intrinsic to learning [49.5738281105287]
  We introduce a new notion of the intrinsic dimension of a data distribution, which precisely captures the separability properties of the data. For this intrinsic dimension, the rule of thumb above becomes a law: high intrinsic dimension guarantees highly separable data. We show thisRelative intrinsic dimension provides both upper and lower bounds on the probability of successfully learning and generalising in a binary classification problem.
  arXiv  Detail & Related papers  (2023-10-10T10:41:45Z)
• 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)
• Data-Free Learning of Reduced-Order Kinematics [54.85157881323157]
  We produce a low-dimensional map whose image parameterizes a diverse yet low-energy submanifold of configurations. We represent subspaces as neural networks that map a low-dimensional latent vector to the full configuration space. This formulation is effective across a very general range of physical systems.
  arXiv  Detail & Related papers  (2023-05-05T20:53:36Z)
• Unextendibility, uncompletability, and many-copy indistinguishable ensembles [77.34726150561087]
  We study unextendibility, uncompletability and analyze their connections to many-copy indistinguishable ensembles. We report a class of multipartite many-copy indistinguishable ensembles for which local indistinguishability property increases with decreasing mixedness.
  arXiv  Detail & Related papers  (2023-03-30T16:16:41Z)
• 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)
• Spectral embedding and the latent geometry of multipartite networks [67.56499794542228]
  Many networks are multipartite, meaning their nodes can be divided into partitions and nodes of the same partition are never connected. This paper demonstrates that the node representations obtained via spectral embedding live near partition-specific low-dimensional subspaces of a higher-dimensional ambient space. We propose a follow-on step after spectral embedding, to recover node representations in their intrinsic rather than ambient dimension.
  arXiv  Detail & Related papers  (2022-02-08T15:52:03Z)
• Construction of genuinely entangled multipartite subspaces from bipartite ones by reducing the total number of separated parties [0.0]
  Construction of genuinely entangled multipartite subspaces with certain characteristics has become a relevant task in various branches of quantum information. We show that such subspaces can be obtained from an arbitrary collection of bipartite entangled subspaces under joining of their adjacent subsystems. It is shown that direct sums of such constructions under certain conditions are genuinely entangled.
  arXiv  Detail & Related papers  (2022-01-19T23:37:02Z)
• Simple sufficient condition for subspace to be completely or genuinely entangled [0.0]
  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.
  arXiv  Detail & Related papers  (2021-07-15T18:00:13Z)
• Intrinsic Dimension Estimation [92.87600241234344]
  We introduce a new estimator of the intrinsic dimension and provide finite sample, non-asymptotic guarantees. We then apply our techniques to get new sample complexity bounds for Generative Adversarial Networks (GANs) depending on the intrinsic dimension of the data.
  arXiv  Detail & Related papers  (2021-06-08T00:05:39Z)
• Construction of genuinely multipartite entangled subspaces and the associated bounds on entanglement measures for mixed states [0.0]
  Genuine entanglement is the strongest form of multipartite entanglement. In this paper we present several methods of construction of genuinely entangled subspaces.
  arXiv  Detail & Related papers  (2021-04-19T22:13:08Z)
• 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)

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.