Optimal copy complexity of quantum state cloning

• URL: http://arxiv.org/abs/2608.24484v1
• Date: Tue, 25 Aug 2026 12:29:10 GMT
• Title: Optimal copy complexity of quantum state cloning
• Abstract summary: We show the optimal complexity for $d$-dimensional states of at least $1-varepsilon$.<n>We also show that high-fidelity tomography can be coherently converted into cloning with comparable error.
• Score: 0.16992697670497803
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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-\varepsilon$ requires and is achievable with $N=Θ(Mrd/\varepsilon)$ 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.

Related papers

• Optimal cloning of mixed states [0.6999740786886536]
  We consider the problem of approximate cloning of quantum states.<n>We show that one must use $n = (krd/varepsilon)$ copies to clone rank-$r$ states.
  arXiv  Detail & Related papers  (2026-08-27T16:03:42Z)
• Sample Complexity of Multicalibration for Multilevel Properties [52.27687531970317]
  We study multicalibration for a sequence of $k$ properties in which each property is identifiable once the preceding properties are fixed.<n>Even with only polylogarithmically many binary groups, achieving multicalibration error $varepsilon$ requires $widetilde(varepsilon-(k+2))$ samples.
  arXiv  Detail & Related papers  (2026-08-04T23:38:54Z)
• Cloning is as Hard as Learning for Stabilizer States [2.3784921682219635]
  We show that for $n$-qubit stabilizer states, the optimal sample complexity of cloning is $(n)$.<n>Our results provide a more fine-grained perspective on No-Cloning theorems, opening up connections from foundations to quantum learning theory and quantum cryptography.
  arXiv  Detail & Related papers  (2026-04-16T17:41:16Z)
• Optimal pure state cloning and transposition are complementary channels [0.4666493857924358]
  State cloning and state transposition are fundamental transformations which, despite being desirable, cannot be perfectly realised.<n>We show that the best physically allowed realisation of both transformations arises from a single physical process described by an isometry.
  arXiv  Detail & Related papers  (2026-03-24T18:11:29Z)
• Cloning Games, Black Holes and Cryptography [50.022147589030304]
  We introduce a new toolkit for analyzing cloning games.<n>This framework allows us to analyze a new cloning game based on binary phase states.<n>We show that the binary phase variantally optimal bound offers quantitative insights into information scrambling in idealized models of black holes.
  arXiv  Detail & Related papers  (2024-11-07T14:09:32Z)
• An optimal tradeoff between entanglement and copy complexity for state tomography [24.737530909081915]
  We study tomography in the natural setting where one can make measurements of $t$ copies at a time. This is the first smooth entanglement-copy protocol known for any quantum learning task. A key insight is to use SchurilonWeyl sampling not to estimate the spectrum of $rho$, but to estimate the deviation of $rho$ from the maximally mixed state.
  arXiv  Detail & Related papers  (2024-02-26T07:18:57Z)
• A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization [53.044526424637866]
  In this paper we consider finding an approximate second-order stationary point (SOSP) that minimizes a twice different subject general non conic optimization. In particular, we propose a Newton-CG based-augmentedconjugate method for finding an approximate SOSP.
  arXiv  Detail & Related papers  (2023-01-10T20:43:29Z)
• The Asymmetric Quantum Cloning Region [1.2891210250935143]
  We study the general case of $1 to N$ asymmetric cloning. We characterize, for all Hilbert space dimensions and number of clones, the set of all possible clone qualities.
  arXiv  Detail & Related papers  (2022-09-24T12:52:50Z)
• Self-healing of Trotter error in digital adiabatic state preparation [52.77024349608834]
  We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as $mathcal O(T-2 delta t2)$ instead of $mathcal O(T2delta t2)$ expected from general Trotter error bounds. This result suggests a self-healing mechanism and explains why, despite increasing $T$, infidelities for fixed-$delta t$ digitized evolutions still decrease for a wide variety of Hamiltonians.
  arXiv  Detail & Related papers  (2022-09-13T18:05:07Z)
• Quantum Sequential Hypothesis Testing [1.1545092788508222]
  We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement.
  arXiv  Detail & Related papers  (2020-11-21T11:24:07Z)
• Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations [54.42518331209581]
  We find an algorithm which finds. epsilon$-approximate stationary point (with $|nabla F(x)|le epsilon$) using. $(epsilon,gamma)$surimate random random points. Our lower bounds here are novel even in the noiseless case.
  arXiv  Detail & Related papers  (2020-06-24T04:41:43Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.