Copertina

From quantum to quantum-inspired: the LogQ algorithm as a non-linear continuous relaxation of variables method

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Messud, Jérémie, Chatterjee, Yagnik
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Towards solving large QUBO problems using quantum algorithms: improving the LogQ scheme
di: Chatterjee, Yagnik, et al.
Pubblicazione: (2025)

Portfolio Optimization with 'Physical' Decision Variables and Non-Linear Performance Metrics: Diversification Challenge and Proposals
di: Garcia, Isabel Barros, et al.
Pubblicazione: (2026)

A novel trajectory optimization algorithm for continuous-time model predictive control
di: Das, Souvik, et al.
Pubblicazione: (2023)

An adaptive linearized alternating direction multiplier method with a relaxation step for convex programming
di: Wang, Boran
Pubblicazione: (2024)

Exact continuous relaxations of l0-regularized criteria with non-quadratic data terms
di: Essafri, M'hamed, et al.
Pubblicazione: (2024)

On moment relaxations for linear state feedback controller synthesis with non-convex quadratic costs and constraints
di: Gramlich, Dennis, et al.
Pubblicazione: (2024)

On the controllability in projections for linear quantum systems
di: Chambrion, Thomas, et al.
Pubblicazione: (2024)

A comparison on constrain encoding methods for quantum approximate optimization algorithm
di: Liu, Yiwen, et al.
Pubblicazione: (2024)

Instance-specific linear relaxations of semidefinite optimization problems
di: de Roux, Daniel, et al.
Pubblicazione: (2023)

Universe-inspired algorithms for Control Engineering: A review
di: Bernardo, Rodrigo M. C., et al.
Pubblicazione: (2024)

A quantum central path algorithm for linear optimization
di: Augustino, Brandon, et al.
Pubblicazione: (2023)

An inexact variable metric proximal linearization method for composite optimization on manifolds
di: He, Hao, et al.
Pubblicazione: (2025)

Optimal triangulations for piecewise linear approximations of non-convex variable products
di: Burlacu, Robert, et al.
Pubblicazione: (2026)

The non-linear multiple stopping problem: between the discrete and the continuous time
di: Grigorova, Miryana, et al.
Pubblicazione: (2025)

Scholtes relaxation method for pessimistic bilevel optimization
di: Benchouk, Imane, et al.
Pubblicazione: (2021)

A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
di: Pacheco, Bruno Machado, et al.
Pubblicazione: (2025)

Extending quantum annealing to continuous domains: a hybrid method for quadratic programming
di: Djidjev, Hristo N.
Pubblicazione: (2025)

Extended-variable relaxations for the constrained generalized maximum-entropy sampling problem
di: Ponte, Gabriel, et al.
Pubblicazione: (2026)

A relaxation method for binary optimizations on constrained Stiefel manifold
di: Xiao, Lianghai, et al.
Pubblicazione: (2023)

A relaxed proximal point algorithm with double-inertial effects for nonconvex equilibrium problems
di: Van Tran, Nam
Pubblicazione: (2025)

Robustness of quantum algorithms against coherent control errors
di: Berberich, Julian, et al.
Pubblicazione: (2023)

Weak and strong convergence of a relaxed inertial proximal splitting algorithm for solving hierarchical equilibrium problems
di: Mazgouri, Zakaria, et al.
Pubblicazione: (2025)

Strategies for optimizing double-bracket quantum algorithms
di: Xiaoyue, Li, et al.
Pubblicazione: (2024)

An energy optimization method based on mixed-integer model and variational quantum computing algorithm for faster IMPT
di: Zhu, Ya-Nan, et al.
Pubblicazione: (2025)

Finite convergence of Moment-SOS relaxations with non-real radical ideals
di: Huang, Lei, et al.
Pubblicazione: (2023)

On the tightness of linear relaxations of alternative mixed integer programming formulations for the generator maintenance scheduling problem
di: Andrade, Tiago
Pubblicazione: (2025)

Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems
di: Wang, Shida, et al.
Pubblicazione: (2024)

An introduction to variational quantum algorithms for combinatorial optimization problems
di: Grange, Camille, et al.
Pubblicazione: (2022)

Symmetrizing quantum dynamics beyond gossip-type algorithms
di: Ticozzi, Francesco
Pubblicazione: (2015)

Robustness of quantum algorithms: Worst-case fidelity bounds and implications for design
di: Berberich, Julian, et al.
Pubblicazione: (2025)

Exploring the non-convexity in machine learning using quantum-inspired optimization
di: Kumar, Kandula Eswara Sai, et al.
Pubblicazione: (2026)

Measurement incompatibility and quantum steering via linear programming
di: Porto, Lucas E. A., et al.
Pubblicazione: (2025)

On the facet pivot simplex method for linear programming II: a linear iteration bound
di: Yang, Yaguang
Pubblicazione: (2022)

A least-square method for non-asymptotic identification in linear switching control
di: Sun, Haoyuan, et al.
Pubblicazione: (2024)

New Lagrangian dual algorithms for solving the continuous nonlinear resource allocation problem
di: Hu, Kaixiang, et al.
Pubblicazione: (2024)

Outer-space branch-and-bound algorithm for generalized linear multiplicative programs
di: Zhang, Bo
Pubblicazione: (2023)

Constraint-preserving quantum algorithm for the multi-frequency antenna placement problem
di: Vandelli, Matteo, et al.
Pubblicazione: (2025)

Solving QUBOs with a quantum-amenable branch and bound method
di: Häner, Thomas, et al.
Pubblicazione: (2024)

Utilization of noise for the control of a class of non-linear systems
di: Stoica, Adrian-Mihail, et al.
Pubblicazione: (2025)

Gate generation for open quantum systems via a monotonic algorithm with time optimization
di: da Silva, Paulo Sergio Pereira, et al.
Pubblicazione: (2024)