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:quant-ph/9805073 · Physical Review A

Optimal copying of one quantum bit

Chi-Sheng Niu, Robert B. Griffiths

Published Dec 1, 1998• 82 citations
arXivHTMLPDF

Abstract

A quantum copying machine producing two (in general nonidentical) copies of an arbitrary input state of a two-dimensional Hilbert space (quantum bit) is studied using a quality measure based on distinguishability of states, rather than fidelity. The problem of producing optimal copies is investigated with the help of a Bloch sphere representation, and shown to have a well-defined solution, including cases in which the two copies have an unequal quality, or the quality depends upon the input state (is ``anisotropic'' in Bloch sphere language), or both. A simple quantum circuit yields the optimal copying machine. With a suitable choice of parameters it becomes an optimal eavesdropping machine for some versions of quantum cryptography, or reproduces the Bu\ifmmode \check{z}\else \v{z}\fi{}ek and Hillery result for isotropic copies.

DOI
10.1103/physreva.58.4377

Related papers

Two-qubit copying machine for economical quantum eavesdropping

Chi-Sheng Niu, Robert B. Griffiths

We study the mapping that occurs when a single qubit in an arbitrary state interacts with another qubit in a given, fixed state resulting in some unitary transformation on the two qubit system that, in effect, makes two copies of the first qubit. The general problem of the quality of the resulting copies is discussed using a special representation, a generalization of the usual Schmidt decomposition, of an arbitrary two-dimensional subspace of a tensor product of two two-dimensional Hilbert spaces. We exhibit quantum circuits that can reproduce the results of any two-qubit copying machine of this type. A simple stochastic generalization (using a classical random signal) of the copying machine is also considered. These copying machines provide simple embodiments of previously proposed optimal eavesdropping schemes for the BB84 and B92 quantum cryptography protocols.

arXiv:quant-ph/9810008•Physical Review A•Oct 1, 1999•126 citations

Universal optimal cloning of qubits and quantum registers

Vladimír Bužek, Mark S. Hillery

We review our recent work on the universal (i.e. input state independent) optimal quantum copying (cloning) of qubits. We present unitary transformations which describe the optimal cloning of a qubit and we present the corresponding quantum logical network. We also present network for an optimal quantum copying ``machine'' (transformation) which produces N+1 identical copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copies, N. In addition, we present the machine which universaly and optimally clones states of quantum objects in arbitrary-dimensional Hilbert spaces. In particular, we discuss universal cloning of quantum registers.

arXiv:quant-ph/9801009•Jan 7, 1998•1 citation

Designing optimal quantum cloning machine for qubit system

Xiaohua Wu, Wu, Fei

Following the work of Niu and Griffiths, in \emph{Phys.Rev.A 58, 4377(1998)}, we shall investigate the problem, how to design the optimal quantum cloning machines (QCMs) for qubit system, with the help of Bloch-sphere representation. In stead of the quality factor there, the Fiuráusek's optimal condition, where the optimal cloning machine should maximize a convex mixture of the average fidelity, is used as the optimality criterion in present protocol. Almost all of the known optimal QCMs in previous works, the cloning for states with fixed polar angle, the phase-covariant cloning, the universal QCMs, the cloning for two arbitrary pure states, and the mirror phase-covariant cloning, should be discussed in a systematic way. The known results, the optimal fidelities for various input ensembles according to different optimality criteria, are recovered here. Our present scheme also offers a general way of constructing the unitary transformation to realize the optimal cloning.

arXiv:1004.5210•Apr 29, 2010•0 citations

Optimal manipulations with qubits: universal quantum cloning and universal logical NOT operation

Vladimír Bužek, Mark S. Hillery

We analyze how information encoded in quantum systems can be optimally processed. In particular, we investigate copying (cloning) of quantum information (represented as states of 2-level quantum systems--qubits). We present unitary transformations which describe the optimal universal cloning of a qubit. Universality of the transformation guarantees that the fidelity of the cloning does not depend on the input state of the qubit, i.e. all states are cloned equally well. We present network for the optimal universal quantum cloning `machine' (transformation) which produces N + 1 copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copes, N. We also present the `machine' which universally and optimally clones states of quantum objects in arbitrary- dimensional Hilbert spaces. In particular, we discuss universal cloning of quantum registers. In addition to cloning of qubits we analyzed another universal operation-- the Universal NOT. We present the optimal transformation and the corresponding logical network which optimally complements an arbitrary input state of a qubit. We show that the fidelity of the performance of the Universal NOT operation increases as a function of the number of input qubits prepared in the same state.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 14, 1999•0 citations

