Order preserving maps on quantum measurements

• URL: http://arxiv.org/abs/2202.00725v2
• Date: Fri, 4 Nov 2022 12:05:41 GMT
• Title: Order preserving maps on quantum measurements
• Authors: Teiko Heinosaari and Maria Anastasia Jivulescu and Ion Nechita
• Abstract summary: We study the equivalence classes of quantum measurements endowed with the post-processing partial order. We map this set into a simpler partially ordered set using an order preserving map and investigating the resulting image.
• Score: 1.2891210250935143
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We study the partially ordered set of equivalence classes of quantum measurements endowed with the post-processing partial order. The post-processing order is fundamental as it enables to compare measurements by their intrinsic noise and it gives grounds to define the important concept of quantum incompatibility. Our approach is based on mapping this set into a simpler partially ordered set using an order preserving map and investigating the resulting image. The aim is to ignore unnecessary details while keeping the essential structure, thereby simplifying e.g. detection of incompatibility. One possible choice is the map based on Fisher information introduced by Huangjun Zhu, known to be an order morphism taking values in the cone of positive semidefinite matrices. We explore the properties of that construction and improve Zhu's incompatibility criterion by adding a constraint depending on the number of measurement outcomes. We generalize this type of construction to other ordered vector spaces and we show that this map is optimal among all quadratic maps.

Related papers

• Reverse Map Projections as Equivariant Quantum Embeddings [0.0]
  We introduce the novel class $(E_alpha)_alpha in [-infty,1)$ of reverse map projection embeddings. Inspired by well-known map projections from the unit sphere onto its tangent planes, these embeddings address the common drawback of the amplitude embedding method. We show how reverse map projections can be utilised as equivariant embeddings for quantum machine learning.
  arXiv  Detail & Related papers  (2024-07-29T11:31:24Z)
• Disentangled Representation Learning with the Gromov-Monge Gap [65.73194652234848]
  Learning disentangled representations from unlabelled data is a fundamental challenge in machine learning. We introduce a novel approach to disentangled representation learning based on quadratic optimal transport. We demonstrate the effectiveness of our approach for quantifying disentanglement across four standard benchmarks.
  arXiv  Detail & Related papers  (2024-07-10T16:51:32Z)
• Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
  We introduce an algorithm for data quantization based on the principles of Kashin representation. Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
  arXiv  Detail & Related papers  (2024-04-15T12:38:46Z)
• Minimum Description Length Clustering to Measure Meaningful Image Complexity [65.268245109828]
  We present a new image complexity metric through hierarchical clustering of patches. We use the minimum description length principle to determine the number of clusters and designate certain points as outliers and, hence, correctly assign white noise a low score.
  arXiv  Detail & Related papers  (2023-06-26T15:37:04Z)
• Physical realization of realignment criteria using structural physical approximation [0.0]
  Entanglement detection is an important problem in quantum information theory. Realignment criteria is a powerful tool for detection of entangled states in bipartite and multipartite quantum system.
  arXiv  Detail & Related papers  (2023-01-24T09:41:33Z)
• Isotropic Gaussian Processes on Finite Spaces of Graphs [71.26737403006778]
  We propose a principled way to define Gaussian process priors on various sets of unweighted graphs. We go further to consider sets of equivalence classes of unweighted graphs and define the appropriate versions of priors thereon. Inspired by applications in chemistry, we illustrate the proposed techniques on a real molecular property prediction task in the small data regime.
  arXiv  Detail & Related papers  (2022-11-03T10:18:17Z)
• Classical shadows with Pauli-invariant unitary ensembles [0.0]
  We consider the class of Pauli-invariant unitary ensembles that are invariant under multiplication by a Pauli operator. Our results pave the way for more efficient or robust protocols for predicting important properties of quantum states.
  arXiv  Detail & Related papers  (2022-02-07T15:06:30Z)
• 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)
• Asymmetric compressive learning guarantees with applications to quantized sketches [15.814495790111323]
  We present a framework to train audio event classification on large-scale datasets. We study the relaxation where this map is allowed to be different for each phase. We then instantiate this framework to the setting of quantized sketches, by proving that the LPD indeed holds for binary sketch contributions.
  arXiv  Detail & Related papers  (2021-04-20T15:37:59Z)
• Rethinking Localization Map: Towards Accurate Object Perception with Self-Enhancement Maps [78.2581910688094]
  This work introduces a novel self-enhancement method to harvest accurate object localization maps and object boundaries with only category labels as supervision. In particular, the proposed Self-Enhancement Maps achieve the state-of-the-art localization accuracy of 54.88% on ILSVRC.
  arXiv  Detail & Related papers  (2020-06-09T12:35:55Z)
• Augmented Parallel-Pyramid Net for Attention Guided Pose-Estimation [90.28365183660438]
  This paper proposes an augmented parallel-pyramid net with attention partial module and differentiable auto-data augmentation. We define a new pose search space where the sequences of data augmentations are formulated as a trainable and operational CNN component. Notably, our method achieves the top-1 accuracy on the challenging COCO keypoint benchmark and the state-of-the-art results on the MPII datasets.
  arXiv  Detail & Related papers  (2020-03-17T03:52:17Z)

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.