Pith. sign in

REVIEW 1 major objections 21 references

A QSS scheme yields a quantum encrypted-cloning structure when qualified sets share a non-qualified common intersection that acts as the redeemable key.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Quantum encrypted cloning schemes can be derived from any quantum secret sharing access structure containing a family of qualified sets with a non-qualified common intersection, interpreted as key plus encrypted clones.

T0 review reviewed 2026-06-28 challenge →

load-bearing objection The paper gives a useful converse framing for quantum encrypted cloning via QSS access structures, though the central criterion needs an extra condition to fully support the encrypted-clone interpretation. the 1 major comments →

arxiv 2606.06552 v1 pith:2SXDS353 submitted 2026-06-04 quant-ph cs.CR

Beyond the Canonical Protocol: Quantum Encrypted Cloning from Secret-Sharing Access Structures

Gabriele Gianini , Stelvio Cimato , Jianyi Lin , Omar Hasan , Corrado Mio , Ernesto Damiani This is my paper
classification quant-ph cs.CR
keywords quantum secret sharingaccess structuresencrypted cloningno-cloning theoremramp schemesisometric quantum codeerasure recoveryquantum redundancy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The reading

The paper shows that quantum encrypted cloning schemes can be systematically extracted from quantum secret sharing access structures rather than being limited to a single protocol. A family of qualified sets with a non-qualified common intersection defines the structure, with the common subsystem serving as the key and the remaining parts functioning as encrypted clones. This extraction uses only the standard recoverability definitions of QSS and changes only the operational interpretation to support delayed or alternative redemption. Both perfect QSS and ramp QSS produce valid schemes, the former with forbidden non-qualified subsystems and the latter with partially informative ones. The constructions appear equivalently as overlapping erasure-recovery regions of an isometric quantum code, turning secret sharing into a design language for encrypted quantum redundancy.

Core claim

A QSS scheme supports a quantum encrypted-cloning structure whenever it contains a family of qualified sets with a non-qualified common intersection. The common subsystem is interpreted as the key, while the non-common parts are interpreted as encrypted clones relative to that key. Thus quantum encrypted cloning does not require a new notion of recoverability beyond QSS; what changes is the operational reading of QSS constituents as a mechanism for delayed and alternative redemption opportunities. This viewpoint separates redemption from perfect secrecy. Perfect QSS yields encrypted-cloning schemes with forbidden non-qualified subsystems, whereas ramp QSS naturally allows intermediate, parti

What carries the argument

The access-structural criterion of a family of qualified sets sharing a non-qualified common intersection, which separates the common key subsystem from the differing encrypted-clone subsystems.

Load-bearing premise

The operational reading of the common intersection as a redeemable key and the differing parts as encrypted clones preserves the no-cloning theorem using only standard QSS recoverability.

What would settle it

A concrete calculation for any illustrated threshold or ramp QSS scheme showing that combining the common subsystem with one non-common part fails to recover the original state, or that any single non-common part alone recovers the state.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • Threshold-like, ramp, hierarchical, and compartmented QSS architectures produce encrypted clones that may be symmetric or asymmetric, individual or composite, perfectly hidden or leaky.
  • Perfect QSS produces encrypted-cloning schemes with forbidden non-qualified subsystems.
  • Ramp QSS naturally allows intermediate, partially informative non-redeeming subsystems.
  • The constructions correspond to overlapping erasure-recovery regions of an isometric quantum code.
  • Encrypted cloning is established as a general access-structure primitive.

Where Pith is reading between the lines

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

  • Designers could choose particular access structures to tailor clone symmetry or leakage to the topology of a given quantum network.
  • The same language might unify encrypted cloning with other tasks such as quantum error correction that also rely on erasure recovery regions.
  • One could check whether ramp-based constructions achieve higher rates or lower resource overhead than canonical protocols for the same number of clones.
  • Multiple overlapping families within one QSS scheme might support simultaneous distinct keys for different clone groups.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

1 major / 0 minor

Summary. The paper claims that quantum encrypted cloning can be systematically derived from quantum secret sharing (QSS) access structures: any QSS scheme containing a family of qualified sets with a non-qualified common intersection yields an encrypted-cloning scheme by interpreting the intersection as the key and the differing parts as encrypted clones. This requires no new recoverability notion beyond standard QSS; the framework applies to threshold, ramp, hierarchical, and compartmented architectures, producing symmetric/asymmetric or perfect/leaky clones, and is equivalently viewed as overlapping erasure-recovery regions of an isometric quantum code.

Significance. If the central mapping is made rigorous, the work supplies a general access-structure design language for quantum encrypted cloning, broadening it beyond canonical protocols and separating redemption opportunities from perfect secrecy. It correctly notes that perfect QSS yields forbidden non-qualified subsystems while ramp QSS permits partially informative ones, and it avoids inventing new entities by reusing standard QSS definitions.

