Improved approximation algorithms for ancilla placement

Determine whether approximation algorithms better than the resource-cost-based heuristic placement used in Algorithm 2 exist for selecting ancilla-pair locations in the physical implementation of rank-2 graph-state synthesis.

Background

The paper’s physical implementation maps each algebraic rank-2 update to a dual-star concurrent distribution involving an entangled ancilla pair. Selecting the ancilla locations affects the total physical resource cost because the three required entanglement branches traverse physical paths whose costs depend on channel lengths and attenuation.

Algorithm 2 separates pivot selection from ancilla placement and uses exhaustive search over candidate ancilla pairs, while evaluating candidate costs through a shortest-path-union approximation rather than solving the associated Steiner-tree problem exactly for every candidate. The authors therefore leave unresolved whether a better approximation algorithm can improve this resource-cost-based placement procedure.