---
title: 'Quantum Data Hiding: Concepts & Constructions'
url: https://www.emergentmind.com/topics/quantum-data-hiding-qdh
type: topic
---

# Quantum Data Hiding: Concepts & Constructions

Searching arXiv for recent and foundational papers on quantum data hiding.
Quantum data hiding (QDH) is the task of encoding a classical value into a distributed quantum state so that parties restricted to local operations and classical communication (LOCC) cannot recover the value, while a joint global measurement can recover it reliably or perfectly. In the standard bipartite formulation, one studies pairs or ensembles of states that are perfectly or nearly perfectly distinguishable under unrestricted measurements yet almost indistinguishable under LOCC; across the literature, QDH has been developed as a theory of restricted distinguishability, asymptotic coding by tensor-product repetition, geometric norm separation, and multipartite cryptographic functionality [1703.03392][2311.06029].

## 1. Operational formulation and basic figures of merit

A bipartite ensemble is written as
\[
\mathcal E=\{\eta_i,\rho_i\}_{i=0}^{n-1},
\]
with \(\rho_i\in\mathcal D(\mathcal H_A\otimes\mathcal H_B)\), \(\eta_i\ge 0\), and \(\sum_i\eta_i=1\). The central operational quantities are the optimal global discrimination probability
\[
p_G(\mathcal E),
\]
and the optimal LOCC discrimination probability
\[
p_L(\mathcal E).
\]
An ensemble is operationally nonlocal when \(p_L(\mathcal E)<p_G(\mathcal E)\), and it induces a QDH scheme when the hiding step leaves LOCC performance close to random guessing while a revealing step based on a joint measurement achieves \(p_G=1\) [2311.06029].

For binary hiding pairs \((\rho,\sigma)\), the unrestricted success probability is governed by the trace norm through the Holevo–Helstrom formula, while the restricted success probability is governed by an LOCC norm. In this language, QDH is the existence of states with \(\|\rho-\sigma\|_1=2\) but \(\|\rho-\sigma\|_{\rm LOCC}\ll 1\). A common quantitative benchmark is the data hiding ratio
\[
R(\rho,\sigma)=\frac{\|\rho-\sigma\|_1}{\|\rho-\sigma\|_{\rm LOCC}},
\]
and the maximal bipartite quantum-mechanical ratio satisfies
\[
R_{\rm QM}(n_A,n_B)=\Theta\!\bigl(\min\{n_A,n_B\}\bigr),
\]
which identifies local dimension as the controlling asymptotic resource for finite-dimensional bipartite hiding [1703.03392].

Recent work also formulates QDH against a general restricted measurement class \(\mathbb M\). In that setting, a pair \((\sigma_0,\sigma_1)\) is \((\epsilon,\delta)\)-data hiding against \(\mathbb M\) when
\[
\frac12\|\sigma_0-\sigma_1\|_1\ge \epsilon,\qquad
\frac12\|\sigma_0-\sigma_1\|_{\mathbb M}\le \delta.
\]
This formulation isolates the global decoding advantage \(\epsilon\) from the adversarial restricted advantage \(\delta\), and it is useful in later connections to verification and subspace testing [2509.01281].

## 2. Restricted discrimination, PPT relaxations, and asymptotic hiding criteria

Because direct optimization over LOCC measurements is difficult, much of the modern theory passes through PPT-relaxed discrimination. For bipartite ensembles, one defines an efficiently analyzable upper bound \(q_G(\mathcal E)\) by optimizing against partial transposes of the code states; it satisfies
\[
p_L(\mathcal E)\le q_G(\mathcal E)\le p_G(\mathcal E).
\]
For two-state ensembles,
\[
q_G(\mathcal E)=\tfrac12+\tfrac12\,\mathrm{Tr}\bigl|\eta_0\rho_0^{PT}-\eta_1\rho_1^{PT}\bigr|,
\]
which turns restricted distinguishability into a trace-norm computation on the partial transpose [2311.06029].

