An Efficient Alternating Minimization Algorithm for Computing Quantum Rate-Distortion Function

• URL: http://arxiv.org/abs/2507.19920v1
• Date: Sat, 26 Jul 2025 11:55:31 GMT
• Title: An Efficient Alternating Minimization Algorithm for Computing Quantum Rate-Distortion Function
• Authors: Lingyi Chen, Deheng Yuan, Wenyi Zhang, Hao Wu, Huihui Wu,
• Abstract summary: entanglement-assisted quantum rate-distortion function plays a central role in quantum information theory.<n>We propose an efficient alternating algorithm based on the Lagrangian analysis.
• Score: 10.62682193912357
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the computation of the entanglement-assisted quantum rate-distortion function, which plays a central role in quantum information theory. We propose an efficient alternating minimization algorithm based on the Lagrangian analysis. Instead of fixing the multiplier corresponding to the distortion constraint, we update the multiplier in each iteration. Hence the algorithm solves the original problem itself, rather than the Lagrangian relaxation of it. Moreover, all the other variables are iterated in closed form without solving multi-dimensional nonlinear equations or multivariate optimization problems. Numerical experiments show the accuracy of our proposed algorithm and its improved efficiency over existing methods.

Related papers

• A Robust Algorithm for Non-IID Machine Learning Problems with Convergence Analysis [2.4462606119036456]
  We propose an improved numerical algorithm for solving minimax problems based on nonsmooth optimization, quadratic programming and iterative process.<n>Such an algorithm can be widely applied in various fields such as robust optimization, imbalanced learning, etc.
  arXiv  Detail & Related papers  (2025-07-01T14:41:59Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Analysis of the Non-variational Quantum Walk-based Optimisation Algorithm [0.0]
  This paper introduces in detail a non-variational quantum algorithm designed to solve a wide range of optimisation problems. The algorithm returns optimal and near-optimal solutions from repeated preparation and measurement of an amplified state.
  arXiv  Detail & Related papers  (2024-07-29T13:54:28Z)
• Stochastic Optimization for Non-convex Problem with Inexact Hessian Matrix, Gradient, and Function [99.31457740916815]
  Trust-region (TR) and adaptive regularization using cubics have proven to have some very appealing theoretical properties. We show that TR and ARC methods can simultaneously provide inexact computations of the Hessian, gradient, and function values.
  arXiv  Detail & Related papers  (2023-10-18T10:29:58Z)
• Efficient Computation of the Quantum Rate-Distortion Function [6.281229317487581]
  We show how symmetry reduction can significantly simplify common instances of the entanglement-assisted quantum rate-distortion problems. We propose an inexact variant of the mirror descent algorithm to compute the quantum rate-distortion function with provable sublinear convergence rates.
  arXiv  Detail & Related papers  (2023-09-28T00:46:53Z)
• Efficient Quantum Algorithms for Quantum Optimal Control [2.9370710299422607]
  We present efficient quantum algorithms for solving the quantum optimal control problem. Our algorithms are based on a time-dependent Hamiltonian simulation method and a fast gradient-estimation algorithm. Our quantum algorithms require fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2023-04-05T17:33:57Z)
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm [52.77024349608834]
  We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
  arXiv  Detail & Related papers  (2022-05-11T14:29:39Z)
• Bregman divergence based em algorithm and its application to classical and quantum rate distortion theory [61.12008553173672]
  We address the minimization problem of the Bregman divergence between an exponential subfamily and a mixture subfamily in a Bregman divergence system. We apply this algorithm to rate distortion and its variants including the quantum setting.
  arXiv  Detail & Related papers  (2022-01-07T13:33:28Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Mean Field Approximation for solving QUBO problems [0.0]
  We show that the statistical physics approach and the quantum mechanical approach in the mean field annealing give the same result. Our methods consist of a set of simple gradient-based minimizations with continuous variables, thus easy to simulate.
  arXiv  Detail & Related papers  (2021-06-06T20:35:28Z)
• Aligning Partially Overlapping Point Sets: an Inner Approximation Algorithm [80.15123031136564]
  We propose a robust method to align point sets where there is no prior information about the value of the transformation. Our algorithm does not need regularization on transformation, and thus can handle the situation where there is no prior information about the values of the transformations. Experimental results demonstrate the better robustness of the proposed method over state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2020-07-05T15:23:33Z)

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.