Imagen de Portada

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Hao, Zhang, Chenyi, Li, Tongyang
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
por: Zhang, Yexin, et al.
Publicado: (2024)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
por: Li, Tongyang, et al.
Publicado: (2024)

Quantum speedups for stochastic optimization
por: Sidford, Aaron, et al.
Publicado: (2023)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
por: Su, Yuexin, et al.
Publicado: (2025)

Quantum Langevin Dynamics for Optimization
por: Chen, Zherui, et al.
Publicado: (2023)

Quantum Optimization Algorithms in Operations Research: Methods, Applications, and Implications
por: Klug, Florian
Publicado: (2023)

Gradient Testing and Estimation by Comparisons
por: Tao, Xiwen, et al.
Publicado: (2024)

Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
por: Chakrabarti, Shouvanik, et al.
Publicado: (2024)

Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models
por: Vijendran, V, et al.
Publicado: (2025)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
por: Hunkenschröder, Christoph, et al.
Publicado: (2025)

On Speedups for Convex Optimization via Quantum Dynamics
por: Chakrabarti, Shouvanik, et al.
Publicado: (2025)

Gibbs Sampling of Continuous Potentials on a Quantum Computer
por: Motamedi, Arsalan, et al.
Publicado: (2022)

Quantum Speedups for Group Relaxations of Integer Linear Programs
por: Augustino, Brandon, et al.
Publicado: (2026)

Quantum speedups for linear programming via interior point methods
por: Apers, Simon, et al.
Publicado: (2023)

Isotropic Noise in Stochastic and Quantum Convex Optimization
por: Marsden, Annie, et al.
Publicado: (2025)

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
por: Kim, Junhyung Lyle, et al.
Publicado: (2024)

Near-Optimal Sample Complexity for MDPs via Anchoring
por: Lee, Jongmin, et al.
Publicado: (2025)

Expanding the reach of quantum optimization with fermionic embeddings
por: Zhao, Andrew, et al.
Publicado: (2023)

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

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
por: Goh, Mark, et al.
Publicado: (2026)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
por: Adil, Deeksha, et al.
Publicado: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
por: Blankenburg, Daniel, et al.
Publicado: (2025)

Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
por: Herman, Dylan, et al.
Publicado: (2025)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
por: Segev, Danny
Publicado: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
por: Chen, Yike, et al.
Publicado: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
por: Xie, Fangzhou
Publicado: (2025)

Approximate Message Passing for Quantum State Tomography
por: Siekierski, Noah, et al.
Publicado: (2025)

Quantum EigenGame for excited state calculation
por: Quiroga, David, et al.
Publicado: (2025)

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
por: Chakraborty, Shantanav, et al.
Publicado: (2025)

Classical and Quantum Heuristics for the Binary Paint Shop Problem
por: Vijendran, V, et al.
Publicado: (2025)

A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
por: Wang, Xinzhao, et al.
Publicado: (2022)

Sparse Submodular Function Minimization
por: Graur, Andrei, et al.
Publicado: (2023)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
por: Zhang, Qiao, et al.
Publicado: (2024)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
por: Bhandari, Swastik
Publicado: (2025)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
por: Chen, Shengminjie, et al.
Publicado: (2023)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
por: Chen, Shengminjie, et al.
Publicado: (2026)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
por: Gu, Yuzhou, et al.
Publicado: (2023)

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
por: Liu, Yang P., et al.
Publicado: (2025)

Exploiting Low-Rank Structure in Max-K-Cut Problems
por: Stevens, Ria, et al.
Publicado: (2026)