pith. machine review for the scientific record. sign in

arxiv: 2604.04888 · v1 · submitted 2026-04-06 · 🪐 quant-ph

Recognition: 2 theorem links

· Lean Theorem

Cloning Encrypted Quantum States in Arbitrary Dimensions

Filip-Ioan Cear\u{a}

Authors on Pith no claims yet

Pith reviewed 2026-05-10 18:47 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum cloningencrypted quantum statesquditsunitary operatorsquantum circuitsno-cloning theoremhigher-dimensional quantum systems
0
0 comments X

The pith

Encrypted quantum states can be cloned in any finite dimension using a new unitary operator.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper extends a recent qubit result to show that encrypted states of higher-dimensional quantum systems, called qudits, can also be cloned. A direct lift of the original encryption method fails the unitarity condition needed for a valid quantum operation, so the authors define a different operator that remains unitary for any dimension. They adjust the decryption step to recover the cloned copies and verify that the full circuit uses resources that grow only linearly with dimension. This matters because it provides a concrete route to duplicate protected quantum information in systems beyond two-level qubits without breaking the no-cloning rule or exposing the data.

Core claim

We generalize the encrypted cloning protocol and prove that it also applies to higher-order quantum systems. Given that a straightforward generalization of the protocol using the exponential of the shift and phase operators fails to satisfy the unitary requirement for a quantum gate, we propose a different approach. We introduce a new operator to be used in the encryption process and show that it is unitary. We adapt the decryption operator from the reference paper to fit in the framework of multi-level quantum systems. We analyze the circuit implementation of the proposed operators and show that the overhead imposed by larger dimensions scales linearly with qudit dimension.

What carries the argument

A newly constructed unitary operator that encrypts qudit states so that cloning remains possible while encryption is preserved.

If this is right

  • The cloning protocol works for quantum systems of any finite dimension.
  • Circuit resources required for encryption, cloning, and decryption increase only linearly with dimension.
  • Decryption recovers the cloned states correctly while leaving the original encryption intact.
  • The construction satisfies both the no-cloning theorem and the encryption security requirement.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The linear scaling makes the protocol potentially feasible to test on current qudit platforms such as trapped ions or photonic systems.
  • Similar operator constructions might be explored for other qubit-limited protocols that one wishes to lift to higher dimensions.
  • The approach preserves encryption during duplication, which could matter for protocols that must handle protected quantum data without revealing it.

Load-bearing premise

The new operator must satisfy the unitarity condition for every dimension, and the adapted decryption step must recover identical cloned copies without violating encryption or no-cloning constraints.

What would settle it

An explicit matrix calculation showing that the proposed operator fails U dagger times U equals the identity matrix for dimension three, or a numerical simulation in which the decrypted output states differ from the original input by more than the expected cloning fidelity.

Figures

Figures reproduced from arXiv: 2604.04888 by Filip-Ioan Cear\u{a}.

