© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:1204.2500 · Physical Review A

Sequential quantum cloning under real-life conditions

Hamed Saberi, Yousof Mardoukhi

Published May 29, 2012• 5 citations

Abstract

We consider a sequential implementation of the optimal quantum cloning machine of Gisin and Massar and propose optimization protocols for experimental realization of such a quantum cloner subject to the real-life restrictions. We demonstrate how exploiting the matrix-product state (MPS) formalism and the ensuing variational optimization techniques reveals the intriguing algebraic structure of the Gisin-Massar output of the cloning procedure and brings about significant improvements to the optimality of the sequential cloning prescription of Delgado et al. [Phys. Rev. Lett. 98, 150502 (2007)]. Our numerical results show that the orthodox paradigm of optimal quantum cloning can in practice be realized in a much more economical manner by utilizing a considerably lesser amount of informational and numerical resources than hitherto estimated. Instead of the previously predicted linear scaling of the required ancilla dimension $D$ with the number of qubits $n$, our recipe allows a realization of such a sequential cloning setup with an experimentally manageable ancilla of dimension at most $D=3$ up to $n=15$ qubits. We also address satisfactorily the possibility of providing an optimal range of sequential ancilla-qubit interactions for optimal cloning of arbitrary states under realistic experimental circumstances when only a restricted class of such bipartite interactions can be engineered in practice.

DOI: 10.1103/physreva.85.052323

Related papers

Efficient classical simulation of the Gisin-Massar quantum cloning machine

Hamed Saberi, Yousof Mardoukhi

We provide here the technical details of the recently proposed tensor-network protocol for classical simulation of the Gisin-Massar quantum cloner by the authors [Phys. Rev. A, 85, 052323 (2012)]. The protocol essentially instructs how to efficiently simulate an optimal quantum cloning machine of Gisin-Massar on a classical computer. A viable computational platform for generation on demand of arbitrary number of optimal clones with controllable numerical resources is realized by rephrasing the Gisin-Massar output state in terms of the hierarchy of the so-called matrix-product states (MPS) and invoking parity features peculiar to such an output.

arXiv:1305.2087•May 9, 2013•0 citations

Sequential Quantum Cloning

Ydalia Delgado Mercado, Lucas Lamata, Juan León +2 more

Not all unitary operations upon a set of qubits can be implemented by sequential interactions between each qubit and an ancillary system. We analyze the specific case of sequential quantum cloning, 1-->M, and prove that the minimal dimension D of the ancilla grows linearly with the number of clones M. In particular, we obtain D=2M for symmetric universal quantum cloning and D=M+1 for symmetric phase-covariant cloning. Furthermore, we provide a recipe for the required ancilla-qubit interactions in each step of the sequential procedure for both cases.

arXiv:quant-ph/0607105•Physical Review Letters•Apr 13, 2007•25 citations

Constrained optimization of sequentially generated entangled multiqubit states

Hamed Saberi, Andreas Weichselbaum, Lucas Lamata +3 more

We demonstrate how the matrix-product state formalism provides a flexible structure to solve the constrained optimization problem associated with the sequential generation of entangled multiqubit states under experimental restrictions. We consider a realistic scenario in which an ancillary system with a limited number of levels performs restricted sequential interactions with qubits in a row. The proposed method relies on a suitable local optimization procedure, yielding an efficient recipe for the realistic and approximate sequential generation of any entangled multiqubit state. We give paradigmatic examples that may be of interest for theoretical and experimental developments.

arXiv:0810.0977•Physical Review A•Aug 26, 2009•17 citations

Experimental realization of 1→2 asymmetric phase-covariant quantum cloning

Hongwei Chen, Xianyi Zhou, Dieter Suter +1 more

While exact cloning of an unknown quantum state is prohibited by the linearity of quantum mechanics, approximate cloning is possible and has been used, e.g., to derive limits on the security of quantum communication protocols. In the case of asymmetric cloning, the information from the input state is distributed asymmetrically between the different output states. Here, we consider asymmetric phase-covariant cloning, where the goal is to optimally transfer the phase information from a single input qubit to different output qubits. We construct an optimal quantum cloning machine for two qubits that does not require ancilla qubits and implement it on an NMR quantum information processor.

arXiv:quant-ph/0612132•Physical Review A•Jan 17, 2007•69 citations

Optimal asymmetric quantum cloning for quantum information and computation

Alastair Kay, Ravishankar Ramanathan, Dagomir Kaszlikowski

While the no-cloning theorem, which forbids the perfect copying of quantum states, is well-known as one of the defining features of quantum mechanics, the question of how well the theory allows a state to be cloned is yet to be completely solved. In this paper, rigorous solutions to the problem of $M\rightarrow N$ asymmetric cloning of qudits are obtained in a number of interesting cases. The central result is the solution to the $1 \rightarrow N$ universal asymmetric qudit cloning problem for which the exact trade-off in the fidelities of the clones for every $N$ and $d$ is derived. Analogous results are proven for qubits when $M=N-1$. We also consider state-dependent $1 \rightarrow N$ qubit cloning, providing a general parametrization in terms of a Heisenberg star Hamiltonian. In all instances, we determine the feasibility of implementing the cloning economically, i.e., without an ancilla, and determine the dimension of the ancilla when an economic implementation is not possible.

Quantum Information and Computation•Sep 1, 2013•8 citations

Optimal Asymmetric Quantum Cloning

Alastair Kay, Ravishankar Ramanathan, Dagomir Kaszlikowski