Ha and Kim sharpen this PPT perspective by introducing the bias operator
\[
\Lambda:=\eta_0\rho_0-\eta_1\rho_1.
\]
If there exists a Hermitian operator \(H\) such that
\[
H+H^{PT}=\Lambda,
\]
then
\[
P_{PPT}(\mathcal E)\le q(H),\qquad q(H):=\tfrac12+\tfrac12\,\mathrm{Tr}|H|.
\]
This produces a sufficient local-discrimination bound directly from a partial-transpose decomposition. For tensor-power repetition, the same framework yields a sufficient condition for asymptotic hiding: if there exists \(H\) with
\[
H+H^{PT}=\Lambda,\qquad \mathrm{Tr}|H|+\mathrm{Tr}|H^{PT}|<1,
\]
then for the \(3^m\)-fold ensemble
\[
P_{PPT}(\mathcal E^{(3^m)})\le \tfrac12+f^{[m]}(\mathrm{Tr}|H|),
\qquad
f(x)=x^2(3-2x),
\]
and if \(\mathrm{Tr}|H|<1/2\), then \(f^{[m]}(\mathrm{Tr}|H|)\to 0\) exponentially, so the PPT and therefore LOCC success probability converges to random guessing while global decoding remains perfect because of orthogonality [2502.18656].

The same logic extends beyond binary alphabets. For an orthogonal \(n\)-state ensemble \(\mathcal E\), if
\[
p_G(\mathcal E)=1,\qquad q_G(\mathcal E)<\frac{2}{n},
\]
then an \(n\)-ary hiding protocol follows by taking \(L\)-fold tensor powers, classifying strings by their mod-\(n\) sum, and broadcasting a masked classical side value \(z=x\oplus \omega_n(\vec c)\). In the induced ensemble, the restricted success probability converges to \(1/n\), so the best LOCC strategy becomes asymptotically no better than blind guessing [2311.06029].

## 3. Canonical constructions and optimal scaling

The traditional QDH paradigm, associated in the data block with DiVincenzo–Terhal and related work, uses Bell-state mixtures or Werner-type states. In these constructions, orthogonality and strong nonlocality ensure that global measurements distinguish the code states while LOCC protocols do not. A canonical example is the symmetric/antisymmetric Werner pair: if \(P_{\rm sym}\) and \(P_{\rm asym}\) are the projectors onto the symmetric and antisymmetric subspaces, then
\[
\|P_{\rm sym}-P_{\rm asym}\|_1=2,\qquad
\|P_{\rm sym}-P_{\rm asym}\|_{\rm LOCC}=\frac{2}{n+1},
\]
so the hiding ratio already scales linearly in the local dimension parameter \(n\) [1703.03392].

The upper bound is controlled by teleportation arguments. For \(n=\min\{n_A,n_B\}\),
\[
\|\Delta\|_{\rm LOCC}\ge \frac{1}{2n-1}\,\|\Delta\|_1,
\]
which implies
\[
R_{\rm QM}(n_A,n_B)\le 2\min\{n_A,n_B\}-1.
\]
Together with Werner-type lower bounds, this establishes the exact quantum scaling
\[
R_{\rm QM}(n_A,n_B)=\Theta\bigl(\min\{n_A,n_B\}\bigr),
\]
and, in the broader GPT framework, the maximal hiding ratio is universally bounded by the minimum local real dimension [1703.03392].

More recent analysis clarifies the structural limits of earlier families. Werner states can be made either separable or globally perfectly orthogonal, but not both; random states can hide many more bits, but they are typically entangled and only approximately orthogonal. This diagnosis motivates the explicit construction of new group-symmetric hiding states that are simultaneously separable, perfectly orthogonal, and invariant under partial transpose, thereby pushing “nonlocality without entanglement” to an extremal form [2510.03538].

## 4. Orthogonal separable-state hiding

