Power and Limits of Collective Local Measurements in Multicopy State Discrimination
- URL: http://arxiv.org/abs/2609.07233v1
- Date: Mon, 07 Sep 2026 08:49:34 GMT
- Title: Power and Limits of Collective Local Measurements in Multicopy State Discrimination
- Abstract summary: We identify collective access across repeated local inputs as a distinct resource.<n>For every fixed local dimension $dge2$, we prove the existence of complete bases whose copy complexity remains unbounded even under collective separable measurements.
- Score: 3.958173066860798
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: More than two decades ago, Bennett \emph{et al.} [Phys. Rev. A \textbf{59}, 1070 (1999)] asked whether perfect local discrimination of orthogonal quantum states can require more than two copies. This question was subsequently answered for adaptive protocols that process the copies separately [Phys. Rev. Lett. \textbf{126}, 210505 (2021)], but remained open when each laboratory is allowed to process its local copies collectively. Here we resolve this stronger setting and identify collective access across repeated local inputs as a distinct resource. For every fixed odd-prime local dimension, there exist complete maximal-stabilizer eigenbases whose copy complexity under individual-copy separable measurements diverges with system size. Under collective processing this behavior changes sharply: every maximal-stabilizer eigenbasis in odd-prime local dimension is perfectly decoded by one-round collective LOCC using at most three copies. Collective processing, however, does not remove multicopy hardness in general. For every fixed local dimension $d\ge2$, we prove the existence, within an explicit phase family, of complete bases whose copy complexity remains unbounded even under collective separable measurements, with a square root of the number of subsystems as lower-bound scale. Thus sample number, spatial measurement power, and coherent access across repeated local inputs are distinct resources in distributed quantum measurement.
Related papers
- Inclusion-Minimal local indistinguishability: a weak form of nonlocality [3.6232799647768594]
Local discrimination of quantum states is a fundamental task in distributed quantum information processing.<n>We show that local indistinguishability can be nontrivial at the single-copy level yet fragile under either the removal of candidate states or a modest increase in copy resources.
arXiv Detail & Related papers (2026-08-23T12:40:58Z) - Optimal GHZ-State Distribution in LOSR Quantum Networks via Local Decoding from Information Sets [40.76168869865134]
We prove the conjecture for regular and uniform networks of arbitrary size.<n>By identifying the hyperedges of the network with the coordinates of a linear code, we show that whenever the edges incident to each node form an information set, a fixed collection of local unitaries transforms the source state into an (N)-party GHZ state with fidelity (dm-M)<n>These results demonstrate that multipartite sources, together with shared randomness, can replace real-time classical communication for entanglement distribution.
arXiv Detail & Related papers (2026-06-19T14:53:28Z) - Quantum Sequential Universal Hypothesis Testing [62.751483592497806]
Quantum hypothesis testing (QHT) concerns the statistical inference of unknown quantum states.<n>We introduce the quantum sequential universal test (QSUT), a novel framework for sequential QHT in the general case of composite hypotheses.<n> QSUT builds on universal inference, and it alternates between adaptive local measurements aimed at exploring the hypothesis space and joint measurements optimized for maximal discrimination.
arXiv Detail & Related papers (2025-08-29T12:50:04Z) - Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases [0.0]
We propose a universal protocol to verify arbitrary multipartite pure quantum states.<n>We establish a universal upper bound on the sample complexity that is independent of the local dimensions.
arXiv Detail & Related papers (2025-06-24T17:22:01Z) - Classification of joint quantum measurements based on entanglement cost of localization [42.72938925647165]
We propose a systematic classification of joint measurements based on entanglement cost.
We show how to numerically explore higher levels and construct generalizations to higher dimensions and multipartite settings.
arXiv Detail & Related papers (2024-08-01T18:00:01Z) - Efficient entanglement-assisted discrimination of a class of many-copy indistinguishable sets [0.0]
We explore entanglement as a resource to distinguish locally indistinguishable quantum states.<n>In particular, we consider sets which contain states from an unextendible product basis along with a pure entangled state.<n>We present a theoretical proposal for an information processing protocol exhibiting secure locking of information and its resource-efficient extraction.
arXiv Detail & Related papers (2023-12-24T13:17:34Z) - The Blessing of Heterogeneity in Federated Q-Learning: Linear Speedup
and Beyond [44.43850105124659]
We consider federated Q-learning, which aims to learn an optimal Q-function by periodically aggregating local Q-estimates trained on local data alone.
We provide sample complexity guarantees for both the synchronous and asynchronous variants of federated Q-learning.
We propose a novel federated Q-learning algorithm with importance averaging, giving larger weights to more frequently visited state-action pairs.
arXiv Detail & Related papers (2023-05-18T04:18:59Z) - Unextendibility, uncompletability, and many-copy indistinguishable ensembles [49.1574468325115]
We show that the complement of any bipartite pure entangled state is spanned by product states which form a nonorthogonal unextendible product basis (nUPB) of maximum cardinality.<n>We also report a class of multipartite many-copy indistinguishable ensembles for which local indistinguishability property increases with decreasing number of mixed states.
arXiv Detail & Related papers (2023-03-30T16:16:41Z) - Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM)
We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
arXiv Detail & Related papers (2021-05-11T03:39:08Z) - Quantum Sequential Hypothesis Testing [1.1545092788508222]
We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing.
We obtain ultimate lower bounds on the average number of copies needed to accomplish the task.
For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement.
arXiv Detail & Related papers (2020-11-21T11:24:07Z) - Multi-copy adaptive local discrimination: Strongest possible two-qubit
nonlocal bases [0.0]
In this letter, we provide examples of orthonormal bases in two-qubit Hilbert space whose adaptive discrimination require 3 copies of the state.
We also come up with ensembles whose discrimination under adaptive separable scheme require less number of copies than adaptive local schemes.
Our construction finds important application in multipartite secret sharing tasks and indicates towards an intriguing super-additivity phenomenon for locally accessible information.
arXiv Detail & Related papers (2020-11-18T13:49:51Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.