Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2603.17080

A quadratic Grassmann manifold optimization problem arising from quantum embedding methods

Thomas Ayral, Eric Cancès, Fabian M. Faulstich, Lin Lin, Alicia Negre

math.OCquant-phSubmitted Mar 17, 2026• Announced Mar 19, 2026• 0 citations
v1 · Mar 17, 2026v2 · Oct 20, 2026
arXivHTMLPDF

Abstract

This article presents a mathematical analysis and numerical strategies for solving the optimization problem of minimizing the quadratic function $J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)$, where $A,B \in \mathbb R^{M \times M}_{\rm sym}$, with $A \succeq 0$, over the Grassmann manifold ${\rm Gr}(m,\mathbb R^M)$. While this problem is non-convex and typically admits non-global local minima - posing challenges for Riemannian optimization and self-consistent field (SCF) algorithms - we identify cases where the global minimizer can be obtained by solving an auxiliary convex problem. When this approach is not directly applicable, the solution to the auxiliary problem still serves as an effective initialization for Riemannian optimization methods and SCF algorithms, significantly improving their performance. This work is motivated by applications in quantum embedding methods, particularly in the construction of bath orbitals, where such optimization problems naturally arise.

Related papers

Reviewing: Ayral et al. (2026) -"A quadratic Grassmann manifold optimization problem arising from quantum embedding methods" Reviewing: Ayral et al. (2026) -"A quadratic Grassmann manifold optimization problem arising from quantum embedding methods" 1

Syed Muntasir Mamun

Ayral et al. (2026) present the first comprehensive mathematical analysis and algorithmic framework for a non-convex quadratic optimization problem on the real Grassmann manifold (\operatorname{Gr}(m, \mathbb{R}^M)) that arises in generalized Density-Matrix Embedding Theory (DMET) for bath-orbital construction. The objective (J(P) = \operatorname{Tr}(BP) - \frac12 \operatorname{Tr}(APAP)) with (A \succeq 0) is shown to admit an Aufbau principle, first- and second-order optimality conditions, and a convex relaxation (\tilde{J}) over the spectrahedron whose gapped minimizer is Ayral, T., Cancès, E., Faulstich, F. M., Lin, L. and Negre, A. (2026) 'A quadratic Grassmann manifold optimization problem arising from quantum embedding methods', arXiv preprint arXiv:2603.17080v1 [math.OC]. 1 Mamun, SM (2026)…………………………………………1 Reviewing: Ayral et al. (2026) – "A quadratic Grassmann manifold optimization problem arising from quantum embedding methods" provably the global optimum of the original problem. Closed-form solutions are derived for commuting (A,B), perturbative regimes, and the DMET-specific block structure, yielding sharp necessary and sufficient conditions for full fragment-bath disentanglement that improve upon prior bounds. Also available on Academia.edu: https://www.academia.edu/attachments/132307859/download_file?s=portfolio

•Jan 1, 2026•0 citations

A Grover-compatible manifold optimization algorithm for quantum search

Zhijian Lai, Dong An, Jiang Hu +1 more

Grover's algorithm is a fundamental quantum algorithm that offers a quadratic speedup for the unstructured search problem by alternately applying physically implementable oracle and diffusion operators. In this paper, we reformulate the unstructured search as a maximization problem on the unitary manifold and solve it via the Riemannian gradient ascent (RGA) method. To overcome the difficulty that generic RGA updates do not, in general, correspond to physically implementable quantum operators, we introduce Grover-compatible retractions to restrict RGA updates to valid oracle and diffusion operators. Theoretically, we establish a local Riemannian $μ$-Polyak-Łojasiewicz (PL) inequality with $μ= \tfrac{1}{2}$, which yields a linear convergence rate of $1 - κ^{-1}$ toward the global solution. Here, the condition number $κ= L_{\mathrm{Rie}} / μ$, where $L_{\mathrm{Rie}}$ denotes the Riemannian Lipschitz constant of the gradient. Taking into account both the geometry of the unitary manifold and the special structure of the cost function, we show that $L_{\mathrm{Rie}} = O(\sqrt{N})$ for problem size $N = 2^n$. Consequently, the resulting iteration complexity is $O(\sqrt{N} \log(1/\varepsilon))$ for attaining an $\varepsilon$-accurate solution, which matches the quadratic speedup of $O(\sqrt{N})$ achieved by Grover's algorithm. These results demonstrate that an optimization-based viewpoint can offer fresh conceptual insights and lead to new advances in the design of quantum algorithms.

quant-pharXiv:2512.08432•Dec 10, 2025•6 citations

Riemannian gradient descent for Hartree-Fock theory

Evgueni Dinvay

