Quantum data hiding concerns pairs of states which are highly distinguishable with global measurements, yet nearly indistinguishable when restricted to local operations and classical communication. More than two decades after Eggeling and Werner introduced a multipartite hiding scheme based on Werner states, the optimal dependence of its uniform security guarantee on the number of parties and local dimension remained unknown. We resolve this problem by showing that the distinguishing bias of any pair of n-qudit Werner states is O(n2/d) under measurements whose effects remain positive under partial transposition (PPT) across every bipartition. An explicit pair attains this scaling using only nonadaptive local measurements, establishing worst-case optimality and showing that the PPT relaxation preserves the optimal dependence on both the number of parties and the local dimension. At fixed security, this extends the certified hiding regime from n=O(d1/4) to n=O(d). Beyond data hiding, the same bound implies that testing any nontrivial unitarily invariant property with adaptive single-copy measurements requires Ω(d) copies, yielding separations for any property with dimension-independent sample complexity under collective measurements. Our proof reduces the distinguishing bias to trace norms of partially transposed operators and analyzes them using mixed Schur-Weyl duality, demonstrating the utility of representation theoretic methods developed for port-based teleportation to data hiding and quantum property testing.
Quantum data hiding is the existence of pairs of bipartite quantum states that are (almost) perfectly distinguishable with global measurements, yet close to indistinguishable when only measurements implementable with local operations and classical communication are allowed. Remarkably, data hiding states can also be chosen to be separable, meaning that secrets can be hidden using no entanglement that are almost irretrievable without entanglement -- this is sometimes called `nonlocality without entanglement'. Essentially two families of data hiding states were known prior to this work: Werner states and random states. Hiding Werner states can be made either separable or globally perfectly orthogonal, but not both -- separability comes at the price of orthogonality being only approximate. Random states can hide many more bits, but they are typically entangled and again only approximately orthogonal. In this paper, we present an explicit construction of novel group-symmetric data hiding states that are simultaneously separable, perfectly orthogonal, and even invariant under partial transpose, thus exhibiting the phenomenon of nonlocality without entanglement to the utmost extent. Our analysis leverages novel applications of numerical analysis tools to study convex optimisation problems in quantum information theory, potentially offering technical insights that extend beyond this work.
We expand on our work on quantum data hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell (1964) states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data-hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.