2 papers
quant-ph2025
Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro GarcÃa-Pintos +3
The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorith…
cs.CG2024
Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs
Vladyslav Oles, Nathan Lemons, Alexander Panchenko
Gromov-Hausdorff distances measure shape difference between the objects representable as compact metric spaces, e.g. point clouds, manifolds, or graphs. Computing any Gromov-Hausdo…