Classifying Informative Subsets in Qudit Encrypted Cloning via Congruence Systems
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.
Kai: I'm Kai.
Mira: And I'm Mira, here with Lev.
Kai: We're looking at the paper: "Classifying Informative Subsets in Qudit Encrypted Cloning via Congruence Systems".
Paper summary: Mira: So, summarizing the title "Classifying Informative Subsets in Qudit Encrypted Cloning via Congruence Systems," this paper systematically classifies subsets of size n that pick exactly one qudit from each signal and noise pair in a qudit encrypted cloning protocol. They show that the reduced state is completely uninformative if and only if the greatest common divisor of d, p times q plus one minus one equals one.
Kai: Essentially, they move beyond simple parity rules by showing that the presence or absence of information leakage is determined by this solution set of congruences involving the dimension d and the number of signal and noise qudits in that subset. The reduced state is completely uninformative if this greatest common divisor condition equals one, otherwise it retains a residual dependence through specific generalized Pauli expectations.
Lev: For the world, what does this mean for real-world quantum storage? It gives us a concrete mathematical boundary for confidentiality in these systems based on dimension and subset size. It sets up the arithmetic constraints we need to worry about when designing redundant quantum memory schemes.
Mira: The implication is that authorization and information leakage are not strict opposites in qudit-based redundancy. We can now precisely quantify the conditions under which a subset of storage registers remains completely uninformative versus being partially informative through this congruence system analysis.
Kai: The work provides a rigorous foundation for assessing information leakage in these protocols. The future direction they point toward is extending this classification to subsets that actually contain the original input qudit, which opens up new avenues for understanding how the whole system behaves when we look at the authorized set itself.
Conclusion: Kai: So, this paper is about how to systematically classify which small groups of quantum storage spots actually leak information when you try to clone something using qudits.
Mira: It tackles this by looking at these specific subsets of size n that pick exactly one spot from every signal and noise pair in the cloning protocol.
Lev: The core finding is that whether that subset leaks anything or not boils down to a simple math condition involving the dimension of your space, d, and how many signal spots p and noise spots q you're looking at.
Kai: Right, so it’s not some complicated parity check anymore; it’s this greatest common divisor condition between d and p times q plus one minus one.
Mira: Exactly. If that greatest common divisor equals one, the subset is completely uninformative, meaning it tells you absolutely nothing about the original state.
Lev: If that condition isn't met, then even if you only have a few spots in that subset, it still retains some dependence on the input state through these specific Pauli operators.
Kai: It changes how we think about security boundaries here; it’s not just "yes or no" leakage based on simple rules.
Mira: It sets up a much more precise arithmetic boundary for when quantum redundancy fails to be perfectly hidden.
Lev: This kind of rigorous classification is what we need when we start designing the actual hardware and figuring out the overhead for error correction schemes.
Kai: And they’ve even looked at some low-dimensional examples, like n equals one, showing how the rules change depending on whether you're dealing with a qubit or a higher dimension qudit.
Mira: It really shows how sensitive this classification is to the underlying structure of the Hilbert space itself.
Lev: So they’ve given us a tool to map out exactly where our information loss happens in these encrypted cloning scenarios.
Kai: And this leads us into what the authors are looking at next, which is actually classifying those subsets that *do* contain the original input qudit.
Chen-Ming Bai, * Xin-Liang Zhou, * Yu Luo
Department of Mathematics and Physics, Shijiazhuang Tiedao University · School of Artificial Intelligence and Computer Science, Shaanxi Normal University
quant-ph
Submitted: 2026-05-12
Updated: 2026-11-15
Comments: 17 pages
Journal ref: Physical Review A 114, 052422 (2026)
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 87/100
The gist: Classification of informative subsets in quantum encrypted cloning on qudits systematically classifies unauthorized subsets of size n that contain exactly one qudit from each signal-noise pair in a…
Key concepts
- Qudit Encrypted Cloning
- This protocol introduces redundancy by encoding an unknown quantum state into multiple signal-noise pairs while respecting the no-cloning theorem. It allows for 'clonable but decryptable-only-once' quantum redundancy, extending qubit cloning to higher dimensions (qudits) using encryption operators based on CAZAC sequences.
- Generalized Pauli Operators
- These are specific mathematical operators, like the shift operator Xd and phase operator Zd, defined in a d-dimensional Hilbert space. They are used to analyze the density matrix of the encoded state and reveal residual dependence on the input state when information leakage occurs.
- Congruence System Condition
- The presence or absence of information leakage is governed by solving a system of congruences involving dimension d, signal qudits p, and noise qudits q. The reduced state is completely uninformative only if this system has only the trivial solution; otherwise, it retains residual dependence on the input state.
Terminology
Summary
Classification of informative subsets in quantum encrypted cloning on qudits systematically classifies unauthorized subsets of size n that contain exactly one qudit from each signal-noise pair in a qudit encrypted-cloning protocol The reduced state is completely uninformative if and only if gcd(d, p(q + 1) − 1) = 1, otherwise it retains a residual dependence on the input state through specific generalized Pauli operators
Protocol Foundation
Encrypted cloning offers a means of introducing redundancy into quantum storage while respecting the no-cloning theorem This protocol enables clonable but decryptable-only-once
quantum redundancy by interacting the original qubit with pre-prepared Bell pairs to generate signal and noise qudits Cearaˇ extended this to qudits, addressing non-unitarity through encryption operators based on CAZAC sequences
Generalized Operators and Encoding
The analysis utilizes generalized Pauli operators, defined by the shift operator Xd and phase operator Zd in a d-dimensional Hilbert space The encoding unitary U(n)encd jointly acts on the input qudit A and the signal qudits S1, · · ·, Sn while leaving noise qudits unaffected The density matrix of the encoded state is expressed in terms of these operators and coefficients ckl
Leakage Mechanism Analysis
The leakage mechanism is governed by the solution set of a system of congruences involving the dimension d, the number p of signal qudits, and q = n − p noise qudits The reduced state is completely uninformative if and only if gcd(d, p(q + 1) − 1) = 1 Otherwise, the subset retains a residual dependence on the input state through specific generalized Pauli expectations
Classification Results
The complete classification for aligned unauthorized subsets Bn,p is given by a closed-form expression involving the greatest common divisor g = gcd(d, p(q + 1) − 1) The reduced state is completely uninformative if gcd(d, p(q + 1) − 1) = 1, and otherwise it is partially informative This result extends the parity-based classification for qubits to arbitrary finite dimensions
Low-Dimensional Illustrations
For n=3, unauthorized sets are completely uninformative if gcd(d, 2) = 1 or gcd(d, 3) = 1 They are partially informative if gcd(d, 2) = 2 or gcd(d, 3) = 3 For n=1, the subset S1 is partially informative with a dependence on Xa dZ−a d where a ≠ 0 The subset N1 is completely uninformative for n=3
Conclusion and Implications
These results reveal a dimension-dependent boundary of confidentiality in encrypted cloning The work provides a rigorous foundation for assessing information leakage in qudit-based redundant quantum storage Leakage occurs only under precise arithmetic conditions dictated by the congruence systems Future directions include extending the classification to subsets containing the original input qudit The paper establishes that authorization
and information leakage
are not strict opposites
Acknowledgments
The authors acknowledge support from the Nation Natural Science Foundation of China under Grant No. 12301590 and the Science Research Project of Hebei Education Department under Grant No. p. 0 BJ2025061 The research was supported by anonymous reviewers for constructive comments The paper is available as arXiv:quant-ph/arXiv:2605. p. 011642v1 The paper is dated 12 May 2026 The paper is titled Classifying Informative Subsets in Qudit Encrypted Cloning via Congruence Systems
References
[1] William K Wootters and Wojciech H Zurek. A single quantum cannot be cloned. p. 3 Nature, 299(5886):802–803, 1982
[2] DGBJ Dieks. Communication by epr devices. p. 0 Physics Letters A, 92(6):271–272, 1982
[3] Charles H Bennett, Gilles Brassard, and Artur K Ekert. Quantum cryptography. p. 0 p. 0 Scientific American, 267(4):50–57, 1992
[4] Nicolas Gisin, Grégoire Ribordy, Wolfgang Tittel, and Hugo Zbinden. Quantum cryptography. Reviews of modern physics, 74(1):145, 2002
[5] Stefano Pirandola et al. Advances in quantum cryptography. p. 0 Advances in optics and photonics, 12(4):1012–1236, 2020
[6] Renato Renner. Security of quantum key distribution. p. 0 International Journal of Quantum Information, 6(01):1–127, 2008
[7] Yang Li et al. Microsatellite-based real-time quantum key distribution. p. 0 Nature, 640(8057):47–54, 2025
[8] Jerome Wiesemann et al. A consolidated and accessible security proof for finite-size decoy-state quantum key distribution. p. 0 Quantum, 10:2037, 2026
[9] Ke Wang et al. Demonstration of low-overhead quantum error correction codes. p. 0 Nature Physics, 22:308–314, 2026
[10] Arda Aydin et al. Quantum error correction beyond su (2): spin, bosonic, and permutation-invariant codes from convex geometry. p. 0 PRX Quantum, 7(1):010341, 2026
[11] Vladimir Bužek and Mark Hillery. Quantum copying: Beyond the no-cloning theorem. p. 0 Physical Review A, 54(3):1844, 1996
[12] Mark Hillery and V Bužek. Quantum copying: Fundamental inequalities. p. 0 Physical Review A, 56(2):1212, 1997
[13] Lu-Ming Duan and Guang-Can Guo. Probabilistic cloning and identification of linearly independent quantum states. p. 0 Physical review letters, 80(22):4999, 1998
[14] Zhi-Hao Bi et al. Virtual cloning of quantum states. p. 0 Physical Review A, 112(1):012420, 2025
[15] Koji Yamaguchi and Achim Kempf. Encrypted qubits can be cloned. p. 0 Physical Review Letters, 136(1):010801, 2026
[16] Jose Luis Lo Huang and Vincent C Emeakaroha. Performing distributed quantum calculations in a multi-cloud architecture secured by the quantum key distribution protocol. p. 0 SN Computer Science, 5(4):410, 2024
[17] Mark Hillery et al. Quantum secret sharing. p. 0 Physical Review A, 59(3):1829, 1999
[18] Qi Zhang et al. Device-independent quantum secret sharing with advanced random key generation basis. p. 0 Physical Review A, 111(1):012603, 2025
[19] Alessio Di Santo et al. Security and fairness in multiparty quantum secret sharing protocol. p. 0 IEEE Transactions on Quantum Engineering, 6:1–18, 2025
[20] Vladyslav C Usenko et al. Continuous-variable quantum communication. p. 0 Reviews of Modern Physics, 98(1):015003, 2026
[21] Filip-Ioan Cearaˇ. Cloning encrypted quantum states in arbitrary dimensions. p. 0 2026
[23] Julian Schwinger. Unitary operator bases. p. 1 Proceedings of the National Academy of Sciences, 46(4):570–579, 1960
Page 1
Classification of informative subsets in quantum encrypted cloning on qudits Chen-Ming Bai, Xin-Liang Zhou and Yu Luo 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
Page 2
subsets that contain exactly one qudit from each signal-noise pair i.e., aligned subsets of size n Through analytical computation of the reduced density matrix and exploitation of the algebraic structure of generalized Pauli operators, we show that the occurrence of leakage no longer depends on simple parity conditions Instead, it is governed by the solution set of a system of congruences, which ultimately reduces to a greatest-common-divisor condition involving the dimension d, the number p of signal qudits, and the number q = n − p of noise qudits Specifically, for an aligned subset consisting of p signal qudits and q noise qudits, we prove that the reduced state is completely uninformative (maximally mixed) if and only if gcd(d, p(q + 1) − 1) = 1 Otherwise, the subset retains a residual dependence on the input state, which manifests through specific generalized Pauli expectations; such subsets are therefore partially informative
Page 3
For any natural number d, let Zd = Set of congruence classes modulo d Then we consider a d-dimensional Hilbert space H with a computational basis i⟩ i ∈ Zd Furthermore, we define the shift operator Xd and the phase operator Zd on H as follows These operators act on the computational basis as Xdk⟩ = k + 1⟩, Zdk⟩ = ω k⟩, for k ∈ Zd, with ω = e 2πi / d
Page 4
For any subset B Subset of Rn that misses a complete pair Sj Nj is completely non-informative This implies that any subset of B Subset missing even a single full pair Sj Nj is completely uninformative about the initial state ψ⟩
Page 5
For n = 1, the subset S1 is partially informative with a dependence on the quantity ⟨ψ Xa dZ−a d ψ⟩ (with a ≠ 0) The subset N1 is completely uninformative for n=1
Page 7
The unauthorized set S1N2 is completely uninformative and the unauthorized set S1S2 is completely uninformative For n = 3, the unauthorized sets consisting of three qudits that take exactly one from each pair are completely uninformative if gcd(d, 2) = 1 or gcd(d, 3) = 1 They are partially informative if gcd(d, 2) = 2 or gcd(d, 3) = 3
Page 9
By the reduction established in Section II, the only unauthorized subsets that remain to be classified are the aligned subsets Bn,p = Set of S1,..., Sp, Np+1,...
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Classification of informative subsets in quantum encrypted cloning on qudits allows for a dimension-dependent confidentiality boundary in encrypted cloning. This enables AI systems to precisely determine whether an unauthorized subset of stored quantum information retains residual dependence on the original input state through specific generalized Pauli operators.
-
The determination of whether a subset is completely uninformative or partially informative depends entirely on the greatest common divisor condition gcd(d, p(q + 1) − 1) = 1, where d is the dimension and p and q are the number of signal and noise qudits in the subset. This provides a rigorous algebraic tool for assessing information leakage beyond simple parity conditions.
-
AI systems can utilize these results to predict, with certainty, if a specific set of stored qudits will be completely uninformative or partially informative based on the dimension of the quantum system and its composition. This capability allows for designing storage registers where unauthorized access is guaranteed to yield no information about the original input state.
Sources
Related papers
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements
- Barriers to dequantization of near-term molecular electronic structure methods
- BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers
- Non-Hermiticity of an anomalous superradiant phase