Characterisation of quantum betting tasks in terms of Arimoto mutual information

• URL: http://arxiv.org/abs/2106.12711v2
• Date: Tue, 14 Dec 2021 20:16:44 GMT
• Title: Characterisation of quantum betting tasks in terms of Arimoto mutual information
• Authors: Andres F. Ducuara and Paul Skrzypczyk
• Abstract summary: We introduce the operational tasks of quantum state betting (QSB), noisy quantum state betting (nQSB), and quantum channel betting (QCB) We prove that the advantage that informative measurements provide in QSB (nQSB) is exactly characterised by Arimoto's $alpha$-mutual information. We also introduce new quantum R'enyi divergences for measurements, and derive a new family of resource monotones for the QRT of measurement informativeness.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce operational quantum tasks based on betting with risk-aversion -- or quantum betting tasks for short -- inspired by standard quantum state discrimination and classical horse betting with risk-aversion and side information. In particular, we introduce the operational tasks of quantum state betting (QSB), noisy quantum state betting (nQSB), and quantum channel betting (QCB) played by gamblers with different risk tendencies. We prove that the advantage that informative measurements (non-constant channels) provide in QSB (nQSB) is exactly characterised by Arimoto's $\alpha$-mutual information, with the order $\alpha$ determining the risk aversion of the gambler. More generally, we show that Arimoto-type information-theoretic quantities characterise the advantage that resourceful objects offer at playing quantum betting tasks when compared to resourceless objects, for general quantum resource theories (QRTs) of measurements, channels, states, and state-measurement pairs, with arbitrary resources. In limiting cases, we show that QSB (QCB) recovers the known tasks of quantum state (channel) discrimination when $\alpha \rightarrow \infty$, and quantum state (channel) exclusion when $\alpha \rightarrow -\infty$. Inspired by these connections, we also introduce new quantum R\'enyi divergences for measurements, and derive a new family of resource monotones for the QRT of measurement informativeness. This family of resource monotones recovers in the same limiting cases as above, the generalised robustness and the weight of informativeness. Altogether, these results establish a broad and continuous family of four-way correspondences between operational tasks, mutual information measures, quantum R\'enyi divergences, and resource monotones, that can be seen to generalise two limiting correspondences that were recently discovered for the QRT of measurement informativeness.

Related papers

• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Generalization Error Bound for Quantum Machine Learning in NISQ Era -- A Survey [37.69303106863453]
  We conduct a Systematic Mapping Study (SMS) to explore the state-of-the-art generalization bound for supervised Quantum Machine Learning (QML) in the Noisy Intermediate-Scale Quantum (NISQ) era.<n>Our study systematically summarizes the existing computational platforms with quantum hardware, datasets, optimization techniques, and the common properties of the bounds found in the literature.<n>The SMS also highlights the limitations and challenges in QML in the NISQ era and discusses future research directions to advance the field.
  arXiv  Detail & Related papers  (2024-09-11T21:17:30Z)
• Barycentric and Pairwise Renyi Quantum Leakage [9.244521717083696]
  Barycentric and pairwise quantum Renyi leakages are proposed as measures of information leakage for privacy and security analysis. They satisfy important properties of positivity, independence, post-processing inequality, and unitary invariance. Global and local depolarizing channels, that are common models of noise in quantum computing and communication, restrict private or secure information leakage.
  arXiv  Detail & Related papers  (2024-02-09T03:09:33Z)
• An operational definition of quantum information scrambling [0.0]
  Quantum information scrambling (QIS) is a characteristic feature of several quantum systems. We propose a novel and computationally efficient QIS quantifier based on a formulation of QIS in terms of quantum state discrimination. We show that the optimal guessing probability, which reflects the degree of QIS induced by an isometric quantum evolution, is directly connected to the accessible min-information.
  arXiv  Detail & Related papers  (2023-12-18T19:00:01Z)
• Squashed quantum non-Markovianity: a measure of genuine quantum non-Markovianity in states [0.6990493129893111]
  We propose a faithful measure for non-Markovianity of genuine quantum origin called squashed quantum non-Markovianity (sQNM) It is based on the quantum conditional mutual information and is defined by the left-over non-Markovianity after squashing out all non-quantum contributions. We show that the sQNM is monogamous, continuous, convex, additive on tensor-product states, and generally super-additive.
  arXiv  Detail & Related papers  (2023-11-30T07:48:32Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Robustness- and weight-based resource measures without convexity restriction: Multicopy witness and operational advantage in static and dynamical quantum resource theories [1.3124513975412255]
  characterizations of robustness- and weight-based measures in general QRTs without convexity restriction. We establish the usefulness of robustness-based and weight-based techniques beyond the conventional scope of convex QRTs.
  arXiv  Detail & Related papers  (2023-10-13T14:52:49Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems [71.78056556634196]
  This paper unifiedly addresses two kinds of key quantum secure tasks, i.e., quantum versions of secret sharing (SS) and symmetric private information retrieval (SPIR) In particular, two kinds of quantum extensions of SS are known; One is the classical-quantum (CQ) setting, in which the secret to be sent is classical information and the shares are quantum systems. We newly introduce the third setting, i.e., the entanglement-assisted (EA) setting, which is defined by modifying the CQ setting with allowing prior entanglement between the dealer and the end-user who recovers the secret by
  arXiv  Detail & Related papers  (2022-05-29T10:28:04Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Entropic and operational characterizations of dynamic quantum resources [3.2074558838636262]
  We provide new methods for characterizing general closed and convex quantum resource theories. We propose a resource-theoretic generalization of the quantum conditional min-entropy. We show that every well-defined robustness-based measure of a channel can be interpreted as an operational advantage of the channel over free channels in a communication task.
  arXiv  Detail & Related papers  (2021-12-13T18:58:36Z)
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding [58.720142291102135]
  We define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. Our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation.
  arXiv  Detail & Related papers  (2021-09-27T12:56:01Z)

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.