Copertina

Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bhattacharyya, Bikrant, Capriotti, Michael, Tate, Reuben
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Quantum Physics Discrete Mathematics Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$
di: Tate, Reuben, et al.
Pubblicazione: (2024)

Quantum algorithms for optimizers
di: Nannicini, Giacomo
Pubblicazione: (2024)

A Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms
di: Brown, Robin, et al.
Pubblicazione: (2022)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
di: Proença, Nathan Benedetto, et al.
Pubblicazione: (2026)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
di: Farhi, Edward, et al.
Pubblicazione: (2025)

Minimum Cut Representability of Stable Matching Problems
di: Faenza, Yuri, et al.
Pubblicazione: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
di: Wang, Changjun, et al.
Pubblicazione: (2026)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
di: Fouilhoux, Pierre, et al.
Pubblicazione: (2024)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
di: Thomas, Helen, et al.
Pubblicazione: (2025)

Hierarchical threshold structure in Max-Cut with geometric edge weights
di: Marić, Nevena
Pubblicazione: (2026)

Phantom Edges in the Problem Hamiltonian: A Method for Increasing Performance and Graph Visibility for QAOA
di: Langfitt, Quinn, et al.
Pubblicazione: (2024)

Valid Cuts for the Design of Potential-based Flow Networks
di: Börner, Pascal, et al.
Pubblicazione: (2025)

Parallel Token Swapping for Qubit Routing
di: Bansal, Ishan, et al.
Pubblicazione: (2024)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
di: Del Pia, Alberto
Pubblicazione: (2025)

A Tight Formulation for the Dial-a-Ride Problem
di: Gaul, Daniela, et al.
Pubblicazione: (2023)

On Supportedness in Multi-Objective Combinatorial Optimization
di: Könen, David, et al.
Pubblicazione: (2025)

Polytopes of alternating sign matrices with dihedral-subgroup symmetry
di: Madarasi, Péter
Pubblicazione: (2026)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
di: Baeckelant, Timothy, et al.
Pubblicazione: (2026)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
di: Lozano, Leonardo, et al.
Pubblicazione: (2022)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
di: Proença, Nathan Benedetto, et al.
Pubblicazione: (2024)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
di: Li, Zongji, et al.
Pubblicazione: (2023)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
di: Costandin, Marius, et al.
Pubblicazione: (2023)

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

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
di: Kar, Prem Nigam, et al.
Pubblicazione: (2024)

Projection-width as a structural parameter for discrete separable optimization
di: Del Pia, Alberto
Pubblicazione: (2025)

Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut
di: Apte, Anuj, et al.
Pubblicazione: (2026)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
di: Lucci, Mauro, et al.
Pubblicazione: (2026)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
di: Bangerter, Elise, et al.
Pubblicazione: (2026)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
di: Tellache, Nour ElHouda, et al.
Pubblicazione: (2025)

Economic Dispatch of a Single Micro-Gas Turbine Under CHP Operation with Uncertain Demands
di: Sharf, Miel, et al.
Pubblicazione: (2021)

On Circuit Diameter Bounds via Circuit Imbalances
di: Dadush, Daniel, et al.
Pubblicazione: (2021)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
di: Moldenhauer, Carsten, et al.
Pubblicazione: (2025)

Geoffrion's theorem beyond finiteness and rationality
di: Dey, Santanu S., et al.
Pubblicazione: (2025)

A review of minimum cost box searching games
di: Lidbetter, Thomas
Pubblicazione: (2025)

An exact approach for the multi-depot electric vehicle scheduling problem
di: Haslinger, Xenia, et al.
Pubblicazione: (2025)

Normalizations of factorizations over convex cones and their effects on extension complexity
di: Brown, Adam, et al.
Pubblicazione: (2025)

Extended formulations for the multilinear polytope of acyclic hypergraphs
di: Del Pia, Alberto, et al.
Pubblicazione: (2025)

The complete edge relaxation for binary polynomial optimization
di: Del Pia, Alberto, et al.
Pubblicazione: (2025)

Aircraft routing: periodicity and complexity
di: Meunier, Frédéric, et al.
Pubblicazione: (2025)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
di: Vercesi, Eleonora, et al.
Pubblicazione: (2025)