Two-qubit quantum cloning machine and quantum correlation broadcasting

Azam Kheirollahi, Hamidreza Mohammadi, Seyed Javad Akhtarshenas

Due to the axioms of quantum mechanics, perfect cloning of an unknown quantum state is impossible. But since imperfect cloning is still possible, a question arises: ``Is there an optimal quantum cloning machine?'' Buzek and Hillery answered this question and constructed their famous B-H quantum cloning machine. The B-H machine clones the state of an arbitrary single qubit in an optimal manner and hence it is universal. Generalizing this machine for a two-qubit system is straightforward, but during this procedure, except for product states, this machine loses its universality and becomes a state-dependent cloning machine. In this paper, we propose some classes of optimal universal local quantum state cloners for a particular class of two-qubit systems, more precisely, for a class of states with known Schmidt basis. We then extend our machine to the case that the Schmidt basis of the input state is deviated from the local computational basis of the machine. We show that more local quantum coherence existing in the input state corresponds to less fidelity between the input and output states. Also we present two classes of a state-dependent local quantum copying machine. Furthermore, we investigate local broadcasting of two aspects of quantum correlations, i.e., quantum entanglement and quantum discord, defined, respectively, within the entanglement-separability paradigm and from an information-theoretic perspective. The results show that although quantum correlation is, in general, very fragile during the broadcasting procedure, quantum discord is broadcasted more robustly than quantum entanglement.

arXiv:1604.04995•Physical Review A•Nov 9, 2016•1 citation

High-fidelity copies from a symmetric 1 to 2 quantum cloning machine

Michael Siomau, S. Fritzsche

A symmetric 1 to 2 quantum cloning machine (QCM) is presented that provides high-fidelity copies with $0.90 \le F \le 0.95$ for all pure (single-qubit) input states from a given meridian of the Bloch sphere. \cor{Emphasize is placed especially on the states of the (so-called) Eastern meridian, that includes the computational basis states $\ketm{0}, \ketm{1}$ together with the diagonal state $\ketm{+} = \frac{1}{\sqrt{2}} (\ketm{0} + \ketm{1})$, for which suggested cloning transformation is shown to be optimal.} In addition, we also show how this QCM can be utilized for eavesdropping in Bennett's B92 protocol for quantum key distribution with a substantial higher success rate than obtained for universal or equatorial quantum copying.

