pith. sign in

arxiv: 2605.21274 · v1 · pith:ZLKZEIXCnew · submitted 2026-05-20 · 🪐 quant-ph

Semidefinite Programming for Optimal Quantum Cloning: A Computational Framework

Pith reviewed 2026-05-21 04:40 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum cloningsemidefinite programmingChoi-Jamiolkowski isomorphismKraus operatorsquantum channelsBB84 security analysisoptimal cloning
0
0 comments X

The pith

A semidefinite program over Choi matrices yields explicit, optimal Kraus operators for quantum cloning tasks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper reformulates the search for the best quantum cloner as an optimization over completely positive trace-preserving maps. Using the Choi-Jamiolkowski isomorphism, the cloning fidelity becomes the objective of a semidefinite program whose solution certifies global optimality through strong duality. Spectral decomposition of the optimal Choi operator then supplies concrete Kraus operators that realize the channel. The same procedure covers universal, phase-covariant, asymmetric, and entanglement cloning, as well as higher-order processes and arbitrary input distributions, and it is applied to noisy BB84 attacks.

Core claim

The framework recasts cloning optimization as a semidefinite program over completely positive trace-preserving maps using the Choi-Jamiolkowski isomorphism. It numerically certifies global optimality through primal-dual strong duality and automatically extracts operational Kraus operators from the optimal Choi matrix via spectral decomposition, providing a unified computational catalogue of explicit, implementable representations across all major cloning families.

What carries the argument

The Choi-Jamiolkowski isomorphism that converts the cloning channel into a semidefinite program whose solution directly supplies Kraus operators through spectral decomposition.

If this is right

  • The extracted Kraus operators enable direct quantitative analysis of cloning-based attacks on BB84 in depolarizing noise.
  • The method supplies implementable circuits for asymmetric and phase-covariant cloning without separate analytic derivations.
  • Higher-order cloning processes and arbitrary input-state distributions become accessible to the same numerical procedure.
  • An open-source implementation allows immediate verification and extension to new cloning variants.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same SDP template could be reused for other channel optimization tasks such as approximate state discrimination or error correction.
  • Numerical patterns in the extracted operators might suggest new closed-form expressions for cloning fidelities that remain unknown analytically.
  • In realistic noisy channels the operators could guide the design of cloning-assisted protocols that go beyond pure cloning.

Load-bearing premise

Any optimal cloning map can be represented exactly as a completely positive trace-preserving map whose Choi operator satisfies the linear constraints of the chosen cloning task.

What would settle it

Extract the Kraus operators from the SDP solution for 1-to-2 universal cloning and check whether their achieved fidelity equals the known analytic upper bound of 5/6.

read the original abstract

While algebraic derivations establish theoretical limits for quantum cloning, practical implementations require explicit operator representations that are often unavailable analytically. We present a computational framework that reformulates cloning optimization as a search over completely positive trace-preserving maps using the Choi-Jamiolkowski isomorphism and Semidefinite Programming. The framework (i) numerically certifies global optimality through primal-dual strong duality and (ii) automatically extracts operational Kraus operators from the optimal Choi matrix via spectral decomposition. We systematically treat universal, phase-covariant, asymmetric, and entanglement cloning scenarios, providing -for the first time - a unified computational catalogue of explicit, implementable Kraus representations across all major cloning families, including higher-order processes and arbitrary input state distributions. As an application, we analyse optimal cloning attacks on BB84 under depolarizing noise, demonstrating how the extracted operators enable quantitative security analysis in realistic noisy quantum channels. An open-source implementation enables community validation and extension.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript presents a computational framework that reformulates quantum cloning optimization problems (universal, phase-covariant, asymmetric, entanglement, and higher-order) as semidefinite programs over completely positive trace-preserving maps via the Choi-Jamiolkowski isomorphism. It certifies global optimality using primal-dual strong duality and extracts explicit, operational Kraus operators from the optimal Choi matrix via spectral decomposition. The framework is applied to optimal cloning attacks on BB84 under depolarizing noise, and an open-source implementation is provided to enable validation and extension.

Significance. If the central claims hold, the work supplies a practical, unified catalogue of explicit Kraus representations for major cloning families where analytical forms are often unavailable. This bridges theoretical bounds with implementable operators and supports quantitative security analysis in noisy quantum channels. The reliance on standard convex-optimization tools together with the open-source code constitutes a clear strength for reproducibility and community use.

