arxiv: 2605.11642 · v1 · submitted 2026-05-12 · 🪐 quant-ph

Recognition: no theorem link

Classification of informative subsets in quantum encrypted cloning on qudits

Chen-Ming Bai, Xin-Liang Zhou, Yu Luo

Pith reviewed 2026-05-13 01:15 UTC · model grok-4.3

classification 🪐 quant-ph

keywords quantum encrypted cloningquditsinformation leakagecongruence systemgeneralized Pauli operatorsno-cloning theoremquantum storage

0 comments

The pith

Unauthorized subsets in qudit encrypted cloning leak information precisely when a system of congruences has nontrivial solutions.

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

The paper classifies which unauthorized subsets of qudits in an encrypted-cloning storage register retain dependence on the original input state. It restricts attention to subsets of size n that contain exactly one qudit from each signal-noise pair. The presence or absence of leakage is decided by whether a system of congruences, whose coefficients depend on the dimension d and on the signal-noise counts in the subset, admits only the trivial solution. When the system has only the trivial solution the reduced state is independent of the input; otherwise the state retains a residual dependence through specific generalized Pauli operators. The full classification is given by a greatest-common-divisor condition that extends the parity rule known for qubits to arbitrary finite dimensions.

Core claim

The reduced state on an unauthorized subset is completely uninformative if and only if the associated congruence system admits only the trivial solution; otherwise it retains a residual dependence on the input state through specific generalized Pauli operators. The complete classification of informative versus uninformative subsets is expressed by a greatest-common-divisor condition on the dimension and the signal-noise composition of the subset.

What carries the argument

A system of congruences whose coefficients are fixed by the dimension d and by the numbers of signal and noise qudits inside the chosen subset; the greatest common divisor of the relevant coefficients determines whether nontrivial solutions exist and therefore whether leakage occurs.

If this is right

For any finite dimension d one can decide exactly which n-subsets are informative by computing the greatest common divisor of the coefficients derived from the subset composition.
The boundary between confidentiality and leakage is dimension-dependent, replacing the simple parity rule that holds for qubits.
When leakage occurs it is carried exclusively by particular generalized Pauli operators on the subset, not by arbitrary operators.
Explicit verification for small n (1, 2, 3) confirms that the general greatest-common-divisor rule reproduces the direct calculation of the reduced state.

Where Pith is reading between the lines

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

The same congruence technique might classify leakage in other quantum storage or secret-sharing schemes that use higher-dimensional carriers.
One could test whether relaxing the one-from-each-pair restriction produces a similar or more complicated set of conditions.
The results suggest concrete parameter choices for d and n that guarantee zero leakage for given storage sizes.

Load-bearing premise

The analysis assumes the standard encoding of the unknown state into signal-noise pairs and restricts attention to unauthorized subsets of size n that contain exactly one qudit from each pair.

What would settle it

Pick any dimension d greater than 2 and any concrete subset composition with n signal-noise pairs; compute the congruence system, solve it, and check whether the reduced density operator on that subset is completely independent of the input state or still varies with the input through the predicted Pauli operators.

read the original abstract

Encrypted cloning offers a means of introducing redundancy into quantum storage while respecting the no-cloning theorem: an unknown state is encoded into multiple signal-noise pairs, and only authorized subsets can recover the original information. However, the leakage properties of unauthorized subsets particularly for higher-dimensional systems (qudits) have remained unexplored. In this work, we systematically classify the informative subsets of the storage register in the qudit encrypted-cloning protocol. We focus on unauthorized subsets of size $n$ that contain exactly one qudit from each signal-noise pair. We show that the presence or absence of information leakage is determined by the solution set of a system of congruences whose coefficients depend on the dimension $d$ and on the numbers of signal and noise qudits in the subset. The reduced state is completely uninformative if and only if the congruence system admits only the trivial solution; otherwise, it retains a residual dependence on the input state through specific generalized Pauli operators. Low-dimensional examples ($n=1,2,3$) are worked out explicitly, and the complete classification is expressed in terms of a greatest-common-divisor condition. Our results extend the parity-based classification known for qubits ($d=2$) to arbitrary finite dimensions, revealing a dimension-dependent boundary of confidentiality in encrypted cloning.

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.

Desk Editor's Note private letter to a colleague