A major recent development is the construction of QDH schemes from orthogonal separable ensembles. In a \(3\otimes 3\) example due to Ha and Kim, one sets \(\eta_0=\eta_1=1/2\) and defines
\[
\rho_0=\frac16\sum_{k=0}^2 |\psi_k\otimes\psi_k\rangle\langle\psi_k\otimes\psi_k|,\qquad
\rho_1=\frac16\sum_{k=0}^2 |\phi_k\otimes\phi_k\rangle\langle\phi_k\otimes\phi_k|,
\]
where \(\{|\psi_k\rangle\}\) and \(\{|\phi_k\rangle\}\) are orthonormal bases of \(\mathbb C^3\) chosen so that \(\langle \psi_k|\phi_\ell\rangle=0\) whenever \(k=\ell\). With
\[
H=\sum_{k=0}^2\frac{|\psi_k\psi_k\rangle\langle\psi_k\psi_k|-|\phi_k\phi_k\rangle\langle\phi_k\phi_k|}{6},
\]
one has \(H+H^{PT}=\Lambda\) and
\[
\mathrm{Tr}|H|=\mathrm{Tr}|H^{PT}|=\frac16,
\qquad
\mathrm{Tr}|H|+\mathrm{Tr}|H^{PT}|=\frac13<1.
\]
Hence \(P_{PPT}(\mathcal E^{(3^m)})\to 1/2\) exponentially in \(m\), while \(P_G(\mathcal E^{(3^m)})=1\). The same paper gives an odd-\(d\) generalization and emphasizes that low-dimensional separable state preparation shifts experimental difficulty away from entanglement generation and toward the final global decoding measurement [2502.18656].

The implementation remarks attached to this framework are unusually concrete. Because the codewords are separable, the preparation stage requires only local product-vector synthesis. Repeating the same \(3\otimes 3\) separable density \(L=3^m\) times is experimentally simple in the sense stated by the paper, and proposed platforms include photonic qutrits, spin-1 systems such as NV centers or trapped ions, and orbital-angular-momentum modes of photons. The revealing measurement is a joint projection onto the orthogonal supports of \(\rho_0^{(L)}\) and \(\rho_1^{(L)}\), realizable in principle by sequential two-system interactions or a collective interferometer [2502.18656].

The separable line was extended further in a later two-qubit construction. There, for a two-state ensemble \(\mathcal E\) with \(\Lambda_{\mathcal E}^{PT}=\Lambda_{\mathcal E}\), if there exist an integer \(k\ge 1\) and a Hermitian \(H\) such that
\[
H+H^{PT}=\Lambda_{\mathcal E^{\otimes k}},\qquad
4\,\mathrm{Tr}|H|\,\mathrm{Tr}|H^{PT}|<1,
\]
then
\[
p_{PPT}(\mathcal E^{(L)})\le \tfrac12+\tfrac12\bigl[4\,\mathrm{Tr}|H|\,\mathrm{Tr}|H^{PT}|\bigr]^{\frac{L-k+1}{2k}}
\to \tfrac12.
\]
An explicit example uses
\[
\rho_{0}
= \tfrac12\Bigl(\ket{0}\!\bra{0}\otimes\ket{+_{\theta}}\!\bra{+_{\theta}}
+\ket{+_{\theta}}\!\bra{+_{\theta}}\otimes\ket{0}\!\bra{0}\Bigr),
\]
\[
\rho_{1}
= \tfrac12\Bigl(\ket{1}\!\bra{1}\otimes\ket{1}\!\bra{1}
+\ket{-_{\theta}}\!\bra{-_{\theta}}\otimes\ket{-_{\theta}}\!\bra{-_{\theta}}\Bigr),
\]
with \(\ket{\pm_\theta}=\cos\theta\,\ket0\pm\sin\theta\,\ket1\) and \(0\le \theta\le \pi/3\). The paper states that this is the first one-bit hiding scheme using only two-qubit separable states, i.e. the smallest possible Hilbert-space dimension [2512.15095].

A separate explicit separable program uses group symmetry rather than low local dimension. On \(\mathbb C^d\otimes\mathbb C^d\), the states
\[
\sigma_0=\frac1d\,\Theta_0+\frac2{d^2}\,\Theta_2,\qquad
\sigma_1=\frac1{2(d-1)}\,\Theta_1+\frac1{d(d-1)}\,\Theta_3
\]
are orthogonal, separable, and invariant under partial transpose. For tensor powers, the LOCC bias satisfies
\[
\frac12\bigl\|\rho_1^{(k,d)}-\rho_0^{(k,d)}\bigr\|_{\rm LOCC}\le 2\,\mu_d^k,
\]
and the resulting \(\epsilon\)-hiding states can be realized with local dimension
\[
D\le 40\,(2/\epsilon)^{10}.
\]
This construction was presented as an explicit alternative to Werner and random-state families [2510.03538].

## 5. Multipartite, continuous-variable, Gaussian, and noisy-channel extensions

QDH generalizes naturally from bipartite to multipartite access structures. In the \(m\)-player scheme of Ha and Kim, one begins with an orthogonal \(m\)-partite ensemble \(\mathcal E\) satisfying \(p_G(\mathcal E)=1\) and
\[
\max_{X\neq G} q_X(\mathcal E)<1,
\]
where \(X\) ranges over nontrivial partitions and \(q_X\) is a partial-transpose upper bound for \(X\)-LOCC discrimination. After \(L\)-fold repetition and mod-\(n\) sum encoding, the induced hidden ensemble \(\mathcal F^{(L)}\) obeys
\[
p_X(\mathcal F^{(L)})\le \frac1n+\frac{n-1}{n}\alpha^L
\]
for every non-global partition \(X\), with \(\alpha=\max_{X\neq G}q_X(\mathcal E)\). Thus non-global decoding becomes exponentially close to random guessing, while global decoding remains perfect. The same work gives GHZ-based examples and an explicit \(t\)-bit hiding construction using \(n=2^t\) orthogonal states [2403.14363]. A different multipartite protocol concatenates blockwise subprotocols across partitions and adds remote deletion: the sender can measure the retained subsystem so that the post-abort receiver state becomes independent of the hidden value [1804.01982].

Continuous-variable QDH requires different control parameters because local Hilbert-space dimension is infinite. Lami proved an LOCC lower bound in terms of mean photon number: for \(m\) modes on one side, energy budget \(E\), global bias \(\beta_1\), and \(\gamma_E=\sqrt E+\sqrt{E+1}\),
\[
\beta_{LOCC}\ge c_m\,\frac{\beta_1^{2m+1}}{\gamma_E^{2m}}.
\]
In particular, with fixed \(E\), even orthogonal states cannot be hidden below a bias \(O(E^{-m})\). The same paper also gives a single-mode GOCC hiding example using even and odd thermal states \(\omega_\lambda^+\) and \(\omega_\lambda^-\), for which \(\beta_1=1\) but \(\beta_{GOCC}\to 0\) as \(\lambda\to 1^{-}\) [2102.01100]. Wang and Smith develop related Gaussian constructions: one bit can be hidden against Gaussian LOCC by mixtures of displaced two-mode squeezed states, and against arbitrary Gaussian measurements by two-mode thermal states in the weak-strength limit [2502.00670].

In noisy-network settings, QDH is formulated as a channel coding problem. For a quantum broadcast channel \(\mathcal N_{A\to BC}\), the bit-hiding capacity \(\kappa(\mathcal N)\) is the optimal asymptotic rate at which a joint decoder can recover a classical message while every LOCC decoder sees an output distribution close to that of a fixed separable state. A regularized upper bound is
\[
\kappa(\mathcal N)\le
\lim_{n\to\infty}\frac1n\,\kappa^{(u)}(\mathcal N^{\otimes n}),
\qquad
\kappa^{(u)}(\mathcal N)=\max\bigl[I(X;BC)-I_{\mathrm{acc,LOCC}}(X;B:C)\bigr].
\]
For pure-loss bosonic broadcast channels with coherent-state encodings of mean photon number \(N_S\), any coherent-state data-hiding protocol has rate at most
\[
g(N_S)-\log_2(1+N_S)\le \log_2 e
\]
bits per use. The same work also proves a lower bound for mictodiactic channels, defined by \(\mathcal N(I_A/d_A)=I_{BC}/(d_Bd_C)\), thereby initiating a systematic noisy-channel theory of QDH [1507.06038].

## 6. Relation to masking, private states, and quantumness of correlations

