Quantum Proper Scoring Rules: Minimax Estimation and Resource-Theoretic Advantages

• URL: http://arxiv.org/abs/2605.05268v1
• Date: Wed, 06 May 2026 11:23:07 GMT
• Title: Quantum Proper Scoring Rules: Minimax Estimation and Resource-Theoretic Advantages
• Abstract summary: We generalize proper scoring rules to the quantum domain, replacing probability distributions with density operators.<n>We define Quantum Value Functionals via operator convex generators and establish a complete duality theory yielding proper quantum scoring rules.<n>Our results guide the design of quantum sensors, incentive-compatible quantum data markets, and robust quantum machine learning protocols.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: We generalize proper scoring rules to the quantum domain, replacing probability distributions with density operators. We define Quantum Value Functionals via operator convex generators and establish a complete duality theory yielding proper quantum scoring rules. We derive minimax optimal bounds for quantum state tomography under McCarthy-type incentives, proving a Quantum Cramér-Rao-McCarthy Bound that explicitly links minimax risk to the curvature of the generating function and the Quantum Fisher Information. We quantify the economic value of quantum resources (coherence, entanglement, adaptivity) in forecasting tasks, establishing scaling separations between classical and quantum estimation strategies. Our results guide the design of quantum sensors, incentive-compatible quantum data markets, and robust quantum machine learning protocols.

Related papers

• Strategic Plan for Neutral Atom Quantum Computation [84.56908019536233]
  We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements.<n>The concept of practical quantum advantage is defined, along with how to verify claims of advantage, and approaches to designing quantum algorithms that deliver practical advantage.
  arXiv  Detail & Related papers  (2026-07-23T17:36:19Z)
• Quantum Circuit-Based Adaptation for Credit Risk Analysis [27.308408027453012]
  Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation.<n>We experimentally study how hardware-aware variational quantum circuits on a superconducting quantum processing unit can model distributions relevant to specific use-case applications for Credit Risk Analysis.
  arXiv  Detail & Related papers  (2026-01-11T11:17:37Z)
• From Classical Data to Quantum Advantage -- Quantum Policy Evaluation on Quantum Hardware [1.451206235416202]
  Quantum policy evaluation (QPE) is a reinforcement learning algorithm which is quadratically more efficient than an analogous classical Monte Carlo estimation.<n>We show how these environment parameters can be learned from a batch of classical observational data through quantum machine learning (QML) on quantum hardware.<n>Our experiments reveal that, despite challenges such as noise and short coherence times, the integration of QML and QPE shows promising potential for achieving quantum advantage in RL.
  arXiv  Detail & Related papers  (2025-09-09T11:36:25Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• From top quarks to enhanced quantum key distribution: A Framework for Optimal Predictability of Quantum Observables [0.0]
  We introduce a comprehensive framework for quantifying the predictability of measurements on a bipartite quantum system.<n>We derive analytical expressions for the optimal measurement that minimizes the prediction error for any arbitrary observable and any two-qubit state.<n>We apply our framework in two scenarios: perfect Bell states affected by local amplitude-damping noises, and top-antitop quark pairs produced in high-energy colliders.
  arXiv  Detail & Related papers  (2025-05-30T12:03:59Z)
• Quantifying Quantum Steering with Limited Resources: A Semi-supervised Machine Learning Approach [3.6384366906530623]
  Quantum steering is an intermediate correlation lying between entanglement and nonlocality.<n>SDP has proven to be a valuable tool to quantify quantum steering.<n>In this work, we utilize the semi-supervised self-training model to estimate the steerable weight.
  arXiv  Detail & Related papers  (2025-01-18T12:14:37Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• 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)
• Trainable Discrete Feature Embeddings for Variational Quantum Classifier [4.40450723619303]
  We show how to map discrete features with fewer quantum bits using Quantum Random Access Coding (QRAC) We propose a new method to embed discrete features with trainable quantum circuits by combining QRAC and a recently proposed strategy for training quantum feature map called quantum metric learning.
  arXiv  Detail & Related papers  (2021-06-17T12:02: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.