Monotones in General Resource Theories

• URL: http://arxiv.org/abs/1912.07085v3
• Date: Tue, 8 Aug 2023 09:30:22 GMT
• Title: Monotones in General Resource Theories
• Authors: Tom\'a\v{s} Gonda, Robert W. Spekkens
• Abstract summary: Various constructions of monotones appear in many different resource theories. Monotones based on contractions arise naturally in the latter class. We present our results within a novel framework for resource theories in which the notion of composition is independent of the types of the resources involved.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A central problem in the study of resource theories is to find functions that are nonincreasing under resource conversions - termed monotones - in order to quantify resourcefulness. Various constructions of monotones appear in many different concrete resource theories. How general are these constructions? What are the necessary conditions on a resource theory for a given construction to be applicable? To answer these questions, we introduce a broad scheme for constructing monotones. It involves finding an order-preserving map from the preorder of resources of interest to a distinct preorder for which nontrivial monotones are previously known or can be more easily constructed; these monotones are then pulled back through the map. In one of the two main classes we study, the preorder of resources is mapped to a preorder of sets of resources, where the order relation is set inclusion, such that monotones can be defined via maximizing or minimizing the value of a function within these sets. In the other class, the preorder of resources is mapped to a preorder of tuples of resources, and one pulls back monotones that measure the amount of distinguishability of the different elements of the tuple (hence its information content). Monotones based on contractions arise naturally in the latter class, and, more surprisingly, so do weight and robustness measures. In addition to capturing many standard monotone constructions, our scheme also suggests significant generalizations of these. In order to properly capture the breadth of applicability of our results, we present them within a novel abstract framework for resource theories in which the notion of composition is independent of the types of the resources involved (i.e., whether they are states, channels, combs, etc.).

Related papers

• Conceptual and formal groundwork for the study of resource dependence relations [0.0]
  A resource theory imposes a preorder over states, with one state being above another if the first can be converted to the second by a free operation. It follows that there can be nontrivial dependence relations between different notions of resourcefulness.
  arXiv  Detail & Related papers  (2024-06-28T18:04:31Z)
• Choi-Defined Resource Theories [0.0]
  We refer to resource theories exhibiting this property as Choi-defined resource theories. We prove that when such a construction is possible, the free operations are all and only the completely resource non-generating operations.
  arXiv  Detail & Related papers  (2024-02-19T21:51:01Z)
• Causal Layering via Conditional Entropy [85.01590667411956]
  Causal discovery aims to recover information about an unobserved causal graph from the observable data it generates. We provide ways to recover layerings of a graph by accessing the data via a conditional entropy oracle.
  arXiv  Detail & Related papers  (2024-01-19T05:18:28Z)
• A Study of Neural Collapse Phenomenon: Grassmannian Frame, Symmetry and Generalization [91.95109845914267]
  We extend original Neural Collapse Phenomenon by proving Generalized Neural Collapse hypothesis. We obtain Grassmannian Frame structure from the optimization and generalization of classification. We provide a theorem to explain Symmetric Generalization of permutation.
  arXiv  Detail & Related papers  (2023-04-18T11:35:14Z)
• Sequences of resource monotones from modular Hamiltonian polynomials [0.0]
  We show that entanglement monotones yield infinite sequences of inequalities that must be satisfied in majorizing state transitions. These inequalities give improved lower bounds for the work cost in finite dimensional systems. As an application to thermodynamics, one can use them to derive finite-dimension corrections to the Clausius inequality.
  arXiv  Detail & Related papers  (2023-01-03T11:33:44Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• Extending Resource Monotones using Kan Extensions [0.0]
  We show that Kan extensions provide a precise categorical framework to describe and compute such extensions of monotones. We describe monotones as pCat functors into the preorder of non-negative real numbers, and describe extending monotones along any pCat functor. We show how our framework works by applying it to extend entanglement monotones for bipartite pure states to bipartite mixed states, to extend classical divergences to the quantum setting, and to extend a non-uniformity monotone from classical probabilistic theory to quantum theory.
  arXiv  Detail & Related papers  (2022-06-20T14:06:05Z)
• Using Partial Monotonicity in Submodular Maximization [13.23676270963484]
  We show that for many standard submodular algorithms one can prove new approximation guarantees that depend on the monotonicity ratio. This leads to improved approximation ratios for the common machine learning applications of movie recommendation, quadratic programming and image summarization.
  arXiv  Detail & Related papers  (2022-02-07T10:35:40Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)
• What Should Not Be Contrastive in Contrastive Learning [110.14159883496859]
  We introduce a contrastive learning framework which does not require prior knowledge of specific, task-dependent invariances. Our model learns to capture varying and invariant factors for visual representations by constructing separate embedding spaces. We use a multi-head network with a shared backbone which captures information across each augmentation and alone outperforms all baselines on downstream tasks.
  arXiv  Detail & Related papers  (2020-08-13T03:02:32Z)
• Exact Hard Monotonic Attention for Character-Level Transduction [76.66797368985453]
  We show that neural sequence-to-sequence models that use non-monotonic soft attention often outperform popular monotonic models. We develop a hard attention sequence-to-sequence model that enforces strict monotonicity and learns a latent alignment jointly while learning to transduce.
  arXiv  Detail & Related papers  (2019-05-15T17:51:09Z)

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.