We determine asymptotic global fidelities of cloning generic mixed states with simple (non-degenerate) full-rank spectra. In fixed dimension
d, let
n inputs and
mn outputs satisfy
mn/n→γ>1. For a known simple full-rank spectrum
p1>⋯>pd>0, we prove that the optimal root fidelity between the entire output and the product target state is $$
F_\rm{orb}(γ,p)
=\prod_{i<j}
\frac{\sqrtγ+\sqrt{q_{ij}(γ-1+q_{ij})}}
{γ+q_{ij}},
\qquad q_{ij}=\frac{p_j}{p_i}. $$ When the spectrum is unknown, one spectrum-independent cloner attains $$
F_\rm{univ}(γ,p)
=\left(\frac{2\sqrtγ}{1+γ}\right)^{(d-1)/2}
F_\rm{orb}(γ,p), $$ uniformly on compact subsets of the simple full-rank chamber and is minimax optimal. The two factors quantify spectral and eigenbasis uncertainty. Our channels combine classical processing of Schur--Weyl labels with a covariant Cartan-sector channel. Local asymptotic normality and a Gaussian fidelity bound against arbitrary channels yield the converses. For flat projector states
ρ=P/r, with
P a rank-
r orthogonal projector, we separately prove the optimum
γ−r(d−r)/2. Furthermore, we estimate the exact asymptotic fidelity of purify--clone--trace (PCT), and show that our cloners strictly outperform PCT at every fixed gain for simple full-rank spectra and rank-
r projector states with
1<r<d.
Given an ensemble of mixed qubit states, it is possible to increase the purity of the constituent states using a procedure known as state purification. The reverse operation, which we refer to as dilution, produces a larger ensemble, while reducing the purity level of the systems. In this paper we find asymptotically optimal procedures for purification and dilution of an ensemble of independently and identically distributed mixed qubit states, for some given input and output purities and an asymptotic output rate. Our solution involves using the statistical tool of local asymptotic normality, which recasts the qubit problem in terms of attenuation and amplification of a single-mode displaced Gaussian state. Therefore, to obtain the qubit solutions, we must first solve the analogous problems in the Gaussian setup. We provide full solutions to all of the above for the (global) trace-norm figure of merit.
Quantum state cloning is the task of approximately producing additional copies of an unknown quantum state from a finite number of input copies. The optimal cloning fidelity is known exactly for pure states, but no comparable characterization is known for general mixed states. We determine the optimal asymptotic copy complexity for
d-dimensional states of rank at most
r: producing
M additional copies with worst-case fidelity at least
1−ε requires and is achievable with
N=Θ(Mrd/ε) input copies. Remarkably, the lower bound already holds for a family of states with a fixed flat spectrum, while the matching upper bound is achieved by random purification followed by optimal pure-state cloning. For
M=1, we further show that high-fidelity tomography can be coherently converted into cloning with comparable error, revealing an operational origin of the matching cloning and tomography complexities.
The cloning of conjugate continuous quantum variables is analyzed based on the concept of Gaussian cloning machines, i.e., transformations that yield copies that are Gaussian mixtures centered on the state to be copied. The optimality of Gaussian cloning machines that transform N identical input states into M output states is investigated, and bounds on the fidelity of the process are derived via a connection with quantum estimation theory. In particular, the optimal N-to-
M cloning fidelity for coherent states is found to be equal to $MN/(MN+M\ensuremath{-}N).$
The no-cloning theorem is a cornerstone result in quantum mechanics that forbids copying of general quantum information. More quantitatively, even given
N copies of an unknown state, any channel producing an
(N+1)-copy state incurs a nonzero trace-distance error on some inputs. Turning this around, one can ask about the sample complexity of approximate
N→N+1 cloning: for a desired small error
ε, what
N suffices? For arbitrary pure states on a Hilbert space
H, the answer is
N≃dimH/ε - astronomically large for most
H of interest. What if the input is promised to lie in a structured family? We examine a range of families fundamental to many-body physics and quantum information:
n-mode fermionic Gaussian and Slater states,
n-mode bosonic Gaussian states, and qudit phase states. For fermions, we construct optimal cloning channels, reducing the complexity from exponential to polynomial in
n. For bosonic Gaussian states, we construct an explicit cloner that certifies polynomial complexity, without any constraint on the energy of the state; this channel, however, is not optimal in general. The fermionic and bosonic results follow from a single representation-theoretic framework, which generalizes previous work by Werner and by Chiribella and Yang; it also yields the cloners' unitary implementation. Furthermore, we explain why for many families the cloning complexity is linear in the dimension of the family manifold, via a controlled saddle-point evaluation of the frame potential at high
N. The same calculation accounts for the analogous scaling of tomography complexity. The above framework does not cover phase states; for these we give an independent construction of a channel with optimal cloning fidelity. Our work complements recent results on cloning stabilizer states.
We analyze in details a scheme for cloning of Gaussian states based on linear optical components and homodyne detection recently demonstrated by Andersen et al. [Phys. Rev. Lett. 94, 240503 (2005)]. The input-output fidelity is evaluated for a generic (pure or mixed) Gaussian state taking into account the effect of nonunit quantum efficiency and unbalanced mode mixing. In addition, since in most quantum information protocols the covariance matrix of the set of input states is not perfectly known, we evaluate the average cloning fidelity for classes of Gaussian states with the degree of squeezing and the number of thermal photons being only partially known.