Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.21274

Semidefinite Programming for Optimal Quantum Cloning: A Computational Framework

Jörg Hettel

quant-phSubmitted May 20, 2026• Announced May 21, 2026• 1 citation
arXivHTMLPDF

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.

Related papers

Optical Quantum Cloning - a Review

Nicolas J. Cerf, Jaromír Fiurášek

After a brief introduction to the quantum no-cloning theorem and its link with the linearity and causality of quantum mechanics, the concept of quantum cloning machines is sketched, following, whenever possible, the chronology of the main results. The important classes of quantum cloning machines are reviewed, in particular state-independent and state-dependent cloning machines. The 1-to-2 cloning problem is then studied from a formal point of view, using the isomorphism between completely positive maps and operators, which leads to the so-called double-Bell ansatz. This also yields an efficient numerical approach to quantum cloning, based on semidefinite programming methods. The derivation of the optimal N-to-M universal cloning machine in d dimensions is then detailed, as well as the notion of asymmetric cloning machines. In the second part of this review, the optical implementation of cloning machines is considered. It is shown that the universal cloning of photons can be achieved by parametric amplification of light or by symmetrization via the Hong-Ou-Mandel effect. The various experimental demonstrations of quantum cloning machines are reviewed. The cloning of orthogonally polarized photons is also considered, as well as the asymmetric and phase-covariant cloning of photons. Finally, the extension of quantum cloning to continuous variables is analyzed. The optimal cloning of coherent states of light by phase-insensitive amplification is explained, as well as the experimental realization of continuous-variable quantum cloning with linear optics, measurement, and feed-forward operations.

arXiv:quant-ph/0512172•Dec 21, 2005•26 citations

Semidefinite Programming for Quantum Channel Learning

Mikhail Gennadievich Belov, Victor Victorovich Dubov, Vadim Konstantinovich Ivanov +3 more

The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.

cs.LGCross-listedarXiv:2601.12502•Physical review. E•Jan 20, 2026•0 citations

Optimizing completely positive maps using semidefinite programming

Koenraad M. R. Audenaert, Bart De Moor

Recently, a lot of attention has been devoted to finding physically realizable operations that realize as closely as possible certain desired transformations between quantum states, e.g., quantum cloning, teleportation, quantum gates, etc. Mathematically, this problem boils down to finding a completely positive trace-preserving (CPTP) linear map that maximizes the (mean) fidelity between the map itself and the desired transformation. In this communication, we want to draw attention to the fact that this problem belongs to the class of so-called semidefinite programming (SDP) problems. As SDP problems are convex, it immediately follows that they do not suffer from local optima. Furthermore, this implies that the numerical optimization of the CPTP map can, and should, be done using methods from the well-established SDP field, as these methods exploit convexity and are guaranteed to converge to the real solution. Finally, we show how the duality inherent to convex and SDP problems can be exploited to prove analytically the optimality of a proposed solution. We give an example of how to apply this proof method by proving the optimality of Hardy and Song's optimal qubit $\ensuremath{\theta}$ shifter (e-print quant-ph/0102100).

arXiv:quant-ph/0109155•Physical Review A•Feb 20, 2002•70 citations

Design and Optimization of Adaptive Diversity Schemes in Quantum MIMO Channels

Shehbaz Tariq, Symeon Chatzinotas

As quantum networks evolve toward a full quantum Internet, reliable transmission in quantum multiple-input multiple-output (QuMIMO) settings becomes essential, yet remains difficult due to noise, crosstalk, and the mixing of quantum information across subchannels. To improve reliability in such settings, we study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver. An input qubit is encoded into M approximate clones, transmitted over an N x N multi-mode quantum channel, and recovered through a purification map optimized using available channel state information (CSI). For the given cloning asymmetry parameters, we derive an eigenvalue-based expression for the decoder-optimal end-to-end fidelity in the form of a generalized Rayleigh quotient, which enables efficient tuning of the cloner without iterative optimization. As a design choice, we employ semidefinite program (SDP) to construct the purification map for only a targeted success probability p. This numerical framework is used to study fixed-noise, dimension-scaling noise, and stochastic depolarization regimes. A cloning asymmetry index is introduced to quantify the distribution of quantum information across the multiple subchannels across these operating conditions. The results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions. This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.

quant-pharXiv:2511.15563•npj Quantum Information•Nov 20, 2025•2 citations

Process-optimized phase-covariant quantum cloning

Chloe Kim, Eric Chitambar

After the appearance of the no-cloning theorem, approximate quantum cloning machines (QCMs) has become a well-studied subject in quantum information theory. Among several measures to quantify the performance of a QCM, single-qudit fidelity and global fidelity have been most widely used. In this paper we compute the optimal global fidelity for phase-covariant cloning machines via semidefinite programming optimization, thereby completing a remaining gap in the previous results on QCMs. We also consider optimal simulations of the cloning and transpose cloning map, both by a direct optimization and by a composition of component-wise optimal QCMs. For the cloning map the composition method is suboptimal whereas for the transpose cloning map the method is asymptotically optimal.

arXiv:2107.03042•Physical Review A•Aug 9, 2022•2 citations

Asymmetric quantum cloning on orthogonal orbits and four-mode fermionic states

Piotr Ćwikliński, Michał Studziński

