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:1410.6008 · Physical Review Letters

Deterministic Superreplication of One-Parameter Unitary Transformations

Wolfgang Dür, Pavel Sekatski, Michalis Skotiniotis

Published Mar 25, 2015• 19 citations
arXivHTMLPDF

Abstract

We show that one can deterministically generate, out of N copies of an unknown unitary operation, up to N^{2} almost perfect copies. The result holds for all operations generated by a Hamiltonian with an unknown interaction strength. This generalizes a similar result in the context of phase-covariant cloning where, however, superreplication comes at the price of an exponentially reduced probability of success. We also show that multiple copies of unitary operations can be emulated by operations acting on a much smaller space, e.g., a magnetic field acting on a single n-level system allows one to emulate the action of the field on n^{2} qubits.

DOI
10.1103/physrevlett.114.120503

Related papers

Universal Superreplication of Unitary Gates

Giulio Chiribella, Yuxiang Yang, C. Huang

Quantum states obey an asymptotic no-cloning theorem, stating that no deterministic machine can reliably replicate generic sequences of identically prepared pure states. In stark contrast, we show that generic sequences of unitary gates can be replicated deterministically at nearly quadratic rates, with an error vanishing on most inputs except for an exponentially small fraction. The result is not in contradiction with the no-cloning theorem, since the impossibility of deterministically transforming pure states into unitary gates prevents the application of the gate replication protocol to states. In addition to gate replication, we show that N parallel uses of a completely unknown unitary gate can be compressed into a single gate acting on O(log_{2}N) qubits, leading to an exponential reduction of the amount of quantum communication needed to implement the gate remotely.

arXiv:1412.1349•Physical Review Letters•Mar 25, 2015•29 citations

Quantum superreplication of states and gates

Giulio Chiribella, Yuxiang Yang

Although the no-cloning theorem forbids perfect replication of quantum information, it is sometimes possible to produce large numbers of replicas with vanishingly small error. This phenomenon, known as quantum superreplication, can occur for both quantum states and quantum gates. The aim of this paper is to review the central features of quantum superreplication and provide a unified view of existing results. The paper also includes new results. In particular, we show that when quantum superreplication can be achieved, it can be achieved through estimation up to an error of size O(M/N 2), where N and M are the number of input and output copies, respectively. Quantum strategies still offer an advantage for superreplication in that they allow for exponentially faster reduction of the error. Using the relation with estimation, we provide i) an alternative proof of the optimality of Heisenberg scaling in quantum metrology, ii) a strategy for estimating arbitrary unitary gates with a mean square error scaling as log N/N 2, and iii) a protocol that generates O(N 2) nearly perfect copies of a generic pure state U |0〉 while using the corresponding gate U only N times. Finally, we point out that superreplication can be achieved using interactions among k systems, provided that k is large compared to M 2/N 2.

arXiv:1512.05839•Frontiers of Physics•Mar 17, 2016•8 citations

Efficient Quantum Emulation of Unknown Unitaries

Iman Marvian, Seth Lloyd

We propose a quantum algorithm, termed the universal quantum emulator, that emulates the action of an unknown unitary transformation or its inverse on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The algorithm does not assume any prior information about the unitary to be emulated, the sample input states, or the relation between them. We rigorously prove that if the sample input states are tomographically complete, such that the action of an unknown unitary on the input subspace can be uniquely determined by its action on the sample input states, then our proposed algorithm succeeds in generating the desired output, with an error that becomes arbitrarily small by increasing the number of copies of the samples. Remarkably, the run-time of the algorithm is logarithmic in D , the dimension of the Hilbert space, and increases polynomially with d , the dimension of the subspace spanned by the sample input states. Furthermore, the sample complexity of the algorithm—i.e., the total number of copies of the sample input-output pairs needed to run the algorithm—is independent of D and polynomial in d . In contrast, the run-time and sample complexity of algorithms that perform tomography on the sample states are both linear in D . This algorithm can be used as a subroutine in other algorithms, such as quantum phase estimation. We discuss some applications of this algorithm in areas including complexity theory, secure quantum computation, and quantum resource theories.

PRX Quantum•Sep 10, 2025•2 citations

Quantum Superposition of Multiple Clones and the Novel Cloning Machine

Arun Kumar Pati

We envisage a novel quantum cloning machine, which takes an input state and produces an output state whose success branch can exist in a linear superposition of multiple copies of the input state and the failure branch can exist in a superposition of composite states independent of the input state. We prove that unknown nonorthogonal states chosen from a set $S$ can evolve into a linear superposition of multiple clones and failure branches by a unitary process if and only if the states are linearly independent. We derive a bound on the success probability of the novel cloning machine. We argue that the deterministic and probabilistic clonings are special cases of our novel cloning machine.

