Cover Image

Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Apte, Anuj, Boulebnane, Sami, Jin, Yuwei, Omanakuttan, Sivaprasad, Perlin, Michael A., Shaydulin, Ruslan
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics Mathematical Physics Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Regularized Warm-Started Quantum Approximate Optimization and Conditions for Surpassing Classical Solvers on the Max-Cut Problem
by: He, Zichang, et al.
Published: (2026)

Quantum Approximate Optimization Algorithm in Finite Size and Large Depth and Equivalence to Quantum Annealing
by: Boulebnane, Sami, et al.
Published: (2025)

Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm
by: Omanakuttan, Sivaprasad, et al.
Published: (2025)

Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm
by: Apte, Anuj, et al.
Published: (2025)

Compilation Pipeline for Predicting Algorithmic Break-Even in an Early-Fault-Tolerant Surface Code Architecture
by: Hao, Tianyi, et al.
Published: (2025)

Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm
by: Boulebnane, Sami, et al.
Published: (2025)

Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
by: Shaydulin, Ruslan, et al.
Published: (2022)

End-to-end quantum algorithms for tensor problems
by: Fontana, Enrico, et al.
Published: (2025)

Quantum Computation Using Large Spin Qudits
by: Omanakuttan, Sivaprasad
Published: (2024)

Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm
by: Jin, Yuwei, et al.
Published: (2025)

A Cutting-plane Method for Semidefinite Programming with Potential Applications on Noisy Quantum Devices
by: Marecek, Jakub, et al.
Published: (2021)

Quantum Alternating Direction Method of Multipliers for Semidefinite Programming
by: Nie, Hantao, et al.
Published: (2025)

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

Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
by: Apte, Anuj, et al.
Published: (2025)

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

An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut
by: Takahashi, Jun, et al.
Published: (2023)

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips
by: Dinpazhouh, Saber, et al.
Published: (2025)

Performance of Quantum Approximate Optimization with Quantum Error Detection
by: He, Zichang, et al.
Published: (2024)

Hardness of the Maximum Independent Set Problem on Unit-Disk Graphs and Prospects for Quantum Speedups
by: Andrist, Ruben S., et al.
Published: (2023)

Quantum error correction-inspired multiparameter quantum metrology
by: Omanakuttan, Sivaprasad, et al.
Published: (2024)

Parameter Setting in Quantum Approximate Optimization of Weighted Problems
by: Sureshbabu, Shree Hari, et al.
Published: (2023)

Optimized Qubit Routing for Commuting Gates via Integer Programming
by: Stargalla, Moritz, et al.
Published: (2025)

Optimization Using Locally-Quantum Decoders
by: Shutty, Noah, et al.
Published: (2026)

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

Spanning and Splitting: Integer Semidefinite Programming for the Quadratic Minimum Spanning Tree Problem
by: de Meijer, Frank, et al.
Published: (2024)

Provably Optimal Quantum Circuits with Mixed-Integer Programming
by: Nagarajan, Harsha, et al.
Published: (2025)

Sketching the Best Approximate Quantum Compiling Problem
by: Madden, Liam, et al.
Published: (2022)

Multi-Criteria Inverse Robustness in Radiotherapy Planning Using Semidefinite Programming
by: Schröeder, Jan, et al.
Published: (2026)

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

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

Integer Programming Using A Single Atom
by: Goswami, Kapil, et al.
Published: (2024)

Quantum-Inspired Mean Field Probabilistic Model for Combinatorial Optimization Problems
by: Huang, Yuhan, et al.
Published: (2024)

Introducing Clause Cuts: Strong No-Good Cuts for MaxSAT Problems in Mixed Integer Linear Programming
by: Engelhardt, Max, et al.
Published: (2025)

Lagrangian Duality for Mixed-Integer Semidefinite Programming: Theory and Algorithms
by: de Meijer, Frank, et al.
Published: (2025)

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
by: Qiu, Yeqing, et al.
Published: (2024)

Challenges with Differentiable Quantum Dynamics
by: Narayanan, Sri Hari Krishna, et al.
Published: (2024)

qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
by: Schuetz, Martin J. A., et al.
Published: (2025)

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

A Noise-Aware Scalable Subspace Classical Optimizer for the Quantum Approximate Optimization Algorithm
by: Dzahini, Kwassi Joseph, et al.
Published: (2025)

Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut
by: Bhattacharyya, Bikrant, et al.
Published: (2025)