minor comments (3)
  1. Abstract: the claim of providing 'for the first time' a unified computational catalogue should be briefly contextualized in the introduction by referencing prior numerical or SDP-based cloning studies to substantiate novelty.
  2. Numerical results section: the reported duality gaps and solver tolerances used to certify optimality should be stated explicitly so that readers can assess the rigor of the global-optimality claims.
  3. Figure captions: several figures illustrating extracted Kraus operators lack labels indicating the specific cloning scenario (e.g., universal vs. phase-covariant) and the dimension of the input space.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript, recognition of its significance for providing explicit Kraus representations across cloning families, and recommendation for minor revision. We appreciate the emphasis on reproducibility through the open-source implementation.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper recasts quantum cloning tasks as SDPs over CPTP maps via the Choi-Jamiolkowski isomorphism, then uses primal-dual duality for optimality certification and spectral decomposition for Kraus extraction. This is a direct application of standard, externally validated convex optimization tools in quantum information; the objective and constraints encode the cloning fidelity and physicality conditions without any reduction to self-defined quantities, fitted parameters renamed as predictions, or load-bearing self-citations. The derivation chain remains self-contained against external benchmarks and does not import uniqueness or ansatzes from prior author work.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on standard quantum information and convex optimization results rather than new axioms or fitted parameters introduced in the paper.

axioms (2)
  • standard math Choi-Jamiolkowski isomorphism provides a one-to-one correspondence between CPTP maps and Choi matrices
    Invoked to reformulate cloning optimization as an SDP over Choi matrices.
  • standard math Strong duality holds for the semidefinite program, certifying global optimality
    Used to numerically certify optimality of the extracted maps.

pith-pipeline@v0.9.0 · 5677 in / 1240 out tokens · 34985 ms · 2026-05-21T04:40:01.492415+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

