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

Quantum Information and Computation

Quantum circuits for asymmetric 1 to n quantum cloning

Xi-Jun Ren, Heng Fan

Published Sep 1, 2015• 3 citations
Publisher

Abstract

In this paper, we considered asymmetric $1\rightarrow n$ cloning circuits generalized from the asymmetric $1\rightarrow 2$ cloning circuit proposed by Bu\v{z}ek \textit{et al.} [Phys. Rev. A 56, 3446 (1997)]. The generalization is based on an information flux insight of the original cloning circuit. Specifically, the circuit separately and sequentially transfers the Z-type information and X-type information of the input state to the output copies with controlled-not gates. The initial input state of the clones defines the asymmetry among all output clones. Although the generalized circuits do not perform universally, the averaged fidelities over a uniform distribution of all possible input cloning states saturate the optimal fidelity tradeoff relations of universal asymmetric cloning.

DOI
10.26421/qic15.11-12-2

Related papers

Optimal universal quantum cloning: asymmetries and fidelity measures

Alastair Kay

We study the problem of universal quantum cloning – taking several identical copies of a pure but unknown quantum state and producing further copies. While it is well known that it is impossible to perfectly reproduce the state, how well the copies can be cloned can be quantified using the fidelity. We examine how individual fidelities can be traded against each other, and how different fidelity measures can be incorporated. The broadly applicable formalism into which we transform the cloning problem is described as a series of quadratic constraints which are amenable to mathematical and computational scrutiny. As such, we reproduce all known results on optimal universal cloning, and push the recent results on asymmetric cloning much further, giving new trade-off relations between fidelities for broad classes of optimal cloning machines. We also provide substantial evidence that motivates why other parameter ranges (number of input copies) have not, and will not, yield to similar analysis.

arXiv:1407.4951•Quantum Information and Computation•Sep 1, 2016•10 citations

Unified universal quantum cloning machine and fidelities

Yi-Nan Wang, Handuo Shi, Zhao-Xi Xiong +4 more

We present a unified universal quantum cloning machine, which combines several different existing universal cloning machines together, including the asymmetric case. In this unified framework, the identical pure states are projected equally into each copy initially constituted by input and one half of the maximally entangled states. We show explicitly that the output states of those universal cloning machines are the same. One importance of this unified cloning machine is that the cloning procession is always the symmetric projection, which reduces dramatically the difficulties for implementation. Also, it is found that this unified cloning machine can be directly modified to the general asymmetric case. Besides the global fidelity and the single-copy fidelity, we also present all possible arbitrary-copy fidelities.

arXiv:1104.4014•Physical Review A•Sep 14, 2011•24 citations

Universal Quantum Cloning

Johannes Nokkala

After introducing the no-cloning theorem and the most common forms of approximate quantum cloning, universal quantum cloning is considered in detail. The connections it has with universal NOT-gate, quantum cryptography and state estimation are presented and briefly discussed. The state estimation connection is used to show that the amount of extractable classical information and total Bloch vector length are conserved in universal quantum cloning. The 1  2 qubit cloner is also shown to obey a complementarity relation between local and nonlocal information. These are interpreted to be a consequence of the conservation of total information in cloning. Finally, the performance of the 1  M cloning network discovered by Bužek, Hillery and Knight is studied in the presence of decoherence using the Barenco et al. approach where random phase fluctuations are attached to 2-qubit gates. The expression for average fidelity is calculated for three cases and it is found to depend on the optimal fidelity and the average of the phase fluctuations in a specific way. It is conjectured to be the form of the average fidelity in the general case. While the cloning network is found to be rather robust, it is nevertheless argued that the scalability of the quantum network implementation is poor by studying the effect of decoherence during the preparation of the initial state of the cloning machine in the 1 ! 2 case and observing that the loss in average fidelity can be large. This affirms the result by Maruyama and Knight, who reached the same conclusion in a slightly different manner.

•Jan 14, 2014•0 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

Fidelity Measures in Asymmetric Quantum Cloning

Alastair Kay

We study the problem of universal quantum cloning -- taking several identical copies of a pure but unknown quantum state and producing further copies. While it is well known that it is impossible to perfectly reproduce the state, how well the copies can be cloned can be quantified using the fidelity. We examine how individual fidelities can be traded against each other, and how different fidelity measures can be incorporated. The broadly applicable formalism into which we transform the cloning problem is described as a series of quadratic constraints which are amenable to mathematical and computational scrutiny. As such, we reproduce all known results on optimal universal cloning, and push the recent results on asymmetric cloning much further, giving new trade-off relations between fidelities for broad classes of optimal cloning machines. We also provide substantial evidence that motivates why other parameter ranges (number of input copies) have not, and will not, yield to similar analysis.

