A Grover-compatible manifold optimization algorithm for quantum search

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lai, Zhijian, An, Dong, Hu, Jiang, Wen, Zaiwen
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Optimization and Control 81P68, 90C26, 65K10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search
by: Lai, Zhijian, et al.
Published: (2026)

Quantum circuit design from a retraction-based Riemannian optimization framework
by: Lai, Zhijian, et al.
Published: (2026)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Advancing Mathematical Research via Human-AI Interactive Theorem Proving
by: Li, Chenyi, et al.
Published: (2025)

Inexact FPPA for the $\ell_0$ Sparse Regularization Problem
by: Fang, Ronglong, et al.
Published: (2024)

Curve fitting on a quantum annealer for an advanced navigation method
by: Isserstedt, Philipp, et al.
Published: (2024)

A preconditioned inexact infeasible quantum interior point method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

Error Bound Analysis for the Regularized Loss of Deep Linear Neural Networks
by: Chen, Po, et al.
Published: (2025)

Implicit augmented Lagrangian and generalized optimization
by: De Marchi, Alberto
Published: (2023)

Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies
by: Roith, Tim, et al.
Published: (2025)

On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
by: Gfrerer, Helmut, et al.
Published: (2024)

General Constrained Matrix Optimization
by: Garner, Casey, et al.
Published: (2024)

Spectrally Constrained Optimization
by: Garner, Casey, et al.
Published: (2023)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
by: Millán, R. Díaz, et al.
Published: (2026)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
by: László, Szilárd Csaba
Published: (2025)

Stiefel optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2025)

Accelerated Natural Gradient Method for Parametric Manifold Optimization
by: Li, Chenyi, et al.
Published: (2025)

A quantum dual logarithmic barrier method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

On the role of semismoothness in nonsmooth numerical analysis: Theory
by: Gfrerer, H., et al.
Published: (2024)

A Representation Optimization Dichotomy, Lie-Algebraic Policy Optimization
by: KC, Sooraj, et al.
Published: (2026)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
by: Selicato, Laura, et al.
Published: (2025)

An Augmented Lagrangian Method for Training Recurrent Neural Networks
by: Wang, Yue, et al.
Published: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Preconditioned subgradient method for composite optimization: overparameterization and fast convergence
by: Díaz, Mateo, et al.
Published: (2025)

An Extended ADMM for 3-Block Nonconvex Nonseparable Problems with Applications
by: Liu, Zekun
Published: (2024)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

Proximal Algorithms for a class of abstract convex functions
by: Bednarczuk, Ewa, et al.
Published: (2024)

A double iteratively reweighted algorithm for solving group sparse nonconvex optimization models
by: Nie, Wanqin, et al.
Published: (2025)

Convergence of Descent Optimization Algorithms under Polyak-Łojasiewicz-Kurdyka Conditions
by: Bento, G. C., et al.
Published: (2024)

On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
by: Song, Mengmeng, et al.
Published: (2024)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
by: Jung, Woosuk L., et al.
Published: (2023)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
by: Dahl, Simeon vom, et al.
Published: (2026)

Adaptive Preconditioned Gradient Descent with Energy
by: Liu, Hailiang, et al.
Published: (2023)