arXiv:quant-ph/9903038•Physical Review Letters•Oct 4, 1999•71 citations

A single quantum cannot be teleported

Daniele Tommasini

Due to the Heisemberg uncertainty principle, it is impossible to design a procedure which permits perfect cloning of an arbitrary, unknown "qubit" (the spin or polarization state of a single quantum system)1,2. However, it is believed that a perfect copying protocol can be achieved, at least in principle, if the qubit to be copied is destroyed in the original system. Quantum teleportation3,4 is supposed to allow for such a result. Here, this belief is shown to be invalidated by a fundamental uncertainty about the number of particles involved in any process, as predicted by Quantum Field Theory. As a result, teleportation cannot provide an infallible copying procedure for the single qubits, not even in the limit of perfect experimental sensitivities. The no-cloning theorem1,2 can then be generalized to the case of destroying the original. Teleportation remains an interesting statistical procedure, having an unavoidable theoretical error at the percent level or few orders of magnitude smaller, depending on the physical process that is used. Although it cannot be made arbitrarily small, such an error is small enough to remain hidden in present experiments.

arXiv:quant-ph/0210060•Oct 9, 2002•4 citations

Is It Possible To Clone Using An Arbitrary Blank State?

Roy, A, Ujjwal Sen, Sen, U

We show that using a fixed cloning machine, whether deterministic inexact or probabilistic exact, one can take an arbitrary blank state. Quantum information cannot be cloned. There cannot exist a machine which can produce two (or more) exact copies of an arbitrary state in a deterministic manner [1]. Replication is not allowed even when the input state is taken at random from a given set of two non-orthogonal states [2]. It has been further shown that probabilistic cloning is not possible if the input state is from a given linearly dependent set [3]. Henceforth we deal explicitly with qubits although all the results can be extended to higher dimensions. Although exact cloning is not possible, one can approximately clone an arbitrary input state [4, 5, 6]. In this scheme a fixed state is taken as the blank state, depending on which and the initial machine state, the cloning operation is constructed. We extend this operation such that any arbitrary (pure or mixed) state taken as the blank copy can do the job. The optimal universal 1 → 2 inexact qubit cloner of Brußet al.[5] takes an arbitrary qubit |ψ 〉 〈ψ | = 1 2 (I + − → s. − → σ) along with a fixed blank qubit |b 〉 and a machine state |M 〉 as input. An entangled state of the three qubits is produced as the output such that the reduced density matrices of the first two qubits are two similar approximate copies ρ = 1 2 (I + η− → s. − → σ) of |ψ 〉 〈ψ | with η = 2 3. The unitary operator realizing this process is defined on the combined Hilbert space of the input qubit, the blank qubit and machine by U ′ √ √