The paper gives a GCD criterion for when unauthorized subsets leak information in qudit encrypted cloning, extending the qubit parity rule to general dimension.

read the letter

The one thing to know is that this paper gives a GCD criterion that tells you exactly when an unauthorized subset leaks information in qudit encrypted cloning, extending the qubit parity rule. They set up a system of congruences whose coefficients come from the dimension d and the number of signal versus noise qudits picked. The reduced state has no information left if and only if that system has only the trivial solution. Otherwise it still depends on the original state through certain generalized Pauli operators. Low-dimensional cases are checked by hand. This is new because the qubit literature stopped at parity, and the general-d version was missing. The derivation uses only the standard properties of the encrypted-cloning encoding and the generalized Pauli group, so it stays close to the protocol. The paper does the reduction well and keeps the scope explicit: only subsets of size n that take one qudit from each pair. That choice makes the congruences manageable. The examples for n=1,2,3 make the result concrete. The soft spot is that the general proof is not reproduced in the abstract, so one would want to see the full steps to be sure the GCD condition covers all cases without gaps. The restriction to this subset family is stated, but it does mean the result does not yet classify every possible unauthorized set. No other issues stand out; there are no free parameters or circular definitions. This work is for people already working on quantum cloning and access structures in higher-dimensional systems. A reader who knows the qubit encrypted-cloning paper will see the direct extension and can use the GCD test in their own calculations. It deserves a serious referee. The math is grounded and the claim is falsifiable from the protocol. I recommend sending it out for review. The contribution is narrow but solid and worth checking in detail.

Referee Report

1 major / 2 minor

Summary. The paper classifies informative unauthorized subsets in qudit encrypted cloning. It restricts attention to subsets of size n containing exactly one qudit from each signal-noise pair and shows that the reduced state is completely uninformative if and only if an associated system of congruences (with coefficients depending on d and the signal/noise counts) admits only the trivial solution; otherwise leakage occurs through specific generalized Pauli operators. The complete classification is given by a GCD condition, extending the parity-based qubit case, with explicit verification for n=1,2,3.

Significance. If the central claim holds, the work supplies a dimension-dependent, mathematically explicit boundary for confidentiality in encrypted cloning on qudits. The reduction to congruence solvability and the GCD criterion provide a clean, parameter-free characterization that could guide protocol design for higher-dimensional quantum storage with controlled leakage.

major comments (1)

The general-case classification via the GCD condition is stated to follow from the action of generalized Pauli operators on the signal-noise encoding, but the manuscript provides explicit derivations only for n=1,2,3. The step that lifts the low-dimensional pattern to arbitrary n (and arbitrary d) therefore requires a self-contained derivation showing how the solution set of the congruence system is completely characterized by the GCD of the relevant coefficients; without it the central claim remains partially unverified.

minor comments (2)

Notation for the signal and noise qudits within each pair should be introduced once at the beginning of the technical section and used consistently thereafter.
The abstract and introduction both refer to 'the complete classification'; a single theorem statement collecting the GCD criterion would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for highlighting the need for a fully explicit general-case derivation. We agree that the manuscript would be strengthened by including a self-contained argument that lifts the n=1,2,3 calculations to arbitrary n and d, and we will revise accordingly.

read point-by-point responses

Referee: The general-case classification via the GCD condition is stated to follow from the action of generalized Pauli operators on the signal-noise encoding, but the manuscript provides explicit derivations only for n=1,2,3. The step that lifts the low-dimensional pattern to arbitrary n (and arbitrary d) therefore requires a self-contained derivation showing how the solution set of the congruence system is completely characterized by the GCD of the relevant coefficients; without it the central claim remains partially unverified.

