Parallel splitting method for large-scale quadratic programs
quant-ph, math.OC
Submitted: 2025-03-21
Updated: 2026-09-21
Comments: 13 pages, 11 Figures
Journal ref: Journal of Heuristics 32, 32 (2026)
DOI: 10.1007/s10732-026-09606-4
Code: https://github.com/0816keisuke/max-cut-problem-benchmark
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms
- Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing
- A Quantum Approximate Optimization Algorithm
- Clustering-Based Sub-QUBO Extraction for Hybrid QUBO Solvers
- Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation
- Noise-Aware Distributed Quantum Approximate Optimization Algorithm on Near-term Quantum Hardware
- Evaluating the Practicality of Quantum Optimization Algorithms for Prototypical Industrial Applications
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians