arXiv:2610.06723
Approximate cloning of structured pure states
Yaroslav Herasymenko, Junqiao Lin, Philip Verduyn Lunel, Dmitry Grinko
Abstract
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\rightarrow N+1$ cloning: for a desired small error $ε$, what $N$ suffices? For arbitrary pure states on a Hilbert space $H$, the answer is $N\simeq \dim H/ε$ - 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.
AI Summary
The paper studies the sample complexity of approximate $N\to N+1$ cloning when an unknown pure state belongs to a structured family, measuring error against the entire ideal output. Arbitrary $D$-dimensional pure states require $\Theta(D/\epsilon)$ inputs at trace error $\epsilon$; the question is how structural promises reduce this cost. A representation-theoretic construction extends projector-based universal cloning to “resolving orbits,” whose tensor-power spans carry irreducible, square-integrable representations. Its fidelity is $d_N/d_{N+K}$, with $d_N$ a formal degree, and its trace error is exactly one minus this ratio. Amenability guarantees unrestricted optimality. Weyl dimension formulas yield optimal complexities $n(n-1)/(2\epsilon)[1+O(\epsilon)]$ for fermionic Gaussian states and $q(n-q)/\epsilon[1+O(\epsilon)]$ for Slater determinants. For energy-unrestricted centered bosonic Gaussian states, a smaller solvable symmetry group gives complexity $\Theta_\epsilon(n)$ at fixed error, with joint bounds $\Omega(n/\epsilon)$ and $O(\min\{n^2/\epsilon,n/\epsilon^2\})$. For general pure bosonic Gaussian states, the bounds remain $\Omega(n/\epsilon)$ and $O(n^2/\epsilon)$. Independently, phase covariance, occupation-number balancing and matching semidefinite-program certificates establish fidelity-optimal phase-state cloners, with one-copy fidelity complexity $\Theta(d\log(1/\delta)+\sqrt{d/\delta})$. A controlled saddle-point calculation explains canonical infidelity $m/(2N)[1+O(m/N)]$ for suitable $m$-dimensional families. Complementary channels connect cloning to optimal conjugation and estimation. Exact trace-distance optima remain unresolved for phase and squeezed states; full bosonic optimality and efficient elementary-gate implementations also remain open. The dimension law concerns canonical cloners, which can be suboptimal for bosons.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 44 pages main text, 40 pages appendices