major comments (1)
  1. [Abstract] Abstract (criterion paragraph): the stated sufficiency condition (family of qualified sets with non-qualified common intersection) does not ensure that each non-common part Qi ∖ I is non-qualified. In a monotone access structure this permits counterexamples where Qi ∖ I alone is qualified and can reconstruct the secret without the key, so the part is not 'encrypted'. The operational reading as encrypted clones therefore requires an additional (unstated) property that each differing part is non-qualified; without it the derivation from access structure to encrypted-cloning structure contains a gap.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for identifying a subtle but important gap in the stated sufficiency condition. The observation is correct, and we will revise the manuscript to close it.

read point-by-point responses

  1. Referee: [Abstract] Abstract (criterion paragraph): the stated sufficiency condition (family of qualified sets with non-qualified common intersection) does not ensure that each non-common part Qi ∖ I is non-qualified. In a monotone access structure this permits counterexamples where Qi ∖ I alone is qualified and can reconstruct the secret without the key, so the part is not 'encrypted'. The operational reading as encrypted clones therefore requires an additional (unstated) property that each differing part is non-qualified; without it the derivation from access structure to encrypted-cloning structure contains a gap.

    Authors: We agree that the criterion as written in the abstract (and the corresponding statement in the main text) is incomplete. In a monotone access structure, the fact that I is non-qualified does not automatically imply that each Qi ∖ I is non-qualified; a counterexample can be constructed in which Qi ∖ I alone is qualified, allowing reconstruction of the secret without the key and thereby violating the encryption interpretation. To remedy this, the sufficiency condition must be strengthened by the explicit additional requirement that each differing part Qi ∖ I is itself non-qualified. We will revise the abstract and the formal statement of the extraction principle (currently in the introduction and Section II) to include this property. With the strengthened criterion the mapping from access structure to encrypted-cloning scheme becomes rigorous, and all subsequent examples and equivalences remain valid. revision: yes

Circularity Check

0 steps flagged

No significant circularity; interpretive mapping from QSS access structures is definitional and self-contained

full rationale

The paper defines a QSS scheme as supporting an encrypted-cloning structure precisely when it contains a family of qualified sets with non-qualified common intersection, then interprets the common part as key and differing parts as clones. This is an explicit operational reinterpretation of standard QSS constituents rather than a mathematical derivation, equation, or prediction that reduces to its inputs by construction. No self-citations are invoked as load-bearing uniqueness theorems, no parameters are fitted then renamed as predictions, and no ansatz or renaming of known results is smuggled in. The central claim is therefore a correspondence definition, not an equality forced by prior steps within the paper.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on standard quantum mechanics and the no-cloning theorem; no new free parameters, ad-hoc axioms, or invented entities are introduced beyond reinterpretation of existing QSS constituents.

axioms (2)
  • standard math Standard quantum mechanics and the no-cloning theorem hold.
    Invoked implicitly when stating that encrypted clones do not contradict no-cloning.
  • domain assumption Quantum secret sharing access structures are well-defined and their qualified sets satisfy the usual reconstruction properties.
    Used as the starting point for the extraction criterion.

reviewed 2026-06-28 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Beyond the Canonical Protocol: Quantum Encrypted Cloning from Secret-Sharing Access Structures." pith.science (2026). https://pith.science/paper/2SXDS353

@misc{pith2026260606552,
  author       = {Pith},
  title        = {Pith review of: Beyond the Canonical Protocol: Quantum Encrypted Cloning from Secret-Sharing Access Structures},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2SXDS353}},
  note         = {Machine review of arXiv:2606.06552}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum encrypted cloning shows that an unknown quantum state can be distributed into multiple encrypted copies without contradicting the no-cloning theorem: each copy is unusable on its own, but can be redeemed together with a suitable quantum key. Recent work has related canonical encrypted-cloning protocols to particular forms of quantum secret sharing. Here we take the converse perspective: instead of mapping a given encrypted-cloning protocol into QSS, we use QSS access structures as a design library from which encrypted-cloning schemes can be extracted. The criterion is access-structural. A QSS scheme supports a quantum encrypted-cloning structure whenever it contains a family of qualified sets with a non-qualified common intersection. The common subsystem is interpreted as the key, while the non-common parts are interpreted as encrypted clones relative to that key. Thus quantum encrypted cloning does not require a new notion of recoverability beyond QSS; what changes is the operational reading of QSS constituents as a mechanism for delayed and alternative redemption opportunities. This viewpoint separates redemption from perfect secrecy. Perfect QSS yields encrypted-cloning schemes with forbidden non-qualified subsystems, whereas ramp QSS naturally allows intermediate, partially informative non-redeeming subsystems. The resulting framework broadens quantum encrypted cloning from a specific protocol to a general access-structure primitive. We illustrate the extraction principle with threshold-like, ramp, hierarchical, and compartmented architectures, showing how encrypted clones may be symmetric or asymmetric, individual or composite, perfectly hidden or leaky. Equivalently, these constructions can be viewed as overlapping erasure-recovery regions of an isometric quantum code. This establishes secret sharing as a systematic design language for encrypted quantum redundancy.

discussion (0)

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

Reference graph

Works this paper leans on

