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.
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.
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 stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate whether this limitation can be overcome when the communicating parties are assisted by additional quantum resources. We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols and analyze their power to reveal hidden information. We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability, establishing the robustness of separable data-hiding schemes. In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly. Our results delineate the fundamental limits of catalytic and memory-assisted state discrimination and identify separable encodings as a robust strategy for quantum data hiding.
Quantum data hiding asks how much distinguishing power can be lost when global measurements are restricted to local measurements and classical communication. In this work, we establish sharp results and improved bounds for several natural classes of restricted measurements. For bipartite systems on Cn⊗Cm, we prove that the optimal data-hiding ratios against separable and LOCC measurements are both min{n,m}. This result follows from a stronger result that, for every 2≤p≤∞, the largest centered Schatten p-ball whose associated binary measurements are implementable by finite-round LOCC has radius min{n,m}2/p−1. This strengthens the classic separable-ball theorems, while also providing an explicit finite-round LOCC implementation. For Alice-first one-way LOCC with Alice's local dimension equal to n, we prove that the optimal ratio is (1+o(1))n, with the upper bound obtained from a Gaussian rank-one POVM. For local operations without communication, we improve the universal upper bound to (π3/4+o(1))min{n,m}.
Entanglement and nonlocality play a fundamental role in quantum computing. To understand the interplay between these phenomena, researchers have considered the model of local operations and classical communication, or LOCC for short, which is a restricted subset of all possible operations that can be performed on a multipartite quantum system. The task of distinguishing states from a set that is known a priori to all parties is one of the most basic problems among those used to test the power of LOCC protocols, and it has direct applications to quantum data hiding, secret sharing and quantum channel capacity. The focus of this thesis is on state distinguishability problems for classes of quantum operations that are more powerful than LOCC, yet more restricted than global operations, namely the classes of separable and positive-partial-transpose (PPT) measurements. We \nbuild a framework based on convex optimization (on cone programming, in particular) to study such problems. Compared to previous approaches to the problem, the method described in this thesis provides precise numerical bounds and quantitative analytic results. By combining the duality theory of cone programming with the channel-state duality, we also establish a novel connection between the state distinguishability problem and the study of positive linear maps, which is a topic of independent interest in quantum information theory. \n \nWe apply our framework to several questions that were left open in previous works regarding the distinguishability of maximally entangled states and unextendable product sets. First, we exhibit small sets of orthogonal maximally entangled states in that are not perfectly distinguishable by LOCC. As a consequence of this, we show a gap between the power of PPT and separable measurements for the task of distinguishing sets consisting only of maximally entangled states. Furthermore, we prove tight bounds on the entanglement cost that is necessary to distinguish any sets of Bell states, thus showing that quantum teleportation is optimal for this task. Finally, we provide an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, along with the first known example of an unextendable product set that cannot be perfectly discriminated by separable measurements.
Quantum nonlocality has different manifestations that, in general, are revealed by local measurements of the parts of a composite system. In this paper, we study nonlocality arising from a set of orthogonal states that cannot be perfectly distinguished by local operations and classical communication (LOCC). Such a set is deemed nonlocal, for a joint measurement on the whole system is necessary for perfect discrimination of the states with certainty. On the other hand, a set of orthogonal states that can be perfectly distinguished by LOCC is believed to be devoid of nonlocal properties. Here, we show that there exist orthogonal sets that are locally distinguishable but without local redundancy (i.e., they become nonorthogonal on discarding one or more subsystems) whose nonlocality can be activated by local measurements. In particular, a state chosen from such a set can be locally converted, with certainty, into another state, the identity of which can now only be ascertained by global measurement and no longer by LOCC. In other words, a locally distinguishable set without local redundancy may be locally converted into a locally indistinguishable set with certainty. We also suggest an application, namely, local hiding of information, that allows us to locally hide locally available information without losing any part. Once hidden, the information in its entirety can only be retrieved using entanglement.
We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication without quantum communication. The scheme remains secure if quantum communication is allowed between certain partners, and can be designed for any choice of quantum communication patterns to be secure, but to allow near perfect recovery for all other patterns. No entanglement is needed since the hiding states can be chosen to be separable. A single ebit of prior entanglement is not sufficient to break the scheme.