:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Klug, Florian
Format:	Preprint
Publié:	2023
Sujets:	Quantum Physics Data Structures and Algorithms Optimization and Control
Accès en ligne:	https://arxiv.org/abs/2312.13636
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
par: Li, Tongyang, et autres
Publié: (2024)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
par: Wang, Hao, et autres
Publié: (2024)

On Speedups for Convex Optimization via Quantum Dynamics
par: Chakrabarti, Shouvanik, et autres
Publié: (2025)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
par: Zhang, Yexin, et autres
Publié: (2024)

Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
par: Chakrabarti, Shouvanik, et autres
Publié: (2024)

Quantum speedups for stochastic optimization
par: Sidford, Aaron, et autres
Publié: (2023)

Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions
par: Herman, Dylan, et autres
Publié: (2025)

Gibbs Sampling of Continuous Potentials on a Quantum Computer
par: Motamedi, Arsalan, et autres
Publié: (2022)

Quantum Speedups for Group Relaxations of Integer Linear Programs
par: Augustino, Brandon, et autres
Publié: (2026)

Quantum Langevin Dynamics for Optimization
par: Chen, Zherui, et autres
Publié: (2023)

Quantum speedups for linear programming via interior point methods
par: Apers, Simon, et autres
Publié: (2023)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
par: Su, Yuexin, et autres
Publié: (2025)

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
par: Kim, Junhyung Lyle, et autres
Publié: (2024)

Expanding the reach of quantum optimization with fermionic embeddings
par: Zhao, Andrew, et autres
Publié: (2023)

A quantum central path algorithm for linear optimization
par: Augustino, Brandon, et autres
Publié: (2023)

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
par: Goh, Mark, et autres
Publié: (2026)

Approximate Message Passing for Quantum State Tomography
par: Siekierski, Noah, et autres
Publié: (2025)

Quantum EigenGame for excited state calculation
par: Quiroga, David, et autres
Publié: (2025)

Classical and Quantum Heuristics for the Binary Paint Shop Problem
par: Vijendran, V, et autres
Publié: (2025)

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
par: Kar, Prem Nigam, et autres
Publié: (2024)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
par: Housni, Omar El, et autres
Publié: (2024)

Isotropic Noise in Stochastic and Quantum Convex Optimization
par: Marsden, Annie, et autres
Publié: (2025)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
par: Sun, Shuo, et autres
Publié: (2024)

A hierarchy of eigencomputations for polynomial optimization on the sphere
par: Lovitz, Benjamin, et autres
Publié: (2023)

Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models
par: Vijendran, V, et autres
Publié: (2025)

Parallel Token Swapping for Qubit Routing
par: Bansal, Ishan, et autres
Publié: (2024)

Exploiting Low-Rank Structure in Max-K-Cut Problems
par: Stevens, Ria, et autres
Publié: (2026)

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
par: Zhong, Dawei, et autres
Publié: (2024)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
par: Su, Yuexin, et autres
Publié: (2026)

Quantum thermodynamics and semi-definite optimization
par: Liu, Nana, et autres
Publié: (2025)

Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$
par: Tate, Reuben, et autres
Publié: (2024)

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations
par: Moondra, Jai, et autres
Publié: (2024)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
par: Chen, Yike, et autres
Publié: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
par: Xie, Fangzhou
Publié: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
par: Encz, Koppány István, et autres
Publié: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
par: Gao, Wenzhi, et autres
Publié: (2021)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
par: Hunkenschröder, Christoph, et autres
Publié: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
par: Blankenburg, Daniel, et autres
Publié: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
par: Xu, Pan
Publié: (2025)

Labeling Methods for Partially Ordered Paths
par: Euler, Ricardo, et autres
Publié: (2023)