Optimal pure state cloning and transposition are complementary channels

1. Problem Statement

The paper addresses two fundamental limitations in quantum information theory:

1. No-Cloning Theorem: Unknown quantum states cannot be perfectly copied.
2. No-Transposition Theorem: The transposition map ($T(\rho) = \rho^T$) is positive but not completely positive (P but not CP), meaning it cannot be physically implemented as a quantum channel.

The authors investigate the optimal approximation of these tasks in the multi-copy regime. Specifically, they consider:

• $N \to K$ Transposition: Transforming $N$ copies of an arbitrary $d$-dimensional quantum state into $K$ copies of its transposed state.
• $N \to N+K$ Cloning: Transforming $N$ copies of a state into $N+K$ copies.

The core question is: What is the optimal fidelity for these transformations, and is there a fundamental relationship between the optimal transposition and optimal cloning channels?

2. Methodology

The authors employ a combination of quantum information theory, representation theory, and semidefinite programming (SDP).

• Covariance and Symmetry: They restrict the optimization to covariant quantum channels that respect unitary covariance ($U^{\otimes N} \to U^{\otimes K}$) and permutation symmetry. They prove that restricting the search to this symmetric subspace does not lose optimality for the average fidelity.
• Semidefinite Programming (SDP): The optimization of average fidelity is formulated as an SDP. By utilizing strong duality, they derive tight upper bounds on the achievable fidelity.
• Representation Theory: The analysis heavily relies on the Schur-Weyl duality between the unitary group $U(d)$ and the symmetric group $S_N$. They utilize Young diagrams, Clebsch-Gordan transforms, and Jucys-Murphy elements to characterize the structure of the optimal channels and the spectrum of relevant operators.
• Stinespring Dilation: To establish the relationship between cloning and transposition, they construct an explicit isometry (Stinespring dilation) that simultaneously generates both channels as complementary outputs.

3. Key Contributions and Results

A. Optimal $N \to K$ Pure State Transposition

The authors determine the optimal average fidelity for approximating the transposition map on pure states.

• Optimal Fidelity: The maximum average fidelity is given by:
  $$F_{\text{opt}} = \frac{d_S^N}{d_S^{N+K}}$$
  where $d_S^M = \binom{M+d-1}{d-1}$ is the dimension of the symmetric subspace of $M$ qudits.
• Optimal Strategy: The optimal channel is an entanglement-breaking channel based on an estimation strategy (specifically, the "Hayashi measurement"). The channel estimates the input state from the $N$ copies and prepares $K$ copies of the transposed estimated state.
• Reduced State Structure: For any single output copy, the state takes the form of a depolarized transposed state:
  $$\sigma = \eta |\psi\rangle\langle\psi|^T + (1-\eta)\frac{\mathbb{I}}{d}$$
  where the visibility is $\eta = \frac{N}{N+d}$. This is independent of the number of output copies $K$.

B. Complementarity of Cloning and Transposition

The central theoretical result is the proof that optimal universal symmetric cloning and optimal pure-state transposition are complementary channels.

• Theorem: There exists a single isometric channel $V$ such that:
  • Tracing out the "transposition" output yields the optimal $N \to N+K$ cloning channel ($W_{CP}$).
  • Tracing out the "cloning" output yields the optimal $N \to K$ transposition channel ($T_{CP}$).
• Significance: This generalizes the concept of "clones and anti-clones" (previously known for qubits $1 \to 2$) to arbitrary dimensions $d$ and arbitrary copy numbers $N, K$. It implies that the noise introduced in the cloning process is exactly the information required to perform the optimal transposition, and vice versa. Both tasks can be realized simultaneously by a single physical operation.

C. Quantum Circuit Implementation

The authors present an explicit quantum circuit that simultaneously implements optimal cloning and transposition.

• Components: The circuit utilizes the Schur transform ($U_{Sch}$) to decompose the input into irreducible representations of $U(d) \times S_N$, followed by an inverse Clebsch-Gordan transform ($CG^\dagger$) to distribute the state, and a final Schur transform to map back to the computational basis.
• Efficiency: While the explicit CG transform used is not gate-efficient (complexity scales poorly with $d$), the authors note that recent techniques (e.g., from Ref [53]) could potentially reduce the complexity to $\text{poly}(N, K, \log d)$.

D. Mixed-State Transposition ($N \to 1$)

The paper extends the analysis to mixed input states for the $N \to 1$ transposition task.

• Metric: Instead of fidelity, they use white noise visibility ($\eta$) as the figure of merit, defined by $C(\rho^{\otimes N}) = \eta \rho^T + (1-\eta)\frac{\mathbb{I}}{d}$.
• Optimal Visibility: They derive the exact range of $\eta$ for which a completely positive map exists:
  $$-\frac{1}{d-1} \leq \eta \leq \eta_{\max}$$
  where
  $$\eta_{\max} = \begin{cases} \frac{1}{d+1} & \text{if } N \leq d-1 \\ \frac{N}{d(d-1)+N} & \text{if } N \geq d-1 \end{cases}$$
• Comparison: For $d > 2$ and $N > 1$, the optimal visibility for mixed states is strictly lower than that for pure states, highlighting that the constraints for mixed states are more restrictive due to the larger linear space spanned by $\rho^{\otimes N}$.

4. Significance

• Unification of Tasks: The discovery that optimal cloning and transposition are complementary channels provides a deep structural insight into quantum information processing. It suggests that the "cost" of cloning (the noise in the environment) is intrinsically linked to the ability to perform non-CP operations like transposition.
• Structural Physical Approximation (SPA): The results provide the optimal SPA for state transposition in the multi-copy regime, which is crucial for entanglement detection (via the PPT criterion) and quantum state estimation.
• Telecloning: The complementarity result offers new insights into telecloning protocols, suggesting that the state remaining with the sender (Alice) after a telecloning process corresponds to the output of the optimal transposition channel.
• General Framework: The methodology using representation theory and SDP provides a robust framework for analyzing other unitary-equivariant and permutation-invariant quantum channels, potentially extending to unitary cloning and conjugation.

In summary, the paper establishes a rigorous mathematical link between two seemingly distinct quantum tasks (cloning and transposition), proving they are two sides of the same coin in the optimal multi-copy regime, and provides explicit protocols and performance bounds for their implementation.