Experimental demonstration that qubits can be cloned at will, if encrypted with a single-use decryption key

• URL: http://arxiv.org/abs/2602.10695v1
• Date: Wed, 11 Feb 2026 09:51:32 GMT
• Title: Experimental demonstration that qubits can be cloned at will, if encrypted with a single-use decryption key
• Abstract summary: We find that encrypted cloning is stable under hardware noise, even when used as a module.<n>This establishes it as a versatile quantum primitive for practical use.<n>The actual constraint is that the decryption mechanism must be single-use.
• Score: 0.07037008937757393
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The no-cloning theorem forbids the creation of identical copies of qubits, thereby imposing strong limitations on quantum technologies. A recently-proposed protocol, encrypted cloning, showed, however, that the creation of perfect clones is theoretically possible - if the clones are simultaneously encrypted with a single-use decryption key. It has remained an open question, however, whether encrypted cloning is stable under hardware noise and thus practical as a quantum primitive. This is nontrivial because spreading quantum information widely could dilute it until barely exceeding the noise level, leading to catastrophic fidelity decay. Given the complexity of hardware noise, theory and classical simulation are insufficient to settle this. Here, we settle this question experimentally, on IBM Heron-R2 superconducting processors using up to 154 qubits. We find that encrypted cloning is stable under hardware noise, even when used as a module, namely in parallel, series or interleaved, while preserving pre-existing entanglement. This establishes it as a versatile quantum primitive for practical use, and it necessitates a refinement to our understanding of the no-cloning theorem: quantum information can be spread at will, in theory and in practice, without dilution or degradation, if encrypted or obscured. The actual constraint is that the decryption mechanism must be single-use.

Related papers

• After Theft: From Revocation to Neutralization in the Custody of Quantum Clones [2.0071079975427284]
  Encrypted quantum cloning enables the creation of multiple encrypted clones of an unknown quantum state.<n>We argue that this property supports a distinctive custodial security primitive for post-compromise response.
  arXiv  Detail & Related papers  (2026-09-06T06:28:44Z)
• Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing [0.0]
  We develop a framework for arbitrary dimensions based on Weyl-Heisenberg displacement operators.<n>We prove that an encrypted qudit system comprising two signal-noise qudit pairs is equivalent to a five-party AME state in any dimension.
  arXiv  Detail & Related papers  (2026-05-26T11:24:54Z)
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning [1.9201151941485035]
  We classify subsets of the encrypted-clone storage register into authorized, completely non-informative, and partially informative sets.<n>We show that intermediate non-authorized subsets may retain only a restricted residual dependence on the input state.
  arXiv  Detail & Related papers  (2026-04-11T11:02:06Z)
• Unclonable Cryptography in Linear Quantum Memory [10.502761612692929]
  In cryptography, quantum states are used as long-term cryptographic keys.<n>It will be important to minimize persistent memory in quantum protocols.<n>We develop novel techniques for proving the security of cryptosystems using coset states.
  arXiv  Detail & Related papers  (2025-11-06T18:30:28Z)
• Encrypted Qubits can be Cloned [0.0]
  We show that encrypted cloning of unknown quantum states is possible.<n>A possible application of encrypted cloning is to enable encrypted quantum multi-cloud storage.
  arXiv  Detail & Related papers  (2025-01-06T04:38:59Z)
• Cloning Games, Black Holes and Cryptography [50.022147589030304]
  We introduce a new toolkit for analyzing cloning games.<n>This framework allows us to analyze a new cloning game based on binary phase states.<n>We show that the binary phase variantally optimal bound offers quantitative insights into information scrambling in idealized models of black holes.
  arXiv  Detail & Related papers  (2024-11-07T14:09:32Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Public-Key Encryption with Quantum Keys [11.069434965621683]
  We study the notion of quantum public-key encryption (qPKE) where keys are allowed to be quantum states. We show that computational assumptions are necessary to build quantum public-key encryption.
  arXiv  Detail & Related papers  (2023-06-13T11:32:28Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Photon-phonon quantum cloning in optomechanical system [5.317893030884531]
  cloning of flying bits for further processing from the solid-state quantum bits in storage is an operation frequently used in quantum information processing. We propose a high-fidelity and controllable quantum cloning scheme between solid bits and flying bits.
  arXiv  Detail & Related papers  (2023-02-11T10:09:53Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.