Authors: We agree that a self-contained derivation for arbitrary n is required. In the revised manuscript we will insert a new subsection that derives the general solution set of the system of congruences. Starting from the action of the generalized Pauli operators on the signal-noise encoding, we show that the reduced state is independent of the input if and only if the only integer solution (modulo d) to the homogeneous system is the trivial one. This occurs precisely when the greatest common divisor of the coefficient vector (whose entries are determined by the signal and noise counts in the subset) is coprime to d. The argument proceeds by elementary number theory: the solvability criterion for linear congruences reduces to the GCD condition, and the explicit low-n cases are recovered as special instances. This establishes the claimed classification without relying on pattern extrapolation. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper derives the classification of informative subsets by examining how generalized Pauli operators act on the standard signal-noise encoding of the encrypted-cloning protocol, producing a system of linear congruences whose solution set (trivial or nontrivial) determines whether the reduced state retains input dependence. The GCD condition on coefficients (depending on d and the signal/noise counts) follows directly from this algebraic analysis and is verified in low-dimensional cases. No parameters are fitted and then relabeled as predictions, no self-definitional loops appear, and any prior qubit results are invoked only as the d=2 special case of the same operator algebra rather than as load-bearing justification for the general claim. The restriction to subsets with exactly one qudit per pair is explicitly scoped and does not create an unsupported reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard properties of qudit Pauli operators and the definition of the encrypted-cloning protocol; no free parameters or new entities are introduced.

axioms (2)

standard math Generalized Pauli operators on d-dimensional systems satisfy the usual commutation and completeness relations
Invoked to express residual dependence of the reduced state on the input.
domain assumption The encrypted-cloning protocol encodes the unknown state into signal-noise qudit pairs with the standard redundancy structure
Defines the storage register whose subsets are classified.

pith-pipeline@v0.9.0 · 5528 in / 1216 out tokens · 26402 ms · 2026-05-13T01:15:57.960475+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages · 1 internal anchor

[1]

A single quantum cannot be cloned.Nature, 299(5886):802–803, 1982

William K Wootters and Wojciech H Zurek. A single quantum cannot be cloned.Nature, 299(5886):802–803, 1982

work page 1982
[2]

Communication by epr devices.Physics Letters A, 92(6):271–272, 1982

DGBJ Dieks. Communication by epr devices.Physics Letters A, 92(6):271–272, 1982

work page 1982
[3]

Quantum cryptography.Scientific American, 267(4):50–57, 1992

Charles H Bennett, Gilles Brassard, and Artur K Ekert. Quantum cryptography.Scientific American, 267(4):50–57, 1992

work page 1992
[4]

Quantum cryptography.Reviews of modern physics, 74(1):145, 2002

Nicolas Gisin, Grégoire Ribordy, Wolfgang Tittel, and Hugo Zbinden. Quantum cryptography.Reviews of modern physics, 74(1):145, 2002

work page 2002
[5]

Advances in quantum cryptography.Advances in optics and photonics, 12(4):1012–1236, 2020

Stefano Pirandola, Ulrik L Andersen, Leonardo Banchi, Mario Berta, Darius Bunandar, Roger Colbeck, Dirk Englund, Tobias Gehring, Cosmo Lupo, Carlo Ottaviani, et al. Advances in quantum cryptography.Advances in optics and photonics, 12(4):1012–1236, 2020

work page 2020
[6]

Security of quantum key distribution.International Journal of Quantum Information, 6(01):1–127, 2008

Renato Renner. Security of quantum key distribution.International Journal of Quantum Information, 6(01):1–127, 2008

work page 2008
[7]

Microsatellite-based real-time quantum key distribution.Nature, 640(8057):47–54, 2025

Yang Li, Wen-Qi Cai, Ji-Gang Ren, Chao-Ze Wang, Meng Yang, Liang Zhang, Hui-Ying Wu, Liang Chang, Jin-Cai Wu, Biao Jin, et al. Microsatellite-based real-time quantum key distribution.Nature, 640(8057):47–54, 2025

work page 2025
[8]

A consoli- dated and accessible security proof for finite-size decoy-state quantum key distribution.Quantum, 10:2037, 2026

Jerome Wiesemann, Jan Krause, Devashish Tupkary, Norbert Lütkenhaus, Davide Rusca, and Nino Walenta. A consoli- dated and accessible security proof for finite-size decoy-state quantum key distribution.Quantum, 10:2037, 2026

work page 2037
[9]

Demonstration of low-overhead quantum error correction codes.Nature Physics, 22:308–314, 2026

Ke Wang, Zhide Lu, Chuanyu Zhang, Gongyu Liu, Jiachen Chen, Yanzhe Wang, Yaozu Wu, Shibo Xu, Xuhao Zhu, Feitong Jin, et al. Demonstration of low-overhead quantum error correction codes.Nature Physics, 22:308–314, 2026