21 extracted references · 5 canonical work pages · 5 internal anchors

  1. [1]

    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

    2026

  2. [2]

    Cloning Encrypted Quantum States in Arbitrary Dimensions

    Filip-Ioan Ceara. Cloning encrypted quantum states in arbitrary dimensions.arXiv preprint arXiv:2604.04888, 2026

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  3. [3]

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

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

    1999

  4. [4]

    How to share a quantum secret.Physical Review Letters, 83(3):648–651, 1999

    Richard Cleve, Daniel Gottesman, and Hoi-Kwong Lo. How to share a quantum secret.Physical Review Letters, 83(3):648–651, 1999. 1Specifically, they show thatd-dimensional Bell state under partial encryption, where only a single register is encrypted, there exist an encrypted cloning protocol with n= 2 signal-noise qudit pairs (up to a local unitary) that e...

    1999

  5. [5]

    Theory of quantum secret sharing.Physical Review A, 61(4):042311, 2000

    Daniel Gottesman. Theory of quantum secret sharing.Physical Review A, 61(4):042311, 2000

    2000

  6. [6]

    Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing

    Zheng Liang Lim and Hoi-Kwong Lo. Encrypted cloning, absolute maximal entanglement and quantum secret sharing.arXiv preprint arXiv:2605.26866, 2026

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  7. [7]

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

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

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  8. [8]

    Full characterization of informative subsets in Quantum Encrypted Cloning

    Gabriele Gianini, Stelvio Cimato, Jianyi Lin, Omar Hasan, and Ernesto Damiani. Full characterization of informative subsets in quantum encrypted cloning.arXiv preprint arXiv:2605.27421, 2026

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  9. [9]

    Quantum secret sharing schemes and reversibility of quantum operations.Physical Review A, 72(3):032318, 2005

    Tomohiro Ogawa, Akira Sasaki, Mitsugu Iwamoto, and Hirosuke Yamamoto. Quantum secret sharing schemes and reversibility of quantum operations.Physical Review A, 72(3):032318, 2005

    2005

  10. [10]

    Quantum strongly secure ramp secret sharing.Quantum Information Processing, 14:715–729, 2015

    Paul Zhang and Ryutaroh Matsumoto. Quantum strongly secure ramp secret sharing.Quantum Information Processing, 14:715–729, 2015

    2015

  11. [11]

    Coding theoretic construction of quantum ramp secret sharing, 2014

    Ryutaroh Matsumoto. Coding theoretic construction of quantum ramp secret sharing, 2014

    2014

  12. [12]

    Theory of quantum error-correcting codes.Physical Review A, 55(2):900– 911, 1997

    Emanuel Knill and Raymond Laflamme. Theory of quantum error-correcting codes.Physical Review A, 55(2):900– 911, 1997

    1997

  13. [13]

    Nielsen and Isaac L

    Michael A. Nielsen and Isaac L. Chuang.Quantum Computation and Quantum Information. Cambridge University Press, 10th anniversary edition edition, 2010

    2010

  14. [14]

    Classification of informative subsets in quantum encrypted cloning on qudits

    Chen-Ming Bai, Xin-Liang Zhou, and Yu Luo. Classification of informative subsets in quantum encrypted cloning on qudits.arXiv preprint arXiv:2605.11642, 2026

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  15. [15]

    Ran Hee Choi, Daniel Miller, and Barry C. Sanders. Entanglement sharing protocol via quantum error-correcting codes.Physical Review A, 87(3):032319, 2013

    2013

  16. [16]

    Unitary reconstruction of secret for stabilizer-based quantum secret sharing.Quantum Information Processing, 16:202, 2017

    Ryutaroh Matsumoto. Unitary reconstruction of secret for stabilizer-based quantum secret sharing.Quantum Information Processing, 16:202, 2017

    2017

  17. [17]

    Classical access structures of ramp secret sharing based on quantum stabilizer codes

    Ryutaroh Matsumoto. Classical access structures of ramp secret sharing based on quantum stabilizer codes. Quantum Information Processing, 19:9, 2020

    2020

  18. [18]

    Hierarchical threshold secret sharing.Journal of Cryptology, 20(2):237–264, 2007

    Tamir Tassa. Hierarchical threshold secret sharing.Journal of Cryptology, 20(2):237–264, 2007

    2007

  19. [19]

    Dynamic hierarchical quantum secret sharing based on the multiscale entanglement renormalization ansatz.Physical Review A, 106(5):052403, 2022

    Hong Lai, Josef Pieprzyk, and Lei Pan. Dynamic hierarchical quantum secret sharing based on the multiscale entanglement renormalization ansatz.Physical Review A, 106(5):052403, 2022

    2022

  20. [20]

    Brickell

    Ernest F. Brickell. Some ideal secret sharing schemes.Journal of Combinatorial Mathematics and Combinatorial Computing, 6:105–113, 1989

    1989

  21. [21]

    Ideal uniform multipartite secret sharing schemes.Information Sciences, 657:119958, 2024

    Qi Chen, Wen-Ai Liu, Liang Zhang, and Yue Wang. Ideal uniform multipartite secret sharing schemes.Information Sciences, 657:119958, 2024

    2024

This paper was first reviewed by grok-4.3 on June 28, 2026.