arXiv:0906.1453•Jun 8, 2009•0 citations
A quantum copying machine producing two (in general nonidentical) copies of an arbitrary input state of a two-dimensional Hilbert space (quantum bit) is studied using a quality measure based on distinguishability of states, rather than fidelity. The problem of producing optimal copies is investigated with the help of a Bloch sphere representation, and shown to have a well-defined solution, including cases in which the two copies have an unequal quality, or the quality depends upon the input state (is ``anisotropic'' in Bloch sphere language), or both. A simple quantum circuit yields the optimal copying machine. With a suitable choice of parameters it becomes an optimal eavesdropping machine for some versions of quantum cryptography, or reproduces the Bu\ifmmode \check{z}\else \v{z}\fi{}ek and Hillery result for isotropic copies.
We study the mapping that occurs when a single qubit in an arbitrary state interacts with another qubit in a given, fixed state resulting in some unitary transformation on the two qubit system that, in effect, makes two copies of the first qubit. The general problem of the quality of the resulting copies is discussed using a special representation, a generalization of the usual Schmidt decomposition, of an arbitrary two-dimensional subspace of a tensor product of two two-dimensional Hilbert spaces. We exhibit quantum circuits that can reproduce the results of any two-qubit copying machine of this type. A simple stochastic generalization (using a classical random signal) of the copying machine is also considered. These copying machines provide simple embodiments of previously proposed optimal eavesdropping schemes for the BB84 and B92 quantum cryptography protocols.
We review our recent work on the universal (i.e. input state independent) optimal quantum copying (cloning) of qubits. We present unitary transformations which describe the optimal cloning of a qubit and we present the corresponding quantum logical network. We also present network for an optimal quantum copying ``machine'' (transformation) which produces N+1 identical copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copies, N. In addition, we present the machine which universaly and optimally clones states of quantum objects in arbitrary-dimensional Hilbert spaces. In particular, we discuss universal cloning of quantum registers.
Following the work of Niu and Griffiths, in \emph{Phys.Rev.A 58, 4377(1998)}, we shall investigate the problem, how to design the optimal quantum cloning machines (QCMs) for qubit system, with the help of Bloch-sphere representation. In stead of the quality factor there, the Fiuráusek's optimal condition, where the optimal cloning machine should maximize a convex mixture of the average fidelity, is used as the optimality criterion in present protocol. Almost all of the known optimal QCMs in previous works, the cloning for states with fixed polar angle, the phase-covariant cloning, the universal QCMs, the cloning for two arbitrary pure states, and the mirror phase-covariant cloning, should be discussed in a systematic way. The known results, the optimal fidelities for various input ensembles according to different optimality criteria, are recovered here. Our present scheme also offers a general way of constructing the unitary transformation to realize the optimal cloning.
We analyze how information encoded in quantum systems can be optimally processed. In particular, we investigate copying (cloning) of quantum information (represented as states of 2-level quantum systems--qubits). We present unitary transformations which describe the optimal universal cloning of a qubit. Universality of the transformation guarantees that the fidelity of the cloning does not depend on the input state of the qubit, i.e. all states are cloned equally well. We present network for the optimal universal quantum cloning `machine' (transformation) which produces N + 1 copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copes, N. We also present the `machine' which universally and optimally clones states of quantum objects in arbitrary- dimensional Hilbert spaces. In particular, we discuss universal cloning of quantum registers. In addition to cloning of qubits we analyzed another universal operation-- the Universal NOT. We present the optimal transformation and the corresponding logical network which optimally complements an arbitrary input state of a qubit. We show that the fidelity of the performance of the Universal NOT operation increases as a function of the number of input qubits prepared in the same state.
Due to the axioms of quantum mechanics, perfect cloning of an unknown quantum state is impossible. But since imperfect cloning is still possible, a question arises: ``Is there an optimal quantum cloning machine?'' Buzek and Hillery answered this question and constructed their famous B-H quantum cloning machine. The B-H machine clones the state of an arbitrary single qubit in an optimal manner and hence it is universal. Generalizing this machine for a two-qubit system is straightforward, but during this procedure, except for product states, this machine loses its universality and becomes a state-dependent cloning machine. In this paper, we propose some classes of optimal universal local quantum state cloners for a particular class of two-qubit systems, more precisely, for a class of states with known Schmidt basis. We then extend our machine to the case that the Schmidt basis of the input state is deviated from the local computational basis of the machine. We show that more local quantum coherence existing in the input state corresponds to less fidelity between the input and output states. Also we present two classes of a state-dependent local quantum copying machine. Furthermore, we investigate local broadcasting of two aspects of quantum correlations, i.e., quantum entanglement and quantum discord, defined, respectively, within the entanglement-separability paradigm and from an information-theoretic perspective. The results show that although quantum correlation is, in general, very fragile during the broadcasting procedure, quantum discord is broadcasted more robustly than quantum entanglement.
A symmetric 1 to 2 quantum cloning machine (QCM) is presented that provides high-fidelity copies with 0.90≤F≤0.950.90 \le F \le 0.950.90≤F≤0.95 for all pure (single-qubit) input states from a given meridian of the Bloch sphere. \cor{Emphasize is placed especially on the states of the (so-called) Eastern meridian, that includes the computational basis states $\ketm{0}, \ketm{1}$ together with the diagonal state $\ketm{+} = \frac{1}{\sqrt{2}} (\ketm{0} + \ketm{1})$, for which suggested cloning transformation is shown to be optimal.} In addition, we also show how this QCM can be utilized for eavesdropping in Bennett's B92 protocol for quantum key distribution with a substantial higher success rate than obtained for universal or equatorial quantum copying.