Unauthorized subsets in qudit encrypted cloning are uninformative exactly when a congruence system has only the trivial solution, classified by a greatest-common-divisor condition that extends the qubit parity case.
Encrypted qubits can be cloned.Physical Review Letters, 136(1):010801
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
extension 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
extension 1polarities
extend 1representative citing papers
Subsets H = {A} ∪ C in quantum encrypted cloning are fully informative except when all pairs are incomplete and |C| < n (uninformative) or when |C| = n, n odd and q even (partially informative on y-Bloch component).
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.
citing papers explorer
-
Classification of informative subsets in quantum encrypted cloning on qudits
Unauthorized subsets in qudit encrypted cloning are uninformative exactly when a congruence system has only the trivial solution, classified by a greatest-common-divisor condition that extends the qubit parity case.
-
Full characterization of informative subsets in Quantum Encrypted Cloning
Subsets H = {A} ∪ C in quantum encrypted cloning are fully informative except when all pairs are incomplete and |C| < n (uninformative) or when |C| = n, n odd and q even (partially informative on y-Bloch component).
-
Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
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.