Figure 1
Figure 1. Figure 1: FIG. 1. 2D Autocorrelation for [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Quantum circuit for implementation of [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Quantum circuit for implementation of [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Comparison of [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
read the original abstract

Recently, Yamaguchi and Kempf [Phys. Rev. Lett. 136:010801, arXiv:2501.02757] proved that encrypted qubits can be cloned. In this work, we generalize the encrypted cloning protocol and prove that it also applies to higher-order quantum systems. Given that a straightforward generalization of the protocol using the exponential of the shift and phase operators fails to satisfy the unitary requirement for a quantum gate, we propose a different approach. We introduce a new operator to be used in the encryption process and show that it is unitary. We adapt the decryption operator from the reference paper to fit in the framework of multi-level quantum systems. We analyze the circuit implementation of the proposed operators and show that the overhead imposed by larger dimensions scales linearly with qudit dimension.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript generalizes the encrypted cloning protocol of Yamaguchi and Kempf from qubits to qudits of arbitrary dimension d. Because the direct generalization via exp(shift + phase) fails to be unitary, a new encryption operator is introduced and proven unitary; the decryption operator is adapted from the qubit case, and the circuit implementation is analyzed to show that overhead scales linearly with d.

Significance. If the unitarity proof and the correctness of the adapted decryption hold, the result extends encrypted quantum cloning beyond qubits, which is relevant for qudit-based quantum information processing and cryptography. The explicit linear scaling of circuit overhead is a concrete practical strength of the work.

major comments (2)
  1. [§2] §2 (new encryption operator): the manuscript must supply the explicit definition of the new operator together with the derivation that it is unitary for general d (i.e., U†U = I). The abstract states the result but the load-bearing claim requires the algebraic verification.
  2. [§3] §3 (adapted decryption): unitarity of the encryption operator alone does not guarantee that the adapted decryption map commutes correctly with the cloning operation on the encrypted state. The paper must demonstrate explicitly that both cloned copies are recovered without introducing dimension-dependent phase or basis mismatch that would violate the original encryption constraints.
minor comments (2)
  1. Include a small table or explicit matrix elements for the new operator at small d (e.g., d=3) to allow immediate verification of unitarity.
  2. [§4] The circuit diagram in §4 should label every gate with its dimension-dependent cost so that the claimed linear scaling is visually evident.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. The comments highlight areas where additional explicit details will strengthen the presentation. We address each major comment below and have revised the manuscript to incorporate the requested clarifications and algebraic verifications.

read point-by-point responses

  1. Referee: [§2] §2 (new encryption operator): the manuscript must supply the explicit definition of the new operator together with the derivation that it is unitary for general d (i.e., U†U = I). The abstract states the result but the load-bearing claim requires the algebraic verification.

    Authors: We agree that the explicit definition and full algebraic verification of unitarity for arbitrary d should be provided in detail. Although the manuscript states that the new operator is unitary, the step-by-step derivation was not expanded sufficiently in §2. In the revised version, we now include the explicit operator expression (defined via its action on the computational basis of the qudit space) and derive U†U = I by direct computation, verifying the inner products and orthogonality conditions hold independently of d. revision: yes

  2. Referee: [§3] §3 (adapted decryption): unitarity of the encryption operator alone does not guarantee that the adapted decryption map commutes correctly with the cloning operation on the encrypted state. The paper must demonstrate explicitly that both cloned copies are recovered without introducing dimension-dependent phase or basis mismatch that would violate the original encryption constraints.

    Authors: This observation is correct and helpful. Unitarity alone does not automatically ensure compatibility with the cloning map and decryption. In the revised manuscript, we have added an explicit operator-level verification in §3: we compose the full sequence (encryption, cloning, adapted decryption) and show by direct calculation on basis states that each cloned copy decrypts to the original state without extraneous d-dependent phases or basis transformations. The adapted decryption is shown to commute appropriately with the cloning operation within the encrypted subspace. revision: yes

Circularity Check

0 steps flagged

Independent generalization of encrypted cloning via new unitary operator

full rationale

The paper cites an external qubit protocol (Yamaguchi and Kempf) and explicitly notes that a direct exponential generalization fails unitarity, then defines and proves unitarity for a new operator before adapting the decryption map. All load-bearing steps are direct constructions and verifications in standard quantum mechanics for arbitrary d, with no reduction to self-definitions, fitted inputs renamed as predictions, or load-bearing self-citations. The central claim is a proof of applicability to qudits, which remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The work relies on standard quantum mechanics for unitarity and no-cloning principles, plus the prior qubit protocol. The new operator is introduced as a mathematical construct without additional physical postulates.

axioms (2)
  • standard math Quantum operations must be unitary to preserve probability.
    Invoked when rejecting the exponential of shift/phase operators and requiring the new operator to be unitary.
  • domain assumption The no-cloning theorem applies to unknown quantum states but can be circumvented for encrypted states.
    Underlying the entire encrypted cloning framework from the cited work.
invented entities (1)
  • New encryption operator for qudits no independent evidence
    purpose: To satisfy unitarity while enabling encrypted cloning in arbitrary dimensions
    Introduced to replace the failing exponential construction; shown to be unitary but no independent physical motivation or falsifiable prediction given.

pith-pipeline@v0.9.0 · 5417 in / 1294 out tokens · 34986 ms · 2026-05-10T18:47:48.882180+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning

    quant-ph 2026-04 unverdicted novelty 5.0

    Non-authorized subsets in quantum encrypted cloning can retain restricted residual information about the input state in a parity-dependent pattern, revealing a structural confidentiality limitation.

Reference graph

Works this paper leans on

15 extracted references · cited by 1 Pith paper

  1. [1]

    ,3},(21) where the operatorsσ µ represent the Pauli operators {I2, X2, Y2, Z2}

    In the original paper, the authors used the following result σ(Ni) µ T ⊗σ (Si) µ |Φ2⟩=|Φ 2⟩,∀µ∈ {0, . . . ,3},(21) where the operatorsσ µ represent the Pauli operators {I2, X2, Y2, Z2}. Ford≥3, this result does not apply; thus, we propose the following theorem, whose proof is provided in Appendix E 1. Theorem III.1.The following identity X (Q1 ) d k1 Z (Q...

  2. [2]

    In this Appendix, we provide the derivation for the qudit identity X (A) d k1 Z (A) d −k2 ⊗X (B) d k1 Z (B) d k2 |Φd⟩=|Φ d⟩,(E1) for any dimensiond≥2 andk 1, k2 ∈ {0,

    Proof of the Theorem III.1 Let|Φ d⟩be the generalized Bell state andX d, Zd be the generalized Pauli operators. In this Appendix, we provide the derivation for the qudit identity X (A) d k1 Z (A) d −k2 ⊗X (B) d k1 Z (B) d k2 |Φd⟩=|Φ d⟩,(E1) for any dimensiond≥2 andk 1, k2 ∈ {0, . . . , d−1}. Proof.We prove the theorem by fixing one of the opera- tors, con...

  3. [3]

    We prove the identity TrB (O1 ⊗I (B) d )|Φ d⟩A,B ⟨Φd|A,B (O† 2 ⊗I (B) d ) = 1 d O1O† 2

    Proof of the Theorem III.2 Let|Φ d⟩be the generalized Bell state,O 1, O2 be two general one-qudit operators andI (B) d be the identity ap- plied on the subsystem B. We prove the identity TrB (O1 ⊗I (B) d )|Φ d⟩A,B ⟨Φd|A,B (O† 2 ⊗I (B) d ) = 1 d O1O† 2. (E2) Proof. LHS= 1 d d−1X l,p1,p2=0 (I (A) d ⟨l|B)(O1 ⊗I (B) d ) (|p1⟩A ⟨p2|A)· ·(|p 1⟩B ⟨p2|B) (O† 2 ⊗I...

  4. [4]

    We prove the identity Tr (X k dZ l d ⊗I d)|Φ d⟩ ⟨Φd|(Z −n d X −m d ⊗I d) =δ k,mδl,n, (E3) for anym, n∈ {0,

    Proof of the Theorem III.3 Let|Φ d⟩be the generalized Bell state andX d, Zd be the generalized Pauli operators. We prove the identity Tr (X k dZ l d ⊗I d)|Φ d⟩ ⟨Φd|(Z −n d X −m d ⊗I d) =δ k,mδl,n, (E3) for anym, n∈ {0, . . . , d−1}. Proof. LHS= Tr (X k d Z l d ⊗I d)|Φ d⟩ ⟨Φd|)(Z −n d X m d ⊗I d) Using the permutation property of the trace = Tr ⟨Φd|(Z −n d...

  5. [5]

    M. M. Wilde,Quantum Information Theory(Cambridge University Press, 2013)

    2013

  6. [6]

    N. T. Islam, C. C. W. Lim, C. Cahall, J. Kim, and D. J. Gauthier, Provably secure and high-rate quantum key distribution with time-bin qudits, Science Advances3, e1701491 (2017)

    2017

  7. [7]

    Ionicioiu, Sorting quantum systems efficiently, Sci

    R. Ionicioiu, Sorting quantum systems efficiently, Sci. Rep.6, 25356 (2016)

    2016

  8. [8]

    Tavakoli, I

    A. Tavakoli, I. Herbauts, M. ˙Zukowski, and M. Bouren- nane, Secret sharing with a singled-level quantum sys- tem, Phys. Rev. A92, 030302 (2015)

    2015

  9. [9]

    Yamaguchi and A

    K. Yamaguchi and A. Kempf, Encrypted qubits can be cloned, Phys. Rev. Lett.136, 010801 (2026)

    2026

  10. [10]

    Weyl,The Theory of Groups and Quantum Mechanics (Dover, 1931)

    H. Weyl,The Theory of Groups and Quantum Mechanics (Dover, 1931)

    1931

  11. [11]

    M. A. Nielsen and I. L. Chuang,Quantum Computa- tion and Quantum Information: 10th Anniversary Edi- tion(Cambridge University Press, 2010)

    2010

  12. [12]

    Chu, Polyphase codes with good periodic correlation properties (corresp.), IEEE Transactions on Information Theory18, 531 (1972)

    D. Chu, Polyphase codes with good periodic correlation properties (corresp.), IEEE Transactions on Information Theory18, 531 (1972)

    1972

  13. [13]

    Popovic, Generalized chirp-like polyphase sequences with optimum correlation properties, IEEE Transactions on Information Theory38, 1406 (1992)

    B. Popovic, Generalized chirp-like polyphase sequences with optimum correlation properties, IEEE Transactions on Information Theory38, 1406 (1992)

    1992

  14. [14]

    A. S. Nikolaeva, E. O. Kiktenko, and A. K. Fedorov, Effi- cient realization of quantum algorithms with qudits, EPJ Quantum Technology11, 43 (2024)

    2024

  15. [15]

    Di and H.-R

    Y.-M. Di and H.-R. Wei, Synthesis of multivalued quan- tum logic circuits by elementary gates, Phys. Rev. A87, 012325 (2013)

    2013