We present a Riemannian optimization framework for Hartree-Fock theory formulated directly in the Sobolev space $H^1$. The orthonormality constraints are interpreted geometrically via infinite-dimensional Stiefel and Grassmann manifolds endowed with the embedded $H^1$ metric. Explicit expressions for Euclidean and Riemannian gradients, tangent-space projections, and retractions are derived using resolvent operators, avoiding distributional formulations. The resulting algorithms include Riemannian steepest descent and a preconditioned nonlinear conjugate gradient method equipped with Armijo backtracking and Powell-type restarts. Particular attention is given to physically motivated preconditioning based on inversion of the kinetic energy operator. The framework is naturally compatible with adaptive multiwavelet discretizations, where Coulomb-type convolutions can be evaluated efficiently. Numerical experiments demonstrate robust convergence and competitive performance compared to conventional SCF-DIIS schemes. In addition, for small molecules the gradient descent method converges from random initial guesses. The proposed formulation provides a geometrically consistent and discretization-independent perspective on electronic structure optimization and offers a foundation for further developments in infinite-dimensional Riemannian methods for quantum chemistry.

quant-pharXiv:2603.15870•Mar 18, 2026

Quantum Simulation on Riemannian Manifolds

Dylan Herman, Jacob Watkins, Guneykan Ozgul +4 more

We investigate algorithms for the quantum simulation of the Schrödinger equation on a Riemannian manifold, where the kinetic operator is defined by the Laplace--Beltrami operator corresponding to the metric. Our first algorithms are based on a global spectral method based on the identification of an efficient transform to the eigenbasis of the Laplace--Beltrami operator. We use this method to provide explicit, efficient, quantum simulation algorithms for the Riemannian Schrödinger equation on tori and spheres with their standard metrics, simplices with the Wright--Fisher metric, truncated positive orthants and their invertible affine images with the log-barrier Hessian metric, and $\ell_p$ balls with a metric induced by the Duffy map. Our second algorithm is based on a coherent simulation of local spectral methods on multiple charts, and is in principle applicable to any compact manifold. We first analyze this algorithm in the continuum and derive conditions under which a polynomial spectral cutoff suffices. We also provide a discretization analysis of a polynomial spectral cutoff for tensor-products of constant-dimensional manifolds. Finally, we consider applications of these methods to optimization and physical simulation. For optimization, we provide results including a generalization and convergence analysis of Quantum Hamiltonian Descent for geodesically convex functions that leads to explicit algorithms on the sphere and simplex, and a Riemannian generalization of the Real-Space Adiabatic Algorithm. For physical simulation, we show that our algorithms can simulate certain spatially discretized field theories, including a variant of the nonlinear sigma model.

quant-pharXiv:2610.03673•Oct 5, 2026•0 citations

Reviewing: Ayral et al. (2026) -"A Quadratic Grassmann Manifold Optimization Problem Arising from Quantum Embedding Methods"

Syed Muntasir Mamun

•Jan 1, 2026•0 citations

Riemannian optimization and automatic differentiation for complex quantum architectures

I. A. Luchnikov, Mikhail Krechetov, Sergey N. Filippov

Optimization methods on Riemannian manifolds are a powerful class of optimization methods that allow performing constrained optimization. We apply first-order Riemannian optimization methods to various problems of quantum physics including entanglement renormalization of local many-body Hamiltonians, quantum control, and quantum tomography. We show that the Riemannian optimization forms a new powerful numerical tool for solving different problems of quantum technologies. Besides, we provide a package written on top of TensorFlow for the Riemannian optimization in quantum physics