•Jul 18, 2014•0 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
In this paper, we considered asymmetric 1→n1\rightarrow n1→n cloning circuits generalized from the asymmetric 1→21\rightarrow 21→2 cloning circuit proposed by Bu\v{z}ek \textit{et al.} [Phys. Rev. A 56, 3446 (1997)]. The generalization is based on an information flux insight of the original cloning circuit. Specifically, the circuit separately and sequentially transfers the Z-type information and X-type information of the input state to the output copies with controlled-not gates. The initial input state of the clones defines the asymmetry among all output clones. Although the generalized circuits do not perform universally, the averaged fidelities over a uniform distribution of all possible input cloning states saturate the optimal fidelity tradeoff relations of universal asymmetric cloning.
We study the problem of universal quantum cloning – taking several identical copies of a pure but unknown quantum state and producing further copies. While it is well known that it is impossible to perfectly reproduce the state, how well the copies can be cloned can be quantified using the fidelity. We examine how individual fidelities can be traded against each other, and how different fidelity measures can be incorporated. The broadly applicable formalism into which we transform the cloning problem is described as a series of quadratic constraints which are amenable to mathematical and computational scrutiny. As such, we reproduce all known results on optimal universal cloning, and push the recent results on asymmetric cloning much further, giving new trade-off relations between fidelities for broad classes of optimal cloning machines. We also provide substantial evidence that motivates why other parameter ranges (number of input copies) have not, and will not, yield to similar analysis.
We present a unified universal quantum cloning machine, which combines several different existing universal cloning machines together, including the asymmetric case. In this unified framework, the identical pure states are projected equally into each copy initially constituted by input and one half of the maximally entangled states. We show explicitly that the output states of those universal cloning machines are the same. One importance of this unified cloning machine is that the cloning procession is always the symmetric projection, which reduces dramatically the difficulties for implementation. Also, it is found that this unified cloning machine can be directly modified to the general asymmetric case. Besides the global fidelity and the single-copy fidelity, we also present all possible arbitrary-copy fidelities.
After introducing the no-cloning theorem and the most common forms of approximate quantum cloning, universal quantum cloning is considered in detail. The connections it has with universal NOT-gate, quantum cryptography and state estimation are presented and briefly discussed. The state estimation connection is used to show that the amount of extractable classical information and total Bloch vector length are conserved in universal quantum cloning. The 1  2 qubit cloner is also shown to obey a complementarity relation between local and nonlocal information. These are interpreted to be a consequence of the conservation of total information in cloning. Finally, the performance of the 1  M cloning network discovered by Bužek, Hillery and Knight is studied in the presence of decoherence using the Barenco et al. approach where random phase fluctuations are attached to 2-qubit gates. The expression for average fidelity is calculated for three cases and it is found to depend on the optimal fidelity and the average of the phase fluctuations in a specific way. It is conjectured to be the form of the average fidelity in the general case. While the cloning network is found to be rather robust, it is nevertheless argued that the scalability of the quantum network implementation is poor by studying the effect of decoherence during the preparation of the initial state of the cloning machine in the 1 ! 2 case and observing that the loss in average fidelity can be large. This affirms the result by Maruyama and Knight, who reached the same conclusion in a slightly different manner.
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→NM\rightarrow NM→N asymmetric cloning of qudits are obtained in a number of interesting cases. The central result is the solution to the 1→N1 \rightarrow N1→N universal asymmetric qudit cloning problem for which the exact trade-off in the fidelities of the clones for every NNN and ddd is derived. Analogous results are proven for qubits when M=N−1M=N-1M=N−1. We also consider state-dependent 1→N1 \rightarrow N1→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.
We study the problem of universal quantum cloning -- taking several identical copies of a pure but unknown quantum state and producing further copies. While it is well known that it is impossible to perfectly reproduce the state, how well the copies can be cloned can be quantified using the fidelity. We examine how individual fidelities can be traded against each other, and how different fidelity measures can be incorporated. The broadly applicable formalism into which we transform the cloning problem is described as a series of quadratic constraints which are amenable to mathematical and computational scrutiny. As such, we reproduce all known results on optimal universal cloning, and push the recent results on asymmetric cloning much further, giving new trade-off relations between fidelities for broad classes of optimal cloning machines. We also provide substantial evidence that motivates why other parameter ranges (number of input copies) have not, and will not, yield to similar analysis.
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.