2025/10/09 by Jacob L. Beckey, Beckey, Jacob, Luke Coffman +7
Mathematics · #FOS: Physical sciences #Quantum Physics (quant-ph) #Statistical Methods in Clinical Trials
paper · pdf · doi:10.48550/arxiv.2510.07820
openalex publication_date 2025/10/09 · openalex created_date 2025/10/18 · openalex updated_date 2026/07/28
In this work, we study the sample complexity of two variants of product testing when restricted to single-copy measurements. In particular, we consider both bipartite product testing (i.e., does there exist at least one non-trivial cut across which the state is product) and multipartite product testing (i.e., is the state fully product across every cut). For the first variant, we prove an exponential lower bound on the sample complexity of any algorithm for this task which utilizes only single-copy measurements. When comparing this with known efficient algorithms that utilize multi-copy measurements, this establishes an exponential separation for this and several related entanglement learning tasks. For the second variant, we prove another sample lower bound that establishes a separation between single- and multi-copy strategies. To obtain our results, we prove a crucial technical lemma that gives a lower bound on the overlap between tensor products of permutation operators acting on subsystems of states that themselves carry a tensor structure. Finally, we provide an algorithm for multipartite product testing using only single-copy, local measurements, and we highlight several interesting open questions arising from this work.