Efficient Calculation of the Maximal Rényi Divergence for a Matrix Product State via Generalized Eigenvalue Density Matrix Renormalization Group
- URL: http://arxiv.org/abs/2601.02122v1
- Date: Mon, 05 Jan 2026 13:54:16 GMT
- Title: Efficient Calculation of the Maximal Rényi Divergence for a Matrix Product State via Generalized Eigenvalue Density Matrix Renormalization Group
- Authors: Uri Levin, Noa Feldman, Moshe Goldstein,
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The study of quantum and classical correlations between subsystems is fundamental to understanding many-body physics. 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, and is defined by the means of the von Neumann entropy: $I\left(A;B\right)=S\left(ρ_{A}\right)+S\left(ρ_{B}\right)-S\left(ρ_{AB}\right)$. However, such a computation requires an exponential amount of resources. This is a defining feature of quantum systems, the infamous ``curse of dimensionality'' . Other measures, which are based on Rényi divergences instead of von Neumann entropy, were suggested as alternatives in a recent paper showing them to possess important theoretical features, and making them leading candidates as mutual information measures. In this work, we concentrate on the maximal Rényi divergence. This measure can be shown to be the solution of a generalized eigenvalue problem. To calculate it efficiently for a 1D state represented as a matrix product state, we develop a generalized eigenvalue version of the density matrix renormalization group algorithm. We benchmark our method for the paradigmatic XXZ chain, and show that the maximal Rényi divergence may exhibit different trends than the von Neumann mutual information.
Related papers
- Transmutation based Quantum Simulation for Non-unitary Dynamics [35.35971148847751]
We present a quantum algorithm for simulating dissipative diffusion dynamics generated by positive semidefinite operators of the form $A=Ldagger L$.<n>Our main tool is the Kannai transform, which represents the diffusion semigroup $e-TA$ as a Gaussian-weighted superposition of unitary wave propagators.
arXiv Detail & Related papers (2026-01-07T05:47:22Z) - Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
arXiv Detail & Related papers (2025-11-24T16:36:06Z) - Quantum Fisher information matrices from Rényi relative entropies [13.706331473063882]
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.
arXiv Detail & Related papers (2025-10-02T17:02:48Z) - Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation [0.0]
Estimating excited-state energies is challenging for classical algorithms due to exponential scaling with system size.<n>We present a quantum algorithm for estimating eigenvalues and singular values of parameterized matrix families.
arXiv Detail & Related papers (2025-06-16T14:24:30Z) - 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) - Susceptibility of entanglement entropy: a universal indicator of quantum criticality [11.049672162852735]
A measure of how sensitive the entanglement entropy is in a quantum system, has been proposed and its information origin is discussed.<n>It has been demonstrated for two exactly solvable spin systems, that thermodynamic criticality is directly textitindicated by finite size scaling of the global maxima.
arXiv Detail & Related papers (2024-12-03T08:04:58Z) - Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states.<n>It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems.<n>The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
arXiv Detail & Related papers (2024-08-02T10:15:26Z) - Solving the homogeneous Bethe-Salpeter equation with a quantum annealer [34.173566188833156]
The homogeneous Bethe-Salpeter equation (hBSE) was solved for the first time by using a D-Wave quantum annealer.
A broad numerical analysis of the proposed algorithms was carried out using both the proprietary simulated-anneaing package and the D-Wave Advantage 4.1 system.
arXiv Detail & Related papers (2024-06-26T18:12:53Z) - Quantum simulation of dissipation for Maxwell equations in dispersive media [0.0]
dissipation appears in the Schr"odinger representation of classical Maxwell equations as a sparse diagonal operator occupying an $r$-dimensional subspace.
The unitary operators can be implemented through qubit lattice algorithm (QLA) on $n$ qubits.
The non-unitary-dissipative part poses a challenge on how it should be implemented on a quantum computer.
arXiv Detail & Related papers (2023-07-31T18:22:40Z) - 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) - Correspondence between open bosonic systems and stochastic differential
equations [77.34726150561087]
We show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment.
A particular system with the form of a discrete nonlinear Schr"odinger equation is analyzed in more detail.
arXiv Detail & Related papers (2023-02-03T19:17:37Z) - Spectral Analysis of Product Formulas for Quantum Simulation [0.0]
We show that the Trotter step size needed to estimate an energy eigenvalue within precision can be improved in scaling from $epsilon$ to $epsilon1/2$ for a large class of systems.
Results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap.
arXiv Detail & Related papers (2021-02-25T03:17:25Z) - Learning with Density Matrices and Random Features [44.98964870180375]
A density matrix describes the statistical state of a quantum system.
It is a powerful formalism to represent both the quantum and classical uncertainty of quantum systems.
This paper explores how density matrices can be used as a building block for machine learning models.
arXiv Detail & Related papers (2021-02-08T17:54:59Z)
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.