Efficient Quantum Measurements: Computational Max- and Measured Rényi Divergences and Applications

• URL: http://arxiv.org/abs/2509.21308v1
• Date: Thu, 25 Sep 2025 15:22:23 GMT
• Title: Efficient Quantum Measurements: Computational Max- and Measured Rényi Divergences and Applications
• Authors: Álvaro Yángüez, Thomas A. Hahn, Jan Kochanowski,
• Abstract summary: We study two new types of computational divergences, which we term computational max-divergence and computational measured R'enyi divergences.<n>We prove that, in the infinite-order limit, the computational measured R'enyi divergence coincides with the computational max-divergence.<n>For the many-copy regime, we introduce regularized versions and establish a one-sided computational Stein bound on achievable hypothesis-testing exponents.<n>We further define resource measures induced by our computational divergences and prove an continuity bound for the computational measured relative entropy of resource.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum information processing is limited, in practice, to efficiently implementable operations. This motivates the study of quantum divergences that preserve their operational meaning while faithfully capturing these computational constraints. Using geometric, computational, and information theoretic tools, we define two new types of computational divergences, which we term computational max-divergence and computational measured R\'enyi divergences. Both are constrained by a family of efficient binary measurements, and thus useful for state discrimination tasks in the computational setting. We prove that, in the infinite-order limit, the computational measured R\'enyi divergence coincides with the computational max-divergence, mirroring the corresponding relation in the unconstrained information-theoretic setting. For the many-copy regime, we introduce regularized versions and establish a one-sided computational Stein bound on achievable hypothesis-testing exponents under efficient measurements, giving the regularized computational measured relative entropy an operational meaning. We further define resource measures induced by our computational divergences and prove an asymptotic continuity bound for the computational measured relative entropy of resource. Focusing on entanglement, we relate our results to previously proposed computational entanglement measures and provide explicit separations from the information-theoretic setting. Together, these results provide a principled, cohesive approach towards state discrimination tasks and resource quantification under computational constraints.

Related papers

• Computational Relative Entropy [0.29555437538581053]
  We go beyond the prevailing single-shot approach and take a new direction in computational quantum information theory.<n>We define the computational relative entropy as the optimal error exponent in asymmetric hypothesis testing.<n>We derive a computational entropy that operationally characterizes optimal compression rates for quantum states under computational limitations.
  arXiv  Detail & Related papers  (2025-09-24T18:41:05Z)
• Locally Purified Maximally Mixed States At Scale: Entanglement Pruning and Symmetries [0.0]
  Localized Purified Density Operators represent mixed quantum states at scale.<n>Given their non-uniqueness, their representational complexity is generally sub-optimal in practical computations.<n>We show how, by minimizing the resources required to represent key states of practical interest, the efficiency of tensor network algorithms can be substantially increased.
  arXiv  Detail & Related papers  (2025-09-19T21:38:29Z)
• Quantum Arithmetic Algorithms: Implementation, Resource Estimation, and Comparison [0.0]
  This paper presents the implementation and resource estimation of a library of quantum arithmetic algorithms.<n>We evaluate runtime, qubit usage, and space-time trade-offs and identify the best-performing algorithm for each arithmetic operation.
  arXiv  Detail & Related papers  (2025-09-06T21:30:01Z)
• An efficient finite-resource formulation of non-Abelian lattice gauge theories beyond one dimension [0.0]
  We propose a resource-efficient method to compute the running of the coupling in non-Abelian gauge theories beyond one spatial dimension. Our method enables computations at arbitrary values of the bare coupling and lattice spacing with current quantum computers, simulators and tensor-network calculations.
  arXiv  Detail & Related papers  (2024-09-06T17:59:24Z)
• Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE [68.6018458996143]
  We propose a more general dynamic network that can combine both quantization and early exit dynamic network: QuEE. Our algorithm can be seen as a form of soft early exiting or input-dependent compression. The crucial factor of our approach is accurate prediction of the potential accuracy improvement achievable through further computation.
  arXiv  Detail & Related papers  (2024-06-20T15:25:13Z)
• Computational Entanglement Theory [11.694169299062597]
  computational entanglement theory is inspired by the emerging usefulness of ideas from quantum information theory in computational complexity. We show that the computational measures are fundamentally different from their information-theoretic counterparts by presenting gaps between them. We discuss the relations between computational entanglement theory and other topics, such as quantum cryptography and notions of pseudoentropy.
  arXiv  Detail & Related papers  (2023-10-04T12:53:04Z)
• Randomized Polar Codes for Anytime Distributed Machine Learning [66.46612460837147]
  We present a novel distributed computing framework that is robust to slow compute nodes, and is capable of both approximate and exact computation of linear operations. We propose a sequential decoding algorithm designed to handle real valued data while maintaining low computational complexity for recovery. We demonstrate the potential applications of this framework in various contexts, such as large-scale matrix multiplication and black-box optimization.
  arXiv  Detail & Related papers  (2023-09-01T18:02:04Z)
• Efficient Computation of Counterfactual Bounds [44.4263314637532]
  We compute exact counterfactual bounds via algorithms for credal nets on a subclass of structural causal models. We evaluate their accuracy by providing credible intervals on the quality of the approximation.
  arXiv  Detail & Related papers  (2023-07-17T07:59:47Z)
• Multivariate Systemic Risk Measures and Computation by Deep Learning Algorithms [63.03966552670014]
  We discuss the key related theoretical aspects, with a particular focus on the fairness properties of primal optima and associated risk allocations. The algorithms we provide allow for learning primals, optima for the dual representation and corresponding fair risk allocations.
  arXiv  Detail & Related papers  (2023-02-02T22:16:49Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.