•Jul 2, 2020•12 citations
This article presents a mathematical analysis and numerical strategies for solving the optimization problem of minimizing the quadratic function J(P)=Tr(BP)−12Tr(APAP)J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)J(P)=Tr(BP)−21​Tr(APAP), where A,B∈RsymM×MA,B \in \mathbb R^{M \times M}_{\rm sym}A,B∈RsymM×M​, with A⪰0A \succeq 0A⪰0, over the Grassmann manifold Gr(m,RM){\rm Gr}(m,\mathbb R^M)Gr(m,RM). While this problem is non-convex and typically admits non-global local minima - posing challenges for Riemannian optimization and self-consistent field (SCF) algorithms - we identify cases where the global minimizer can be obtained by solving an auxiliary convex problem. When this approach is not directly applicable, the solution to the auxiliary problem still serves as an effective initialization for Riemannian optimization methods and SCF algorithms, significantly improving their performance. This work is motivated by applications in quantum embedding methods, particularly in the construction of bath orbitals, where such optimization problems naturally arise.
Ayral et al. (2026) present the first comprehensive mathematical analysis and algorithmic framework for a non-convex quadratic optimization problem on the real Grassmann manifold (\operatorname{Gr}(m, \mathbb{R}^M)) that arises in generalized Density-Matrix Embedding Theory (DMET) for bath-orbital construction. The objective (J(P) = \operatorname{Tr}(BP) - \frac12 \operatorname{Tr}(APAP)) with (A \succeq 0) is shown to admit an Aufbau principle, first- and second-order optimality conditions, and a convex relaxation (\tilde{J}) over the spectrahedron whose gapped minimizer is Ayral, T., Cancès, E., Faulstich, F. M., Lin, L. and Negre, A. (2026) 'A quadratic Grassmann manifold optimization problem arising from quantum embedding methods', arXiv preprint arXiv:2603.17080v1 [math.OC]. 1 Mamun, SM (2026)…………………………………………1 Reviewing: Ayral et al. (2026) – "A quadratic Grassmann manifold optimization problem arising from quantum embedding methods" provably the global optimum of the original problem. Closed-form solutions are derived for commuting (A,B), perturbative regimes, and the DMET-specific block structure, yielding sharp necessary and sufficient conditions for full fragment-bath disentanglement that improve upon prior bounds. Also available on Academia.edu: https://www.academia.edu/attachments/132307859/download_file?s=portfolio
Grover's algorithm is a fundamental quantum algorithm that offers a quadratic speedup for the unstructured search problem by alternately applying physically implementable oracle and diffusion operators. In this paper, we reformulate the unstructured search as a maximization problem on the unitary manifold and solve it via the Riemannian gradient ascent (RGA) method. To overcome the difficulty that generic RGA updates do not, in general, correspond to physically implementable quantum operators, we introduce Grover-compatible retractions to restrict RGA updates to valid oracle and diffusion operators. Theoretically, we establish a local Riemannian μμμ-Polyak-Łojasiewicz (PL) inequality with μ=12μ= \tfrac{1}{2}μ=21​, which yields a linear convergence rate of 1−κ−11 - κ^{-1}1−κ−1 toward the global solution. Here, the condition number κ=LRie/μκ= L_{\mathrm{Rie}} / μκ=LRie​/μ, where LRieL_{\mathrm{Rie}}LRie​ denotes the Riemannian Lipschitz constant of the gradient. Taking into account both the geometry of the unitary manifold and the special structure of the cost function, we show that LRie=O(N)L_{\mathrm{Rie}} = O(\sqrt{N})LRie​=O(N​) for problem size N=2nN = 2^nN=2n. Consequently, the resulting iteration complexity is O(Nlog⁡(1/ε))O(\sqrt{N} \log(1/\varepsilon))O(N​log(1/ε)) for attaining an ε\varepsilonε-accurate solution, which matches the quadratic speedup of O(N)O(\sqrt{N})O(N​) achieved by Grover's algorithm. These results demonstrate that an optimization-based viewpoint can offer fresh conceptual insights and lead to new advances in the design of quantum algorithms.
We present a Riemannian optimization framework for Hartree-Fock theory formulated directly in the Sobolev space H1H^1H1. The orthonormality constraints are interpreted geometrically via infinite-dimensional Stiefel and Grassmann manifolds endowed with the embedded H1H^1H1 metric. Explicit expressions for Euclidean and Riemannian gradients, tangent-space projections, and retractions are derived using resolvent operators, avoiding distributional formulations. The resulting algorithms include Riemannian steepest descent and a preconditioned nonlinear conjugate gradient method equipped with Armijo backtracking and Powell-type restarts. Particular attention is given to physically motivated preconditioning based on inversion of the kinetic energy operator. The framework is naturally compatible with adaptive multiwavelet discretizations, where Coulomb-type convolutions can be evaluated efficiently. Numerical experiments demonstrate robust convergence and competitive performance compared to conventional SCF-DIIS schemes. In addition, for small molecules the gradient descent method converges from random initial guesses. The proposed formulation provides a geometrically consistent and discretization-independent perspective on electronic structure optimization and offers a foundation for further developments in infinite-dimensional Riemannian methods for quantum chemistry.
We investigate algorithms for the quantum simulation of the Schrödinger equation on a Riemannian manifold, where the kinetic operator is defined by the Laplace--Beltrami operator corresponding to the metric. Our first algorithms are based on a global spectral method based on the identification of an efficient transform to the eigenbasis of the Laplace--Beltrami operator. We use this method to provide explicit, efficient, quantum simulation algorithms for the Riemannian Schrödinger equation on tori and spheres with their standard metrics, simplices with the Wright--Fisher metric, truncated positive orthants and their invertible affine images with the log-barrier Hessian metric, and ℓp\ell_pℓp​ balls with a metric induced by the Duffy map. Our second algorithm is based on a coherent simulation of local spectral methods on multiple charts, and is in principle applicable to any compact manifold. We first analyze this algorithm in the continuum and derive conditions under which a polynomial spectral cutoff suffices. We also provide a discretization analysis of a polynomial spectral cutoff for tensor-products of constant-dimensional manifolds. Finally, we consider applications of these methods to optimization and physical simulation. For optimization, we provide results including a generalization and convergence analysis of Quantum Hamiltonian Descent for geodesically convex functions that leads to explicit algorithms on the sphere and simplex, and a Riemannian generalization of the Real-Space Adiabatic Algorithm. For physical simulation, we show that our algorithms can simulate certain spatially discretized field theories, including a variant of the nonlinear sigma model.
Optimization methods on Riemannian manifolds are a powerful class of optimization methods that allow performing constrained optimization. We apply first-order Riemannian optimization methods to various problems of quantum physics including entanglement renormalization of local many-body Hamiltonians, quantum control, and quantum tomography. We show that the Riemannian optimization forms a new powerful numerical tool for solving different problems of quantum technologies. Besides, we provide a package written on top of TensorFlow for the Riemannian optimization in quantum physics