Cover Image

Quantum computing and the stable set problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Krpan, Aljaž, Povh, Janez, Pucher, Dunja
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Primary 90C27, Secondary 81P68
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest $k$-Subgraph Problem
by: Bihani, Omkar, et al.
Published: (2025)

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
by: Gaar, Elisabeth, et al.
Published: (2024)

Quantum Computing in Logistics and Supply Chain Management an Overview
by: Phillipson, Frank
Published: (2024)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
by: Vodeb, Jaka, et al.
Published: (2024)

Practical Experience with Stable Set and Coloring Relaxations
by: Pucher, Dunja, et al.
Published: (2024)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

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

Quantum-Inspired DRL Approach with LSTM and OU Noise for Cut Order Planning Optimization
by: Chrisnanto, Yulison Herry, et al.
Published: (2025)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
by: Druetto, Alessandro, et al.
Published: (2024)

A solution procedure for minimizing total completion time in a parallel-batching environment
by: Alfieri, Arianna, et al.
Published: (2020)

Box Allocation Optimization in Meal Kit Delivery
by: Nguyen, Thi Minh Thu, et al.
Published: (2025)

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

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
by: Gribling, Sander, et al.
Published: (2025)

Locally Gentle State Certification for High Dimensional Quantum Systems
by: Butucea, Cristina, et al.
Published: (2026)

Developing heuristic solution techniques for large-scale unit commitment models
by: Kempke, Nils-Christian, et al.
Published: (2025)

GPU accelerated variant of Schroeppel-Shamir's algorithm for solving the market split problem
by: Kempke, Nils-Christian, et al.
Published: (2025)

A cutting plane algorithm for globally solving low dimensional k-means clustering problems
by: Ryner, Martin, et al.
Published: (2024)

Quantum computation and quantum error correction: the theoretical minimum
by: Wildon, Mark
Published: (2026)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
by: Gupta, Swati, et al.
Published: (2026)

How a Small Amount of Data Sharing Benefits Distributed Optimization and Learning : The Upside of Data Heterogeneity
by: Zhu, Mingxi, et al.
Published: (2022)

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

A Grover-compatible manifold optimization algorithm for quantum search
by: Lai, Zhijian, et al.
Published: (2025)

Second-order cone programming for distributionally robust compliance optimization of trusses considering input distribution uncertainty
by: Fujiyama, Takumi, et al.
Published: (2025)

Online Convex Optimization Using Coordinate Descent Algorithms
by: Lin, Yankai, et al.
Published: (2022)

Minimizing the determinant of the graph Laplacian
by: Albin, Nathan, et al.
Published: (2024)

Federated Learning on Riemannian Manifolds with Differential Privacy
by: Huang, Zhenwei, et al.
Published: (2024)

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

Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems
by: Blomenhofer, Alexander Taveira, et al.
Published: (2024)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)

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

Congestion and Penalization in Optimal Transport
by: Gallardo, Marcelo, et al.
Published: (2024)

Learning to Choose Branching Rules for Nonconvex MINLPs
by: Berthold, Timo, et al.
Published: (2026)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
by: Chu, Hong T. M.
Published: (2026)

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

A random copositive matrix is completely positive with positive probability
by: Klep, Igor, et al.
Published: (2023)

Sample-optimal learning of quantum states using gentle measurements
by: Butucea, Cristina, et al.
Published: (2025)

Exponential convergence rates for momentum stochastic gradient descent in the overparametrized setting
by: Gess, Benjamin, et al.
Published: (2023)

A mathematical model for a universal digital quantum computer with an application to the Grover-Rudolph algorithm
by: Falcó, Antonio, et al.
Published: (2025)