4 papers
SUTURE: Syndrome-Guided Repair for Segmented Feasibility-Preserving VQAs on Noisy Hardware
Sokea Sang, Leanghok Hour, Sanghyeon Lee +1
Constrained binary optimization is a representative class of NP-hard problems in scheduling, resource allocation, and finance. Segmented feasibility-preserving variational quantum…
Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA
Sokea Sang, Leanghok Hour, Dongmin Kim +1
Divide-and-conquer variants of the Quantum Approximate Optimization Algorithm (QAOA) provide a promising route for executing combinatorial optimization problems beyond the qubit ca…
Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA
Sokea Sang, Leanghok Hour, Sanghyeon Lee +4
Divide-and-conquer strategies mitigate hardware constraints for the Quantum Approximate Optimization Algorithm (QAOA) on Noisy Intermediate-Scale Quantum (NISQ) devices by partitio…
Learning-Optimized Qubit Mapping and Reuse to Minimize Inter-Core Communication in Modular Quantum Architectures
Sokea Sang, Leanghok Hour, Youngsun Han
Modular quantum architectures have emerged as a promising approach for scaling quantum computing systems by connecting multiple Quantum Processing Units (QPUs). However, this appro…