work page 2026
[10]

Quantum error correction beyond su (2): spin, bosonic, and permutation-invariant codes from convex geometry.PRX Quantum, 7(1):010341, 2026

Arda Aydin, Victor V Albert, and Alexander Barg. Quantum error correction beyond su (2): spin, bosonic, and permutation-invariant codes from convex geometry.PRX Quantum, 7(1):010341, 2026

work page 2026
[11]

Quantum copying: Beyond the no-cloning theorem.Physical Review A, 54(3):1844, 1996

Vladimir Bužek and Mark Hillery. Quantum copying: Beyond the no-cloning theorem.Physical Review A, 54(3):1844, 1996

work page 1996
[12]

Quantum copying: Fundamental inequalities.Physical Review A, 56(2):1212, 1997

Mark Hillery and V Bužek. Quantum copying: Fundamental inequalities.Physical Review A, 56(2):1212, 1997

work page 1997
[13]

Probabilistic cloning and identification of linearly independent quantum states

Lu-Ming Duan and Guang-Can Guo. Probabilistic cloning and identification of linearly independent quantum states. Physical review letters, 80(22):4999, 1998

work page 1998
[14]

Virtual cloning of quantum states.Physical Review A, 112(1):012420, 2025

Zhi-Hao Bi, Jing-Tao Qiu, and Xiao-Dong Yu. Virtual cloning of quantum states.Physical Review A, 112(1):012420, 2025

work page 2025
[15]

Encrypted qubits can be cloned.Physical Review Letters, 136(1):010801, 2026

Koji Yamaguchi and Achim Kempf. Encrypted qubits can be cloned.Physical Review Letters, 136(1):010801, 2026

work page 2026
[16]

Performing distributed quantum calculations in a multi-cloud architecture secured by the quantum key distribution protocol.SN Computer Science, 5(4):410, 2024

Jose Luis Lo Huang and Vincent C Emeakaroha. Performing distributed quantum calculations in a multi-cloud architecture secured by the quantum key distribution protocol.SN Computer Science, 5(4):410, 2024

work page 2024
[17]

Quantum secret sharing.Physical Review A, 59(3):1829, 1999

Mark Hillery, Vladimír Bužek, and André Berthiaume. Quantum secret sharing.Physical Review A, 59(3):1829, 1999

work page 1999
[18]

Device-independent quantum secret sharing with advanced random key generation basis

Qi Zhang, Jia-Wei Ying, Zhong-Jian Wang, Wei Zhong, Ming-Ming Du, Shu-Ting Shen, Xi-Yun Li, An-Lei Zhang, Shi- Pu Gu, Xing-Fu Wang, et al. Device-independent quantum secret sharing with advanced random key generation basis. Physical Review A, 111(1):012603, 2025

work page 2025
[19]

Security and fairness in multiparty quantum secret sharing protocol

Alessio Di Santo, Walter Tiberti, and Dajana Cassioli. Security and fairness in multiparty quantum secret sharing protocol. IEEE Transactions on Quantum Engineering, 6:1–18, 2025

work page 2025
[20]

Continuous-variable quantum communication

Vladyslav C Usenko, Antonio Acín, Romain Alléaume, Ulrik L Andersen, Eleni Diamanti, Tobias Gehring, Adnan AE Hajomer, Florian Kanitschar, Christoph Pacher, Stefano Pirandola, et al. Continuous-variable quantum communication. Reviews of Modern Physics, 98(1):015003, 2026

work page 2026
[21]

Cloning encrypted quantum states in arbitrary dimensions

Filip-Ioan Cearˇa. Cloning encrypted quantum states in arbitrary dimensions. 2026

work page 2026
[22]

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

Gabriele Gianini, Omar Hasan, Corrrado Mio, Stelvio Cimato, and Ernesto Damiani. Encrypted clones can leak: Classifi- cation of informative subsets in quantum encrypted cloning.arXiv preprint arXiv:2604.10155, 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026
[23]

Unitary operator bases.Proceedings of the National Academy of Sciences, 46(4):570–579, 1960

Julian Schwinger. Unitary operator bases.Proceedings of the National Academy of Sciences, 46(4):570–579, 1960

work page 1960