We study sequential decision making where an agent reserves a minimum menu of initial actions before multi-objective trade-offs are revealed, followed by unrestricted continuation planning once linear reward weights arrive. We prove that a menu preserves the unrestricted optimal return across all linear scalarizations if and only if its reachable continuations cover all vertices of the full feature polytope. This geometric equivalence yields an output-sensitive algorithm that is fixed-parameter tractable in the vertex count, combining scalar backward induction with oracle-based facet identification. On explicitly layered graphs with unit feature increments, menu verification is coNP-complete and synthesis is complete for the second existential level of the polynomial hierarchy, even under additive loss strictly below one. In fixed dimensions two and higher, verification is polynomial whereas synthesis remains NP-complete, while one-dimensional instances admit polynomial-time solutions.
Yukun Yang, Xiaojie Fan, C. R. Ramakrishnan, Himanshu Gupta
原文摘要
We develop a purification-aware optimization framework for distributing high-fidelity entangled states over quantum networks. In repeater-based architectures, the framework jointly selects entanglement swapping, fusion or graph-state growth, and purification operations to maximize generation rate under a fidelity threshold. Different purification models can be incorporated through their fidelity-update, success-probability, and latency rules. We introduce purification-augmented generation trees and dynamic programming (DP) algorithms for entangled-pair (EP) distribution. Hypergraph-flow linear programming (LP) formulations support level-based structures and concurrent generation across multiple trees and demands. We extend the framework to GHZ states and arbitrary graph states constructed from remote EP resources, introduce graph-state construction primitives, and derive closed-form fidelity-vector updates for GHZ fusion and purification and graph-state growth and purification. We provide optimal formulations under the adopted models, discretization, and purification bounds, together with efficient DP and LP heuristics. We bound fidelity- and rate-discretization errors and establish convergence for fixed constructions under stated regularity conditions. NetSquid simulations of EP generation using our LP approach show an average 160% increase in generation rate over the compared prior approaches, with gains up to 330% in some scenarios. GHZ and graph-state simulations demonstrate the heuristics' effectiveness in balancing generation rate, output fidelity, and computational overhead.