•Jan 1, 2001•1 citation
We show that one can deterministically generate, out of N copies of an unknown unitary operation, up to N^{2} almost perfect copies. The result holds for all operations generated by a Hamiltonian with an unknown interaction strength. This generalizes a similar result in the context of phase-covariant cloning where, however, superreplication comes at the price of an exponentially reduced probability of success. We also show that multiple copies of unitary operations can be emulated by operations acting on a much smaller space, e.g., a magnetic field acting on a single n-level system allows one to emulate the action of the field on n^{2} qubits.
Quantum states obey an asymptotic no-cloning theorem, stating that no deterministic machine can reliably replicate generic sequences of identically prepared pure states. In stark contrast, we show that generic sequences of unitary gates can be replicated deterministically at nearly quadratic rates, with an error vanishing on most inputs except for an exponentially small fraction. The result is not in contradiction with the no-cloning theorem, since the impossibility of deterministically transforming pure states into unitary gates prevents the application of the gate replication protocol to states. In addition to gate replication, we show that N parallel uses of a completely unknown unitary gate can be compressed into a single gate acting on O(log_{2}N) qubits, leading to an exponential reduction of the amount of quantum communication needed to implement the gate remotely.
Although the no-cloning theorem forbids perfect replication of quantum information, it is sometimes possible to produce large numbers of replicas with vanishingly small error. This phenomenon, known as quantum superreplication, can occur for both quantum states and quantum gates. The aim of this paper is to review the central features of quantum superreplication and provide a unified view of existing results. The paper also includes new results. In particular, we show that when quantum superreplication can be achieved, it can be achieved through estimation up to an error of size O(M/N 2), where N and M are the number of input and output copies, respectively. Quantum strategies still offer an advantage for superreplication in that they allow for exponentially faster reduction of the error. Using the relation with estimation, we provide i) an alternative proof of the optimality of Heisenberg scaling in quantum metrology, ii) a strategy for estimating arbitrary unitary gates with a mean square error scaling as log N/N 2, and iii) a protocol that generates O(N 2) nearly perfect copies of a generic pure state U |0〉 while using the corresponding gate U only N times. Finally, we point out that superreplication can be achieved using interactions among k systems, provided that k is large compared to M 2/N 2.
We propose a quantum algorithm, termed the universal quantum emulator, that emulates the action of an unknown unitary transformation or its inverse on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The algorithm does not assume any prior information about the unitary to be emulated, the sample input states, or the relation between them. We rigorously prove that if the sample input states are tomographically complete, such that the action of an unknown unitary on the input subspace can be uniquely determined by its action on the sample input states, then our proposed algorithm succeeds in generating the desired output, with an error that becomes arbitrarily small by increasing the number of copies of the samples. Remarkably, the run-time of the algorithm is logarithmic in D , the dimension of the Hilbert space, and increases polynomially with d , the dimension of the subspace spanned by the sample input states. Furthermore, the sample complexity of the algorithm—i.e., the total number of copies of the sample input-output pairs needed to run the algorithm—is independent of D and polynomial in d . In contrast, the run-time and sample complexity of algorithms that perform tomography on the sample states are both linear in D . This algorithm can be used as a subroutine in other algorithms, such as quantum phase estimation. We discuss some applications of this algorithm in areas including complexity theory, secure quantum computation, and quantum resource theories.
We envisage a novel quantum cloning machine, which takes an input state and produces an output state whose success branch can exist in a linear superposition of multiple copies of the input state and the failure branch can exist in a superposition of composite states independent of the input state. We prove that unknown nonorthogonal states chosen from a set SSS can evolve into a linear superposition of multiple clones and failure branches by a unitary process if and only if the states are linearly independent. We derive a bound on the success probability of the novel cloning machine. We argue that the deterministic and probabilistic clonings are special cases of our novel cloning machine.
Due to the Heisemberg uncertainty principle, it is impossible to design a procedure which permits perfect cloning of an arbitrary, unknown "qubit" (the spin or polarization state of a single quantum system)1,2. However, it is believed that a perfect copying protocol can be achieved, at least in principle, if the qubit to be copied is destroyed in the original system. Quantum teleportation3,4 is supposed to allow for such a result. Here, this belief is shown to be invalidated by a fundamental uncertainty about the number of particles involved in any process, as predicted by Quantum Field Theory. As a result, teleportation cannot provide an infallible copying procedure for the single qubits, not even in the limit of perfect experimental sensitivities. The no-cloning theorem1,2 can then be generalized to the case of destroying the original. Teleportation remains an interesting statistical procedure, having an unavoidable theoretical error at the percent level or few orders of magnitude smaller, depending on the physical process that is used. Although it cannot be made arbitrarily small, such an error is small enough to remain hidden in present experiments.
We show that using a fixed cloning machine, whether deterministic inexact or probabilistic exact, one can take an arbitrary blank state. Quantum information cannot be cloned. There cannot exist a machine which can produce two (or more) exact copies of an arbitrary state in a deterministic manner [1]. Replication is not allowed even when the input state is taken at random from a given set of two non-orthogonal states [2]. It has been further shown that probabilistic cloning is not possible if the input state is from a given linearly dependent set [3]. Henceforth we deal explicitly with qubits although all the results can be extended to higher dimensions. Although exact cloning is not possible, one can approximately clone an arbitrary input state [4, 5, 6]. In this scheme a fixed state is taken as the blank state, depending on which and the initial machine state, the cloning operation is constructed. We extend this operation such that any arbitrary (pure or mixed) state taken as the blank copy can do the job. The optimal universal 1 → 2 inexact qubit cloner of Brußet al.[5] takes an arbitrary qubit |ψ 〉 〈ψ | = 1 2 (I + − → s. − → σ) along with a fixed blank qubit |b 〉 and a machine state |M 〉 as input. An entangled state of the three qubits is produced as the output such that the reduced density matrices of the first two qubits are two similar approximate copies ρ = 1 2 (I + η− → s. − → σ) of |ψ 〉 〈ψ | with η = 2 3. The unitary operator realizing this process is defined on the combined Hilbert space of the input qubit, the blank qubit and machine by U ′ √ √