Censorship of quantum resources against catalytic account sharing

1. Problem Statement

The paper addresses the challenge of quantum censorship in public-domain quantum networks. In such networks, a regulatory agency may wish to restrict users to "free states" (classical or non-resourceful states) defined by a Quantum Resource Theory (QRT), while preventing the transmission of "resource states" (e.g., entanglement, coherence, or asymmetry).

Key Challenges Identified:

• Imperfect Erasure: Realistic censorship cannot perfectly erase quantum resources due to physical limitations (e.g., non-Markovian revivals, thermodynamic costs). Residual quantumness often remains.
• Distillation and Activation: Some resources can be distilled from multiple copies of free states or activated. If censorship only removes resources from single transmissions, users might recover the resource by combining multiple censored channels.
• Account Sharing (Catalysis): Independent, uncensored parties (e.g., premium users) might assist censored users by providing a "catalyst" (an auxiliary quantum state) to facilitate the restoration of the original resource state via quantum catalysis.
• Operational Definition: Existing definitions often require perfect erasure. The authors argue for a more operational definition: censorship is successful if users cannot restore the original resource state using only allowed free operations, even if some quantumness remains.

2. Methodology and Framework

The authors develop a formal framework based on Quantum Resource Theories (QRTs) to analyze censorship protocols.

• Resource-Reducing Channels ($\Omega$):
  The core mechanism is a channel $\Omega$ applied locally to each sender-receiver link. It must satisfy two conditions:

  1. Resource-Reducing: For any resource state $\rho \notin \mathcal{F}$, the output $\Omega(\rho)$ cannot be converted back to $\rho$ using free operations ($\Omega(\rho) \nrightarrow \rho$).
  2. Freeness-Preserving: For any free state $\sigma \in \mathcal{F}$, the channel leaves it unchanged ($\Omega(\sigma) = \sigma$).
     This allows free communication while degrading resource states.

• Security Definitions:

  • Secure Censorship: The protocol is secure if, for any multipartite resource state $\rho$, the censored state $\Omega^{\otimes N}(\rho)$ cannot be restored to $\rho$ by the receivers using joint free operations.
  • Breakable Censorship: The protocol fails if receivers can restore $\rho$ (either deterministically, probabilistically, or within an $\epsilon$-neighborhood).

• Account Sharing and Catalysis:
  The paper investigates scenarios where independent parties ($C_1, \dots, C_M$) assist censored users. These parties provide a catalyst $\omega_C$. The transformation is considered successful if:
  $$\text{Tr}_{C} \left[ \Lambda (\Omega^{\otimes N}(\rho) \otimes \omega_C) \right] = \rho$$
  where $\Lambda$ is a joint free operation. If the catalyst is returned unchanged, it is strict catalysis; if consumed, it is correlated catalysis.

• Specific QRTs Analyzed:
  The theory is applied to two specific resource theories:

  1. Quantum Coherence: Resources are superpositions relative to a fixed basis. Free states are diagonal (incoherent) states.
  2. Quantum Asymmetry: Resources are states lacking a shared reference frame. Free states are symmetric under a group action (twirling).

3. Key Contributions and Results

A. General Theoretical Results

• Theorem 1 (Tensor-Product Structure): If the QRT has a tensor-product structure (free states on a joint system are tensor products of local free states), censorship is secure against users coordinating with free operations unless the resource is "activatable" (e.g., Bell nonlocality, magic states). Activatable resources can be distilled from free states, making them immune to decentralized censorship.
• Theorem 2 (Swap Operation Breaks Censorship): If independent parties are available and the swap operation is a free operation, censorship is breakable. Users can swap their censored state with an uncensored party's state (acting as a catalyst) to restore the original resource.
• Existence of Protocols: Resource-reducing channels exist for affine QRTs (where free states form an affine set). For non-affine QRTs (like entanglement, which is convex but not affine), a "conditional" censorship protocol is proposed, where a classical key selects a specific affine subset of free states to filter.

B. Application to Quantum Coherence

• Secure Regime: A coherence-reducing channel $\Omega(\rho) = \epsilon \rho + (1-\epsilon)\Delta(\rho)$ (where $\Delta$ is the dephasing channel) is proposed.
  • Result: If users are restricted to Incoherent Operations (IO) or Separable Incoherent Operations (SIO) without swap capabilities, censorship is secure. Even with account sharing, if the independent parties cannot perform a swap (or if operations are restricted to separable incoherent operations), the coherence cannot be restored.
• Breakable Regime: If the network allows the swap operation (which is incoherent but non-local) between users and independent parties, censorship is breakable. The users can simply swap their degraded state with a pristine state held by the independent party.

C. Application to Quantum Asymmetry

• Secure Regime: An asymmetry-reducing channel is defined as a random unitary rotation $\Omega(\rho) = \sum p_g U_g \rho U_g^\dagger$.
  • Result: Censorship is secure against users coordinating with free covariant operations. The "frameness" (a measure of asymmetry based on entropy) strictly decreases under the channel and cannot be increased by covariant operations.
• Breakable Regime: If independent parties provide a pure state catalyst acting as a perfect reference frame, censorship is breakable.
  • Result: For finite symmetry groups, the catalyst allows the simulation of non-covariant operations, restoring the original asymmetric state perfectly. For continuous groups, perfect catalysis with pure states is impossible, but correlated catalysis (consuming the catalyst) may still allow restoration.

4. Significance and Implications

• Redefining Security: The paper shifts the paradigm of quantum security from "perfect erasure" to "operational irreversibility." It acknowledges that residual quantumness is inevitable but argues that security is maintained if that residual cannot be practically utilized.
• Catalysis as a Vulnerability: The work highlights quantum catalysis and account sharing as critical vulnerabilities in quantum network security. It demonstrates that the presence of privileged, uncensored nodes can completely undermine censorship protocols, even if the censorship channel itself is robust.
• Distinction from Cryptography: Unlike quantum cryptography (which relies on the laws of physics to prevent eavesdropping), quantum censorship is an active control mechanism. This paper provides the theoretical tools to design censorship that is robust against sophisticated collaborative attacks.
• Practical Applications: The framework is relevant for:
  • Tiered Quantum Services: Premium users accessing entanglement while regular users are restricted to classical communication.
  • Surveillance: Monitoring quantum networks to prevent the distribution of specific resources (e.g., magic states for fault-tolerant computing).
  • Error Correction: The problem of breaking censorship is mathematically equivalent to entanglement-assisted error correction, linking censorship protocols to quantum error correction codes.

Conclusion

Pinske and Mølmer establish that while censorship of quantum resources is theoretically possible through resource-reducing channels, its security is highly dependent on the operational constraints placed on the users and the availability of independent parties. Censorship is secure against local free operations but can be easily broken by quantum catalysis (account sharing) if the network topology allows for state swapping or if independent parties possess perfect reference frames. This work provides a rigorous foundation for designing secure, tiered quantum communication networks.