ParaQAOA: Efficient Parallel Divide-and-Conquer QAOA for Large-Scale Max-Cut Problems Beyond 10,000 Vertices
arXiv 2603.26232•a3ae5cb488cfa18f521d8b0965b9158571a3e13ebf39580516bde2d7ec5125bd
GPUHPCacademic-researchcryptographydiscrete-logarithmdistributed-systemsedge-computingmachine-learningmultimodal-LLMperformance-optimizationquantum-computingsatellite-systems
Paper metadata
- arXiv ID
- 2603.26232
- Version
- Not specified by this published record
- Category
- Computer Science — Distributed, Parallel, and Cluster Computing (cs.DC)
The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.
Evidence and limitations
- Source ID
- arxiv_cs_dc
- Record identifier
- a3ae5cb488cfa18f521d8b0965b9158571a3e13ebf39580516bde2d7ec5125bd
- Enrichment time
- 2026-08-16T13:05:14Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.