Intermediate memory costs of quantum channel synthesis with a protected subsystem

A quantum memory can preserve a subsystem perfectly while discarding information needed by a later operation. We study the total intermediate dimension required for channel synthesis when the first stage protects a $b$-dimensional subsystem and has a prescribed noncommutative graph imposing full confusability on an $a$-dimensional control register. For a finite family of classically controlled branches, exact synthesis is possible if and only if the target graph contains the prescribed graph of the first stage. For every feasible family, we construct a single processor that implements all branches exactly. The processor uses pairwise nonorthogonal pure program states in a register of dimension at most $a$. A target graph may be realizable with a carrier of dimension $b$, while synthesizing a channel with that graph can require dimension $ab$. We also characterize the closure of the attainable channels, distinguishing exact synthesis from arbitrarily accurate approximation. Finally, for a family built from the trine communication task, a four-dimensional carrier permits exact synthesis with quantum programs under output depolarization. At the same total carrier dimension and without free shared randomness, classical programs have optimal normalized diamond error $(1-η)/4$, where $0\leqη\leq1$ is the depolarization strength. For $η<1$, the gap persists under sufficiently small perturbations of the target branches.

Source: arXiv:2610.20536v1 - http://arxiv.org/abs/2610.20536v1 PDF: https://arxiv.org/pdf/2610.20536v1 Original Link: http://arxiv.org/abs/2610.20536v1