arXiv:2609.40218
Purification enables an unbounded query separation in sequential quantum channel discrimination
Zoe G. del Toro, Marco Túlio Quintino, Jessica Bavaresco
Abstract
Purifications are often used as a convenient mathematical representation of quantum states and channels when constructing protocols for quantum information processing tasks. Although powerful, this perspective can suggest that the purifying degrees of freedom and its correlations with an environment are just a useful change of representation. Here we show how they can instead be exploited as an operational resource in sequential quantum channel discrimination, even when the environmental reference frame is unknown or averaged. In contrast to state discrimination and parallel channel discrimination, for which bare and averaged-purification access are equivalent, sequential access to purified resources exhibits a strict advantage in probability of success. We prove this strict separation via two main results. In the first, we construct a pair of families of qubit-qubit channels with a strict separation in the two-query case, and in the second, we show an example of a pair of qubit-qubit channels whose purifications are perfectly distinguishable with three queries while no finite number of bare (non-purified) queries suffices for perfect discrimination. These separations imply an advantage of sequential over parallel strategies for channel discrimination and establish the impossibility of converting bare channel queries into averaged-purification queries via transformations that allow arbitrary interventions between queries, strengthening previous results.
AI Summary
The paper asks whether access to a channel’s purification provides an operational advantage when the environment basis is unknown. It compares bare channel queries, queries to one purification averaged over a common Haar-random environment unitary, and queries to a fixed unknown purification evaluated in the worst case. The common environment frame across queries is essential. Haar symmetrization establishes that the two purified-access models have equal performance for quantum-to-classical tasks under parallel or sequential strategies. Parallel strategies also gain nothing from purification, recovering an existing result. Sequential strategies differ: for explicit entanglement-breaking qubit-channel families, two purified queries outperform two bare queries by at least $\frac{7-3\sqrt{5}}{6}t$, for $0<t<1/(2\sqrt{5})$. The proof compares a feasible purification-access tester with a bare-access SDP dual certificate, using symmetric and antisymmetric environment sectors. A second explicit qubit-channel pair is perfectly distinguishable with three purified queries, whereas no finite number of sequential bare queries permits perfect discrimination. An explicit three-round tester establishes achievability; failure of entanglement-assisted disjointness establishes the bare-query obstruction. This separation concerns exact, rather than bounded-error, discrimination. It rules out universal conversion of finitely many bare queries into three or more averaged-purification queries while preserving arbitrary sequential interventions, disproving a stated conjecture. The paper leaves open whether two purified queries can yield such a perfect-discrimination separation and which channel families admit purification advantages. Its quantum-to-quantum separation of the two purification models uses a deliberately tailored task; finding an operationally motivated example remains open.
OpenAI's GPT-6 Astra was used for grammar, spelling checks and text rephrasing.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 11+30 pages, 4+3 figures, minor text revisions and reorganization of the manuscript