While the no-cloning theorem, which forbids the perfect copying of quantum states, is well-known as one of the defining features of quantum mechanics, the question of how well the theory allows a state to be cloned is yet to be completely solved. In this paper, rigorous solutions to the problem of M to N asymmetric cloning of qudits are obtained in a number of interesting cases. The central result is the solution to the 1 to N universal asymmetric qudit cloning problem for which the exact trade-off in the fidelities of the clones for every N and d is derived. Analogous results are proven for qubits when M=N-1. We also consider state-dependent 1 to N qubit cloning, providing a general parametrization in terms of a Heisenberg star Hamiltonian. In all instances, we determine the feasibility of implementing the cloning economically, i.e., without an ancilla, and determine the dimension of the ancilla when an economic implementation is not possible.

arXiv:1208.5574•Aug 28, 2012•3 citations

We consider a sequential implementation of the optimal quantum cloning machine of Gisin and Massar and propose optimization protocols for experimental realization of such a quantum cloner subject to the real-life restrictions. We demonstrate how exploiting the matrix-product state (MPS) formalism and the ensuing variational optimization techniques reveals the intriguing algebraic structure of the Gisin-Massar output of the cloning procedure and brings about significant improvements to the optimality of the sequential cloning prescription of Delgado et al. [Phys. Rev. Lett. 98, 150502 (2007)]. Our numerical results show that the orthodox paradigm of optimal quantum cloning can in practice be realized in a much more economical manner by utilizing a considerably lesser amount of informational and numerical resources than hitherto estimated. Instead of the previously predicted linear scaling of the required ancilla dimension

D

with the number of qubits

n

, our recipe allows a realization of such a sequential cloning setup with an experimentally manageable ancilla of dimension at most

D=3

up to

n=15

qubits. We also address satisfactorily the possibility of providing an optimal range of sequential ancilla-qubit interactions for optimal cloning of arbitrary states under realistic experimental circumstances when only a restricted class of such bipartite interactions can be engineered in practice.

We provide here the technical details of the recently proposed tensor-network protocol for classical simulation of the Gisin-Massar quantum cloner by the authors [Phys. Rev. A, 85, 052323 (2012)]. The protocol essentially instructs how to efficiently simulate an optimal quantum cloning machine of Gisin-Massar on a classical computer. A viable computational platform for generation on demand of arbitrary number of optimal clones with controllable numerical resources is realized by rephrasing the Gisin-Massar output state in terms of the hierarchy of the so-called matrix-product states (MPS) and invoking parity features peculiar to such an output.

Not all unitary operations upon a set of qubits can be implemented by sequential interactions between each qubit and an ancillary system. We analyze the specific case of sequential quantum cloning, 1-->M, and prove that the minimal dimension D of the ancilla grows linearly with the number of clones M. In particular, we obtain D=2M for symmetric universal quantum cloning and D=M+1 for symmetric phase-covariant cloning. Furthermore, we provide a recipe for the required ancilla-qubit interactions in each step of the sequential procedure for both cases.

We demonstrate how the matrix-product state formalism provides a flexible structure to solve the constrained optimization problem associated with the sequential generation of entangled multiqubit states under experimental restrictions. We consider a realistic scenario in which an ancillary system with a limited number of levels performs restricted sequential interactions with qubits in a row. The proposed method relies on a suitable local optimization procedure, yielding an efficient recipe for the realistic and approximate sequential generation of any entangled multiqubit state. We give paradigmatic examples that may be of interest for theoretical and experimental developments.

While exact cloning of an unknown quantum state is prohibited by the linearity of quantum mechanics, approximate cloning is possible and has been used, e.g., to derive limits on the security of quantum communication protocols. In the case of asymmetric cloning, the information from the input state is distributed asymmetrically between the different output states. Here, we consider asymmetric phase-covariant cloning, where the goal is to optimally transfer the phase information from a single input qubit to different output qubits. We construct an optimal quantum cloning machine for two qubits that does not require ancilla qubits and implement it on an NMR quantum information processor.

While the no-cloning theorem, which forbids the perfect copying of quantum states, is well-known as one of the defining features of quantum mechanics, the question of how well the theory allows a state to be cloned is yet to be completely solved. In this paper, rigorous solutions to the problem of

M\rightarrow N

asymmetric cloning of qudits are obtained in a number of interesting cases. The central result is the solution to the

1 \rightarrow N

universal asymmetric qudit cloning problem for which the exact trade-off in the fidelities of the clones for every

N

and

d

is derived. Analogous results are proven for qubits when

M=N-1

. We also consider state-dependent

1 \rightarrow N

qubit cloning, providing a general parametrization in terms of a Heisenberg star Hamiltonian. In all instances, we determine the feasibility of implementing the cloning economically, i.e., without an ancilla, and determine the dimension of the ancilla when an economic implementation is not possible.

While the no-cloning theorem, which forbids the perfect copying of quantum states, is well-known as one of the defining features of quantum mechanics, the question of how well the theory allows a state to be cloned is yet to be completely solved. In this paper, rigorous solutions to the problem of M to N asymmetric cloning of qudits are obtained in a number of interesting cases. The central result is the solution to the 1 to N universal asymmetric qudit cloning problem for which the exact trade-off in the fidelities of the clones for every N and d is derived. Analogous results are proven for qubits when M=N-1. We also consider state-dependent 1 to N qubit cloning, providing a general parametrization in terms of a Heisenberg star Hamiltonian. In all instances, we determine the feasibility of implementing the cloning economically, i.e., without an ancilla, and determine the dimension of the ancilla when an economic implementation is not possible.