QDH for classical information must be distinguished from hiding or masking arbitrary quantum information. Zhu’s results show that in complex quantum mechanics any informationally complete set \(S\subseteq D(H)\) is antiscrambling and not maskable. This strengthens the Braunstein–Pati no-hiding theorem and the Modi et al. no-masking theorem from the full pure-state or full state space to every informationally complete subset, including 2-designs such as SICs and complete MUBs. By contrast, real quantum mechanics admits masking of all real states: if \(m\) is divisible by
\[
\kappa(d)=2^{\lfloor(d-1)/2\rfloor},
\]
one can construct an isometry
\[
M|j\rangle=(U_j\otimes I)|\Phi\rangle
\]
from a Hurwitz–Radon set \(\{U_j\}\) so that both marginals are constant for every real input state. Each subsystem must then have dimension at least \(2^{\lfloor(d-1)/2\rfloor}\), so the overhead is exponential in \(d\) [2010.07843]. This suggests that classical-bit data hiding and universal quantum-state masking are sharply different tasks.

QDH also appears as a structural ingredient in private-state cryptography. In the Bell-private representation of a private state, the shield system carries an ensemble \(\{\omega_j\}\) that hides the Bell-phase index from local observers. Kaur, Wilde, and Winter show that this hidden phase information both protects secret key and obstructs entanglement distillation; for key-correlated states, the one-way distillable entanglement is governed by a restricted relative entropy and, when the averaged shield state is separable, satisfies
\[
E_{D,\to}(\rho)=D_A^\infty(\rho\|\widehat\rho).
\]
In that sense, the key–entanglement gap is directly tied to data hiding in the shield [1609.04696].

A complementary perspective comes from disturbance-based quantifiers of ensemble quantumness. For an equal-weight hiding ensemble \(\{(1/2,\rho),(1/2,\sigma)\}\), the hiding gap obeys
\[
\Delta_H[\rho,\sigma]\le
2\,Q_{D_1,\{\Pi_A\}}\bigl[\{(1/2,\rho),(1/2,\sigma)\}\bigr].
\]
Thus, even though entanglement is not necessary for good QDH, ensemble quantumness of correlations is necessary. The paper explicitly emphasizes that a good hiding scheme may use separable or highly mixed states, but the ensemble itself must still be strongly nonclassical in the disturbance sense [1405.1640].

## 7. Robustness, limitations, and current directions

The robustness question asks whether auxiliary quantum resources can break hiding. A recent unified framework considers catalytic local discrimination and memory-assisted discrimination. If the hiding states \(\rho_0,\rho_1\) are separable, then neither an entangled catalyst returned unchanged nor reusable quantum memory can improve the optimal LOCC discrimination probability:
\[
R_{\rm c}(\rho_0,\rho_1)=R_{\rm m}(\rho_0,\rho_1)=P_{\rm LOCC}(\rho_0,\rho_1).
\]
For some entangled hiding pairs, however, a reusable quantum memory can raise the asymptotic success rate to arbitrarily close to one:
\[
P_{\rm LOCC}(\rho_0,\rho_1)\le \tfrac12+\varepsilon
\quad\text{but}\quad
R_{\rm m}(\rho_0,\rho_1)\ge 1-\delta.
\]
The resulting dichotomy identifies separable encodings as a robust strategy when adversaries may possess auxiliary quantum resources [2511.04408].

Another recent direction connects QDH to quantum state verification. A pure state is most difficult to verify in QSV if and only if it is most secure in QDH with respect to the relevant parameters, and for extremal pure states the two fundamental quantities coincide. The same work extends the correspondence from pure-state QDH to mixed-state QDH and quantum subspace verification, showing that verification sample complexity and hiding security are controlled by the same restricted-measurement geometry [2509.01281].

Several open problems remain explicit in the cited literature. One is whether the multipartite sufficient condition \(\max_{X\neq G}q_X(\mathcal E)<1\) is also necessary [2403.14363]. Another is the classification of maximal maskable subtheories in complex quantum mechanics, beyond the real subtheory; the hyperdisk conjecture is stated as open [2010.07843]. In noisy settings, extending lower bounds from mictodiactic channels to arbitrary broadcast channels remains an identified problem [1507.06038]. In resource-assisted discrimination, the largest class of hiding states secure against catalysts or memory beyond the separable case is likewise open [2511.04408]. Together these directions indicate that QDH has developed from a bipartite state-discrimination phenomenon into a broader framework connecting nonlocality without entanglement, cryptographic access structures, restricted-measurement geometry, and operational resource theory.

Source: https://www.emergentmind.com/topics/quantum-data-hiding-qdh