In this work, we study asymmetric $(1\to2)$ quantum cloning for pure states belonging to orbits generated by the orthogonal group. For every dimension $(d\geq3)$, we determine the full region of achievable pairs of average single-copy fidelities. Using orthogonal covariance and the Brauer algebra, we reduce the optimization over all CPTP maps to a finite-dimensional spectral problem and construct explicit optimal cloning channels. We then apply the general results to four-mode fermionic states in the even-parity sector. Using triality, we identify the fixed-concurrence fermionic families with the orthogonal orbits considered in the first part of the paper. In particular, for pure Gaussian states we show that the symmetric locally optimal cloner is unique. We also compare local and global cloning and find that the channel optimal for the joint two-copy fidelity is different from the one optimal for the single-copy fidelities. Finally, we show that the locally optimal cloner cannot be implemented using only operations which preserve fermionic Gaussian states.

quant-pharXiv:2609.22047•Sep 21, 2026•0 citations
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.
After a brief introduction to the quantum no-cloning theorem and its link with the linearity and causality of quantum mechanics, the concept of quantum cloning machines is sketched, following, whenever possible, the chronology of the main results. The important classes of quantum cloning machines are reviewed, in particular state-independent and state-dependent cloning machines. The 1-to-2 cloning problem is then studied from a formal point of view, using the isomorphism between completely positive maps and operators, which leads to the so-called double-Bell ansatz. This also yields an efficient numerical approach to quantum cloning, based on semidefinite programming methods. The derivation of the optimal N-to-M universal cloning machine in d dimensions is then detailed, as well as the notion of asymmetric cloning machines. In the second part of this review, the optical implementation of cloning machines is considered. It is shown that the universal cloning of photons can be achieved by parametric amplification of light or by symmetrization via the Hong-Ou-Mandel effect. The various experimental demonstrations of quantum cloning machines are reviewed. The cloning of orthogonally polarized photons is also considered, as well as the asymmetric and phase-covariant cloning of photons. Finally, the extension of quantum cloning to continuous variables is analyzed. The optimal cloning of coherent states of light by phase-insensitive amplification is explained, as well as the experimental realization of continuous-variable quantum cloning with linear optics, measurement, and feed-forward operations.
The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.
Recently, a lot of attention has been devoted to finding physically realizable operations that realize as closely as possible certain desired transformations between quantum states, e.g., quantum cloning, teleportation, quantum gates, etc. Mathematically, this problem boils down to finding a completely positive trace-preserving (CPTP) linear map that maximizes the (mean) fidelity between the map itself and the desired transformation. In this communication, we want to draw attention to the fact that this problem belongs to the class of so-called semidefinite programming (SDP) problems. As SDP problems are convex, it immediately follows that they do not suffer from local optima. Furthermore, this implies that the numerical optimization of the CPTP map can, and should, be done using methods from the well-established SDP field, as these methods exploit convexity and are guaranteed to converge to the real solution. Finally, we show how the duality inherent to convex and SDP problems can be exploited to prove analytically the optimality of a proposed solution. We give an example of how to apply this proof method by proving the optimality of Hardy and Song's optimal qubit $\ensuremath{\theta}$ shifter (e-print quant-ph/0102100).
As quantum networks evolve toward a full quantum Internet, reliable transmission in quantum multiple-input multiple-output (QuMIMO) settings becomes essential, yet remains difficult due to noise, crosstalk, and the mixing of quantum information across subchannels. To improve reliability in such settings, we study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver. An input qubit is encoded into M approximate clones, transmitted over an N x N multi-mode quantum channel, and recovered through a purification map optimized using available channel state information (CSI). For the given cloning asymmetry parameters, we derive an eigenvalue-based expression for the decoder-optimal end-to-end fidelity in the form of a generalized Rayleigh quotient, which enables efficient tuning of the cloner without iterative optimization. As a design choice, we employ semidefinite program (SDP) to construct the purification map for only a targeted success probability p. This numerical framework is used to study fixed-noise, dimension-scaling noise, and stochastic depolarization regimes. A cloning asymmetry index is introduced to quantify the distribution of quantum information across the multiple subchannels across these operating conditions. The results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions. This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.
After the appearance of the no-cloning theorem, approximate quantum cloning machines (QCMs) has become a well-studied subject in quantum information theory. Among several measures to quantify the performance of a QCM, single-qudit fidelity and global fidelity have been most widely used. In this paper we compute the optimal global fidelity for phase-covariant cloning machines via semidefinite programming optimization, thereby completing a remaining gap in the previous results on QCMs. We also consider optimal simulations of the cloning and transpose cloning map, both by a direct optimization and by a composition of component-wise optimal QCMs. For the cloning map the composition method is suboptimal whereas for the transpose cloning map the method is asymptotically optimal.
In this work, we study asymmetric (1→2)(1\to2)(1→2) quantum cloning for pure states belonging to orbits generated by the orthogonal group. For every dimension (d≥3)(d\geq3)(d≥3), we determine the full region of achievable pairs of average single-copy fidelities. Using orthogonal covariance and the Brauer algebra, we reduce the optimization over all CPTP maps to a finite-dimensional spectral problem and construct explicit optimal cloning channels. We then apply the general results to four-mode fermionic states in the even-parity sector. Using triality, we identify the fixed-concurrence fermionic families with the orthogonal orbits considered in the first part of the paper. In particular, for pure Gaussian states we show that the symmetric locally optimal cloner is unique. We also compare local and global cloning and find that the channel optimal for the joint two-copy fidelity is different from the one optimal for the single-copy fidelities. Finally, we show that the locally optimal cloner cannot be implemented using only operations which preserve fermionic Gaussian states.