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:2303.02662 · Physical Review Research

Simple formulation of no-cloning and no-hiding that admits efficient and robust verification

Matthew Girling, Cristina Cîrstoiu, David Jennings

Published Apr 24, 2024• 3 citations
arXivHTMLPDF

Abstract

Incompatibility is a feature of quantum theory that sets it apart from classical theory, and the inability to clone an unknown quantum state is one of the most fundamental instances. The no-hiding theorem is another such instance that arises in the context of the black-hole information paradox, and can be viewed as being dual to no-cloning. Here, we formulate both of these fundamental features of quantum theory in a single form that is amenable to efficient verification, and that is robust to errors arising in state preparation and measurements. We extend the notion of unitarity—an average figure of merit that for quantum theory captures the coherence of a quantum channel—to general physical theories. Then, we introduce the notion of compatible unitarity pair (CUP) sets, that correspond to the allowed values of unitarities for compatible channels in the theory. We show that a CUP set constitutes a simple “fingerprint” of a physical theory, and that incompatibility can be studied through them. We derive information-disturbance constraints on quantum CUP sets that encode both the no-cloning/broadcasting and no-hiding theorems of quantum theory. We then develop randomized benchmarking protocols that efficiently estimate quantum CUP sets and provide simulations using IBMQ of the simplest instance. Finally, we discuss ways in which CUP sets and quantum no-go theorems could provide additional information to benchmark quantum devices. Published by the American Physical Society 2024

DOI
10.1103/physrevresearch.6.023090

Related papers

No-Cloning Theorem and Quantum Cloning Machines

S. Rajasekar, R. Velusamy

This chapter begins by providing proofs of no-cloning and no-broadcasting theorems. No-cloning theorem makes it possible to detect any eavesdropper on a quantum communication channel. The chapter presents the features of some of the quantum cloning machines. In spite of the no-cloning theorem, it is quite possible to construct a quantum cloning machine which copies an unknown state approximately. A probabilistic cloning machine has been proposed which can succeed only with a probability. When it succeeds it will give a perfect copy. This probabilistic quantum cloning is much useful in studying the B92 quantum key distribution protocol which involves only two non-orthogonal states and we can try to clone it with the largest probability. A telecloning scheme combines cloning with teleportation. A quantum telecloning system for two-level system in which one input is sent to M-receivers has been proposed. The no-hiding theorem is found to have applications in black hole evaporation, quantum teleportation and private quantum channels.

CRC Press eBooks•Oct 5, 2022•0 citations

Robustness-based bounds for approximate joint realizations of incompatible quantum channels

Shintaro Minagawa, Ryo Takakura, Kensei Torii

Several quantum channels may fail to admit an exact joint realization, a property known as incompatibility. Channel incompatibility unifies various quantum limitations, such as measurement uncertainty, the no-information-without-disturbance principle, and the no-cloning and no-broadcasting theorems. We address how accurately incompatible channels can be approximated by the marginals of a single joint channel, quantified by the minimum total diamond-norm error over all joint realizations. We establish two-sided bounds relating it to the generalized robustness of incompatibility (RoI), a noise-based resource quantifier of incompatibility. For identity channels, we determine both the RoI and the minimum total error exactly. The upper bound is attained by the optimal symmetric universal cloner, while the prefactor in the lower bound is asymptotically optimal as the dimension tends to infinity. Applying this result to measurement channels provides a unified, model-independent framework encompassing error-error and information-error-disturbance tradeoffs. Furthermore, our robustness-based evaluation of disturbance outperforms an algebraic bound for every non-trivial POVM in dimensions up to six.

quant-pharXiv:2605.11924•May 13, 2026•1 citation

Operational characterization of incompatibility of quantum channels with quantum state discrimination

Junki Mori

A collection of quantum channels is called incompatible if they cannot be obtained as marginals from a single channel. The no-cloning theorem is the most prominent instance of incompatibility of quantum channels. We show that every collection of incompatible channels can be more useful than compatible ones as preprocessings in a state discrimination task with multiple ensembles of states. This is done by showing that the robustness of channel incompatibility, which is a measure for incompatibility of channels, exactly quantifies the maximum advantage in the state discrimination. We also show that incompatibility of quantum measurement and channel has a similar operational interpretation. Finally, we demonstrate that our result with respect to channel incompatibility includes all other kinds of incompatibility as special cases.

