Quantum Fisher information matrices from Rényi relative entropies

• URL: http://arxiv.org/abs/2510.02218v2
• Date: Sun, 05 Oct 2025 18:35:10 GMT
• Title: Quantum Fisher information matrices from Rényi relative entropies
• Authors: Mark M. Wilde,
• Abstract summary: Quantum generalizations of the Fisher information are important in quantum information science.<n>I derive information matrices arising from the log-Euclidean, $alpha$-$z$, and geometric R'enyi relative entropies.<n>I establish formulas for their $alpha$-$z$ information matrices and hybrid quantum-classical algorithms for estimating them.
• Score: 13.706331473063882
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum generalizations of the Fisher information are important in quantum information science, with applications in high energy and condensed matter physics and in quantum estimation theory, machine learning, and optimization. One can derive a quantum generalization of the Fisher information matrix in a natural way as the Hessian matrix arising in a Taylor expansion of a smooth divergence. Such an approach is appealing for quantum information theorists, given the ubiquity of divergences in quantum information theory. In contrast to the classical case, there is not a unique quantum generalization of the Fisher information matrix, similar to how there is not a unique quantum generalization of the relative entropy or the R\'enyi relative entropy. In this paper, I derive information matrices arising from the log-Euclidean, $\alpha$-$z$, and geometric R\'enyi relative entropies, with the main technical tool for doing so being the method of divided differences for calculating matrix derivatives. Interestingly, for all non-negative values of the R\'enyi parameter $\alpha$, the log-Euclidean R\'enyi relative entropy leads to the Kubo-Mori information matrix, and the geometric R\'enyi relative entropy leads to the right-logarithmic derivative Fisher information matrix. Thus, the resulting information matrices obey the data-processing inequality for all non-negative values of the R\'enyi parameter $\alpha$ even though the original quantities do not. Additionally, I derive and establish basic properties of $\alpha$-$z$ information matrices resulting from the $\alpha$-$z$ R\'enyi relative entropies. For parameterized thermal states and time-evolved states, I establish formulas for their $\alpha$-$z$ information matrices and hybrid quantum-classical algorithms for estimating them, with applications in quantum Boltzmann machine learning.

Related papers

• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Efficient Calculation of the Maximal Rényi Divergence for a Matrix Product State via Generalized Eigenvalue Density Matrix Renormalization Group [0.0]
  In quantum information theory, the quantum mutual information, $I(A;B)$, is a measure of correlation between the subsystems $A,B$ in a quantum state.<n>We show that the maximal Rényi divergence may exhibit different trends than the von Neumann mutual information.
  arXiv  Detail & Related papers  (2026-01-05T13:54:16Z)
• Quantum Fisher information matrix via its classical counterpart from random measurements [5.726854405157353]
  Preconditioning with the quantum Fisher information matrix (QFIM) is a popular approach in quantum variational algorithms.<n>We rigorously prove that averaging the classical Fisher information matrix over Haar-random measurement bases yields $mathbbE_Usimmu_H[FU(boldsymboltheta)] = frac12Q(boldsymboltheta)$ for pure states in $mathbbCN$.
  arXiv  Detail & Related papers  (2025-09-10T00:00:02Z)
• Assessing Quantum Advantage for Gaussian Process Regression [7.10052009802944]
  We show that several quantum algorithms proposed for Gaussian Process Regression show no exponential speedup.<n>The implications for the quantum runtime algorithms are independent of the complexity of loading classical data on a quantum computer.<n>We supplement our theoretical analysis with numerical verification for popular kernels in machine learning.
  arXiv  Detail & Related papers  (2025-05-28T15:50:56Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• Quantum Eigensolver for Non-Normal Matrices via Ground State Energy Estimation [0.4511923587827302]
  Large-scale eigenvalue problems pose a significant challenge to classical computers.<n>We propose a quantum algorithm that outputs an estimate of an eigenvalue to within additive error $epsilon$ with probability at least $1-p_rm fail$.<n>Our algorithm is the first general eigenvalue algorithm that achieves this scaling.
  arXiv  Detail & Related papers  (2025-02-25T11:43:47Z)
• Random Matrix Theory Approach to Quantum Fisher Information in Quantum Many-Body Systems [0.0]
  We theoretically investigate parameter quantum estimation in quantum chaotic systems. Our analysis is based on an effective description of non-integrable quantum systems in terms of a random matrix Hamiltonian.
  arXiv  Detail & Related papers  (2024-02-14T09:07:25Z)
• Quantum algorithms for calculating determinant and inverse of matrix and solving linear algebraic systems [43.53835128052666]
  We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)times (N-1)$ matrix.<n>The basic idea is to encode each row of the matrix into a pure state of some quantum system.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• A Quantum Computer Amenable Sparse Matrix Equation Solver [0.0]
  We study problems involving the solution of matrix equations, for which there currently exists no efficient, general quantum procedure. We develop a generalization of the Harrow/Hassidim/Lloyd algorithm by providing an alternative unitary for eigenphase estimation. This unitary has the advantage of being well defined for any arbitrary matrix equation, thereby allowing the solution procedure to be directly implemented on quantum hardware.
  arXiv  Detail & Related papers  (2021-12-05T15:42:32Z)

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.