Solving a Nonlinear Eigenvalue Equation in Quantum Information Theory: A Hybrid Approach to Entanglement Quantification

• URL: http://arxiv.org/abs/2511.11300v1
• Date: Fri, 14 Nov 2025 13:36:47 GMT
• Title: Solving a Nonlinear Eigenvalue Equation in Quantum Information Theory: A Hybrid Approach to Entanglement Quantification
• Authors: Abrar Ahmed Naqash, Fardeen Ahmad Sofi, Mohammad Haris Khan, Sundus Abdi,
• Abstract summary: We present a hybrid analytical and numerical framework for evaluating the geometric measure of entanglement.<n>We make the coupled nonlinear eigenstructure explicit by proving the equal multiplier stationarity.<n>The resulting hybrid solver reproduces the exact optimum for standard three qubit benchmarks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Nonlinear eigenvalue equations arise naturally in quantum information theory, particularly in the variational quantification of entanglement. In this work, we present a hybrid analytical and numerical framework for evaluating the geometric measure of entanglement. The method combines a Gauss Seidel fixed point iteration with a controlled perturbative correction scheme. We make the coupled nonlinear eigenstructure explicit by proving the equal multiplier stationarity identity, which states that at the optimum all block Lagrange multipliers coincide with the squared fidelity between the target state and its closest separable approximation. A normalization-preserving linearization is then derived by projecting the dynamics onto the local tangent spaces, yielding a well-defined first order correction and an explicit scalar shift in the eigenvalue. Furthermore, we establish a monotonic block ascent property the squared overlap between the evolving product state and the target state increases at every iteration, remains bounded by unity, and converges to a stationary value. The resulting hybrid solver reproduces the exact optimum for standard three qubit benchmarks, obtaining squared-overlap values of one-half for the Greenberger Horne Zeilinger (GHZ\(_3\)) state and four-ninths for the W\(_3\) state, with smooth monotonic convergence.

Related papers

• Spectral statistics and localization properties of a $C_3$-symmetric billiard [0.0]
  We revisit the spectral statistics of the C$_3$--symmetric billiard introduced by Dembowski.<n>We compute 2.8x10$5$ eigenvalues in each symmetry subspace, enabling statistically meaningful comparisons with random matrix theory.<n>The improved spectra reveal clear GOE--GUE correspondence and resolve previously observed deviations in long--range spectral correlations.
  arXiv  Detail & Related papers  (2026-03-03T19:16:28Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Graph-based Clustering Revisited: A Relaxation of Kernel $k$-Means Perspective [73.18641268511318]
  We propose a graph-based clustering algorithm that only relaxes the orthonormal constraint to derive clustering results.<n>To ensure a doubly constraint into a gradient, we transform the non-negative constraint into a class probability parameter.
  arXiv  Detail & Related papers  (2025-09-23T09:14:39Z)
• Generalized Gradient Norm Clipping & Non-Euclidean $(L_0,L_1)$-Smoothness [51.302674884611335]
  This work introduces a hybrid non-Euclidean optimization method which generalizes norm clipping by combining steepest descent and conditional gradient approaches.<n>We discuss how to instantiate the algorithms for deep learning and demonstrate their properties on image classification and language modeling.
  arXiv  Detail & Related papers  (2025-06-02T17:34:29Z)
• Zassenhaus Expansion in Solving the Schrödinger Equation [0.0]
  A fundamental challenge lies in approximating the unitary evolution operator ( e-imathcalHt ) where ( mathcalH ) is a large, typically non-commuting, Hermitian operator.<n>We present a refinement of the fixed-depth simulation framework introduced by E. K"okc"u et al, incorporating the second-order Zassenhaus expansion.<n>This yields a controlled, non-unitary approximation with error scaling as ( mathcalO(t
  arXiv  Detail & Related papers  (2025-05-14T14:48:47Z)
• Critical behavior of the Schwinger model via gauge-invariant VUMPS [0.0]
  We study the lattice Schwinger model by combining the variational uniform matrix product state (VUMPS) algorithm with a gauge-invariant matrix product ansatz.<n>We analyze the scaling in the simultaneous critical and limits continuum and confirm that the data collapse aligns with the Ising class to remarkable precision.
  arXiv  Detail & Related papers  (2024-12-04T18:59:18Z)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation [71.27989298860481]
  We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function. We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
  arXiv  Detail & Related papers  (2021-09-30T19:17:35Z)
• On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging [96.13485146617322]
  We present an analysis of the ExtraGradient (SEG) method with constant step size, and present variations of the method that yield favorable convergence. We prove that when augmented with averaging, SEG provably converges to the Nash equilibrium, and such a rate is provably accelerated by incorporating a scheduled restarting procedure.
  arXiv  Detail & Related papers  (2021-06-30T17:51:36Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via Non-Lipschitz Matrix Concentration [12.989855325491163]
  We consider the problem of recovering a real-valued $n$-dimensional signal from $m$ phaseless, linear measurements. We establish local convergence of subgradient descent with optimal sample complexity based on the uniform concentration of a random, discontinuous matrix-valued operator.
  arXiv  Detail & Related papers  (2020-10-31T15:03:30Z)

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.