arXiv:1906.09859•Physical Review A•Mar 20, 2020•31 citations

Phase spaces that cannot be cloned in classical mechanics

Yuan Yao

The quantum no cloning theorem is an essential result in quantum information theory. Following this idea, we give a physically natural definition of cloning in the context of classical mechanics using symplectic geometry, building on work of A. Fenyes, J. Math. Phys. 53, 012902 (2012). We observe, following Fenyes, any system with phase space (R2N,dxi∧dyi) can be cloned in our definition. However, we show that if (M, ω) can be cloned in our definition, then M must be contractible. For instance, this shows the simple pendulum cannot be cloned in Hamiltonian mechanics. We further formulate a robust notion of approximate cloning, and show that if (M, ω) can be approximately cloned, then M is contractible. We give interpretations of our results and in some special cases reconcile our no cloning theorems with the general experience that classical information is clonable. Finally we point to new directions of research, including a connection of our result with the classical measurement problem.

arXiv:2303.00255•Journal of Mathematical Physics•Oct 1, 2023•1 citation

Copying Quantum States

Hans Maassen, Burkhard Kümmerer

The no-broadcasting theorem in quantum information says that a set of states on a quantum system admits a common broadcasting (copying) operation if and only if their density matrices belong to a commuting family. We discuss and prove this theorem, as well as the closely related no-cloning theorem in the context of quantum probability theory, i.e. in the category of (finite dimensional) C-star-algebras with unital completely positive maps.

quant-pharXiv:2607.02408•Indian Journal of Pure and Applied Mathematics•Jul 3, 2026•0 citations

No-Cloning in Categorical Quantum Mechanics

Samson Abramsky

The no-cloning theorem is a basic limitative result for quantum mechanics, with particular significance for quantum information. It says that there is no unitary operation that makes perfect copies of an unknown (pure) quantum state. We re-examine this foundational result from the perspective of the categorical formulation of quantum mechanics recently introduced by the author and Bob Coecke. We formulate and prove a novel version of the result, as an incompatibility between having a “natural” copying operation and the structural features required for modeling quantum entanglement coexisting in the same category. This formulation is strikingly similar to a well-known limitative result in categorical logic, Joyal's lemma, which shows that a “Boolean cartesian closed category” trivializes and hence provides a major roadblock to the computational interpretation of classical logic. This shows a heretofore unsuspected connection between limitative results in proof theory and no-go theorems in quantum mechanics. The argument is of a robust, topological character and uses the graphical calculus for monoidal categories to advantage. 1.1 Introduction The no-cloning theorem (Dieks 1982; Wootters and Zurek 1982) is a basic limitative result for quantum mechanics, with particular significance for quantum information. It says that there is no unitary operation that makes perfect copies of an unknown (pure) quantum state. A stronger form of this result is the no-broadcasting theorem (Barnum et al. 1996), which applies to mixed states. There is also a no-deleting theorem (Pati and Braunstein 2000).