38 extracted references · 38 canonical work pages

  1. [1]

    Nature 299(5886), 802–803 (1982) https://doi.org/10.1038/299802a0

    Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802–803 (1982) https://doi.org/10.1038/299802a0

  2. [2]

    Electro nic transport in two-dimensional graphene

    Gisin, N., Ribordy, G., Tittel, W., Zbinden, H.: Quantum cryptography. Reviews of Modern Physics74(1), 145–195 (2002) https://doi.org/10.1103/RevModPhys. 74.145

  3. [3]

    Physical Review A54, 1844–1852 (1996) https://doi.org/10.1103/PhysRevA.54

    Buˇ zek, V., Hillery, M.: Quantum copying: Beyond the no-cloning theorem. Physical Review A54, 1844–1852 (1996) https://doi.org/10.1103/PhysRevA.54. 1844

  4. [4]

    Werner, R.F.: Optimal cloning of pure states. Phys. Rev. A58, 1827–1832 (1998) https://doi.org/10.1103/PhysRevA.58.1827

  5. [5]

    Journal of Mathematical Physics40(7), 3283–3299 (1999) https://doi.org/10

    Keyl, M., Werner, R.F.: Optimal cloning of pure states, testing single clones. Journal of Mathematical Physics40(7), 3283–3299 (1999) https://doi.org/10. 1063/1.532887

  6. [6]

    Physical Review A62, 012302 (2000) https://doi.org/10.1103/ PhysRevA.62.012302

    Bruß, D., Cinchetti, M., D’Ariano, G.M., Macchiavello, C.: Phase-covariant quan- tum cloning. Physical Review A62, 012302 (2000) https://doi.org/10.1103/ PhysRevA.62.012302

  7. [7]

    Physical Review A67, 042306 (2003) https://doi.org/10.1103/ PhysRevA.67.042306

    D’Ariano, G.M., Macchiavello, C.: Optimal phase-covariant cloning for qubits and qutrits. Physical Review A67, 042306 (2003) https://doi.org/10.1103/ PhysRevA.67.042306

  8. [8]

    Cerf, N.J.: Pauli cloning of a quantum bit. Phys. Rev. Lett.84, 4497–4500 (2000) https://doi.org/10.1103/PhysRevLett.84.4497

  9. [9]

    Cerf, N.J., Iblisdir, S.: Optimal n-to-mcloning of conjugate quantum variables. Phys. Rev. A62, 040301 (2000) https://doi.org/10.1103/PhysRevA.62.040301 19

  10. [10]

    Journal of Modern Optics47(2-3), 187–209 (2000) https://doi.org/10.1080/09500340008244036

    Cerf, N.J.: Asymmetric quantum cloning in any dimension. Journal of Modern Optics47(2-3), 187–209 (2000) https://doi.org/10.1080/09500340008244036

  11. [11]

    Lamoureux, L.-P., Navez, P., Fiur´ aˇ sek, J., Cerf, N.J.: Cloning the entanglement of a pair of quantum bits. Phys. Rev. A69, 040301 (2004) https://doi.org/10. 1103/PhysRevA.69.040301

  12. [12]

    Physics Reports544(3), 241–322 (2014) https://doi.org/10.1016/j.physrep.2014.06.004

    Fan, H., Wang, Y.-N., Jing, L., Yue, J.-D., Shi, H.-D., Zhang, Y.-L., Mu, L.- Z.: Quantum cloning machines and the applications. Physics Reports544(3), 241–322 (2014) https://doi.org/10.1016/j.physrep.2014.06.004

  13. [13]

    Navascu´ es, M., Owari, M., Plenio, M.B.: Complete criterion for separability detec- tion. Phys. Rev. Lett.103, 160404 (2009) https://doi.org/10.1103/PhysRevLett. 103.160404

  14. [14]

    Contemporary Physics41(6), 401–424 (2000) https://doi.org/10.1080/00107510010002599

    Chefles, A.: Quantum state discrimination. Contemporary Physics41(6), 401–424 (2000) https://doi.org/10.1080/00107510010002599

  15. [15]

    Piani, M., Watrous, J.: All entangled states are useful for channel discrimination. Phys. Rev. Lett.102, 250501 (2009) https://doi.org/10.1103/PhysRevLett.102. 250501

  16. [16]

    In: Iwama, K., Kawano, Y., Murao, M

    Molina, A., Vidick, T., Watrous, J.: Optimal counterfeiting attacks and gen- eralizations for wiesner’s quantum money. In: Iwama, K., Kawano, Y., Murao, M. (eds.) Theory of Quantum Computation, Communication, and Cryptogra- phy, pp. 45–64. Springer, Berlin, Heidelberg (2013). https://doi.org/10.1007/ 978-3-642-35656-8 4

  17. [17]

    Physical Review A65, 030302 (2002) https://doi.org/10.1103/PhysRevA.65.030302

    Audenaert, K., De Moor, B.: Optimizing quantum operations. Physical Review A65, 030302 (2002) https://doi.org/10.1103/PhysRevA.65.030302

  18. [18]

    doi:10.1017/9781316848142 , langid =

    Watrous, J.: The Theory of Quantum Information, 1st edn. Cambridge University Press, Cambridge (2018). https://doi.org/10.1017/9781316848142

  19. [19]

    Cambridge University Press, Cambridge (2017)

    Wilde, M.M.: Quantum Information Theory, 2nd edn. Cambridge University Press, Cambridge (2017). https://doi.org/10.1109/isit44484.2020.9174425

  20. [20]

    Boyd and L

    Boyd, S., Vandenberghe, L.: Convex Optimization, 1st edn. Cambridge university press, Cambridge (2004). https://doi.org/10.1017/CBO9780511804441

  21. [21]

    In: Tutorials in Operations Research: Emerging and Impactful Topics in Operations Research, pp

    Siddhu, V., Tayur, S.: Five starter pieces: Quantum information sci- ence via semi-definite programs. In: Tutorials in Operations Research: Emerging and Impactful Topics in Operations Research, pp. 57–

  22. [22]

    https://doi.org/10.1287/educ.2022.0243

    INFORMS, ??? (2022). https://doi.org/10.1287/educ.2022.0243 . https://pubsonline.informs.org/doi/abs/10.1287/educ.2022.0243 20

  23. [23]

    2053-2563

    Skrzypczyk, P., Cavalcanti, D.: Semidefinite Programming in Quantum Informa- tion Science. 2053-2563. IOP Publishing, ??? (2023). https://doi.org/10.1088/ 978-0-7503-3343-6 .https://doi.org/10.1088/978-0-7503-3343-6

  24. [24]

    Journal of Physics A: Mathematical and Theoretical57(16), 163002 (2024) https://doi.org/ 10.1088/1751-8121/ad2b85

    Mironowicz, P.: Semi-definite programming and quantum information. Journal of Physics A: Mathematical and Theoretical57(16), 163002 (2024) https://doi.org/ 10.1088/1751-8121/ad2b85

  25. [25]

    https://cvxr.com/cvx (2020)

    Grant, M., Boyd, S.: CVX: Matlab Software for Disciplined Convex Programming, version 2.2. https://cvxr.com/cvx (2020)

  26. [26]

    https://qetlab.com (2016)

    Johnston, N.: QETLAB: A MATLAB toolbox for quantum entanglement, version 1.0. https://qetlab.com (2016). https://doi.org/10.5281/zenodo.44637

  27. [27]

    GitHub (2026)

    Hettel, J.: Quantum Cloning SDP Framework. GitHub (2026)

  28. [28]

    Journal of Mathematical Physics 45(6), 2171–2180 (2004) https://doi.org/10.1063/1.1737053

    Renes, J.M., Blume-Kohout, R., Scott, A.J., Caves, C.M.: Symmetric infor- mationally complete quantum measurements. Journal of Mathematical Physics 45(6), 2171–2180 (2004) https://doi.org/10.1063/1.1737053

  29. [29]

    Physical Review A65, 012304 (2001) https://doi.org/10

    Fan, H., Matsumoto, K., Wang, X.-B., Wadati, M.: Quantum cloning machines for equatorial qubits. Physical Review A65, 012304 (2001) https://doi.org/10. 1103/PhysRevA.65.012304

  30. [30]

    Journal of Physics A: Mathematical and General34(35), 6815–6821 (2001) https: //doi.org/10.1088/0305-4470/34/35/307

    Bruß, D., Macchiavello, C.: Optimal cloning for two pairs of orthogonal states. Journal of Physics A: Mathematical and General34(35), 6815–6821 (2001) https: //doi.org/10.1088/0305-4470/34/35/307

  31. [31]

    Quantum cryptography: Public key distribution and coin tossing

    Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, vol. 175. New York, p. 8 (1984). https://doi.org/ 10.48550/arXiv.2003.06557 . IEEE

  32. [32]

    Pigott, B., Campolongo, E.G., Routray, H., Khan, A.: Eavesdropping on the BB84 protocol using phase-covariant cloning: Experimental results. Int. J. Quant. Inf.23(07), 2550028 (2025) https://doi.org/10.1142/S0219749925500285 arXiv:2409.16284 [quant-ph]

  33. [33]

    Scarani, H

    Scarani, V., Bechmann-Pasquinucci, H., Cerf, N.J., Duˇ sek, M., L¨ utkenhaus, N., Peev, M.: The security of practical quantum key distribution. Review of Modern. Physics81, 1301–1350 (2009) https://doi.org/10.1103/RevModPhys.81.1301

  34. [34]

    Fuchs, C.A., Gisin, N., Griffiths, R.B., Niu, C.-S., Peres, A.: Optimal eavesdrop- ping in quantum cryptography. i. information bound and optimal strategy. Phys. Rev. A56, 1163–1172 (1997) https://doi.org/10.1103/PhysRevA.56.1163 21

  35. [35]

    International Journal of Quantum Informa- tion06(supp01), 765–771 (2008) https://doi.org/10.1142/S0219749908004080 https://doi.org/10.1142/S0219749908004080

    Pirandola, S.: Symmetric collective attacks for the eavesdropping of sym- metric quantum key distribution. International Journal of Quantum Informa- tion06(supp01), 765–771 (2008) https://doi.org/10.1142/S0219749908004080 https://doi.org/10.1142/S0219749908004080

  36. [36]

    Bruß, D.: Optimal eavesdropping in quantum cryptography with six states. Phys. Rev. Lett.81, 3018–3021 (1998) https://doi.org/10.1103/PhysRevLett.81.3018

  37. [37]

    Quantum Information and Computation1(2), 81–94 (2001) https://doi

    Lo, H.-K.: Proof of unconditional security of six-state quatum key distribution scheme. Quantum Information and Computation1(2), 81–94 (2001) https://doi. org/10.26421/QIC1.2-4

  38. [38]

    Buscemi, F., D’Ariano, G.M., Macchiavello, C.: Economical phase-covariant cloning of qudits. Phys. Rev. A71, 042327 (2005) https://doi.org/10.1103/ PhysRevA.71.042327 22 Appendix A Choi-Jamio lkowski Inner Product Identity In this section, we derive the identity used to link the channel action to the Choi matrix: ⟨ψ|E(|ϕ⟩ ⟨ϕ|)|ψ⟩=⟨ϕ ∗ ⊗ψ|J(E)|ϕ ∗ ⊗ψ⟩(A1) ...