arXiv:0910.2401•Cambridge University Press eBooks•Nov 30, 2009•70 citations
Incompatibility is a feature of quantum theory that sets it apart from classical theory, and the inability to clone an unknown quantum state is one of the most fundamental instances. The no-hiding theorem is another such instance that arises in the context of the black-hole information paradox, and can be viewed as being dual to no-cloning. Here, we formulate both of these fundamental features of quantum theory in a single form that is amenable to efficient verification, and that is robust to errors arising in state preparation and measurements. We extend the notion of unitarity—an average figure of merit that for quantum theory captures the coherence of a quantum channel—to general physical theories. Then, we introduce the notion of compatible unitarity pair (CUP) sets, that correspond to the allowed values of unitarities for compatible channels in the theory. We show that a CUP set constitutes a simple “fingerprint” of a physical theory, and that incompatibility can be studied through them. We derive information-disturbance constraints on quantum CUP sets that encode both the no-cloning/broadcasting and no-hiding theorems of quantum theory. We then develop randomized benchmarking protocols that efficiently estimate quantum CUP sets and provide simulations using IBMQ of the simplest instance. Finally, we discuss ways in which CUP sets and quantum no-go theorems could provide additional information to benchmark quantum devices. Published by the American Physical Society 2024
This chapter begins by providing proofs of no-cloning and no-broadcasting theorems. No-cloning theorem makes it possible to detect any eavesdropper on a quantum communication channel. The chapter presents the features of some of the quantum cloning machines. In spite of the no-cloning theorem, it is quite possible to construct a quantum cloning machine which copies an unknown state approximately. A probabilistic cloning machine has been proposed which can succeed only with a probability. When it succeeds it will give a perfect copy. This probabilistic quantum cloning is much useful in studying the B92 quantum key distribution protocol which involves only two non-orthogonal states and we can try to clone it with the largest probability. A telecloning scheme combines cloning with teleportation. A quantum telecloning system for two-level system in which one input is sent to M-receivers has been proposed. The no-hiding theorem is found to have applications in black hole evaporation, quantum teleportation and private quantum channels.
Several quantum channels may fail to admit an exact joint realization, a property known as incompatibility. Channel incompatibility unifies various quantum limitations, such as measurement uncertainty, the no-information-without-disturbance principle, and the no-cloning and no-broadcasting theorems. We address how accurately incompatible channels can be approximated by the marginals of a single joint channel, quantified by the minimum total diamond-norm error over all joint realizations. We establish two-sided bounds relating it to the generalized robustness of incompatibility (RoI), a noise-based resource quantifier of incompatibility. For identity channels, we determine both the RoI and the minimum total error exactly. The upper bound is attained by the optimal symmetric universal cloner, while the prefactor in the lower bound is asymptotically optimal as the dimension tends to infinity. Applying this result to measurement channels provides a unified, model-independent framework encompassing error-error and information-error-disturbance tradeoffs. Furthermore, our robustness-based evaluation of disturbance outperforms an algebraic bound for every non-trivial POVM in dimensions up to six.
A collection of quantum channels is called incompatible if they cannot be obtained as marginals from a single channel. The no-cloning theorem is the most prominent instance of incompatibility of quantum channels. We show that every collection of incompatible channels can be more useful than compatible ones as preprocessings in a state discrimination task with multiple ensembles of states. This is done by showing that the robustness of channel incompatibility, which is a measure for incompatibility of channels, exactly quantifies the maximum advantage in the state discrimination. We also show that incompatibility of quantum measurement and channel has a similar operational interpretation. Finally, we demonstrate that our result with respect to channel incompatibility includes all other kinds of incompatibility as special cases.
The quantum no cloning theorem is an essential result in quantum information theory. Following this idea, we give a physically natural definition of cloning in the context of classical mechanics using symplectic geometry, building on work of A. Fenyes, J. Math. Phys. 53, 012902 (2012). We observe, following Fenyes, any system with phase space (R2N,dxi∧dyi) can be cloned in our definition. However, we show that if (M, ω) can be cloned in our definition, then M must be contractible. For instance, this shows the simple pendulum cannot be cloned in Hamiltonian mechanics. We further formulate a robust notion of approximate cloning, and show that if (M, ω) can be approximately cloned, then M is contractible. We give interpretations of our results and in some special cases reconcile our no cloning theorems with the general experience that classical information is clonable. Finally we point to new directions of research, including a connection of our result with the classical measurement problem.
The no-cloning theorem is a basic limitative result for quantum mechanics, with particular significance for quantum information. It says that there is no unitary operation that makes perfect copies of an unknown (pure) quantum state. We re-examine this foundational result from the perspective of the categorical formulation of quantum mechanics recently introduced by the author and Bob Coecke. We formulate and prove a novel version of the result, as an incompatibility between having a “natural” copying operation and the structural features required for modeling quantum entanglement coexisting in the same category. This formulation is strikingly similar to a well-known limitative result in categorical logic, Joyal's lemma, which shows that a “Boolean cartesian closed category” trivializes and hence provides a major roadblock to the computational interpretation of classical logic. This shows a heretofore unsuspected connection between limitative results in proof theory and no-go theorems in quantum mechanics. The argument is of a robust, topological character and uses the graphical calculus for monoidal categories to advantage. 1.1 Introduction The no-cloning theorem (Dieks 1982; Wootters and Zurek 1982) is a basic limitative result for quantum mechanics, with particular significance for quantum information. It says that there is no unitary operation that makes perfect copies of an unknown (pure) quantum state. A stronger form of this result is the no-broadcasting theorem (Barnum et al. 1996), which applies to mixed states. There is also a no-deleting theorem (Pati and Braunstein 2000).