REVIEW 3 minor 1 cited by
Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing
T0 review · 0 major / 3 minor · reviewed 2026-06-29 · grok-4.3
Pith's one-line read An encrypted qudit system of two signal-noise pairs equals a five-party absolutely maximally entangled state in any dimension when the input is uniform.
desk verdict This paper gives a Weyl-Heisenberg construction that generalizes encrypted cloning to arbitrary dimensions, proves equivalence to a five-party AME state for uniform inputs, and makes the QSS link formal. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The encrypted state of two signal-noise qudit pairs, shown equivalent to a five-party absolutely maximally entangled state through Weyl-Heisenberg displacement operators.
What would settle it
A direct calculation, for any dimension d greater than 2 and a uniform input, of one party's reduced density matrix in the five-party state; if that matrix is not the maximally mixed state, the claimed equivalence fails.
Extended reading notes
Core claim
The authors prove that an encrypted qudit system comprising two signal-noise qudit pairs is equivalent to a five-party AME state in any dimension, provided the input state is uniform. They frame encrypted clones as AME states, compute the encrypted state analytically with Weyl-Heisenberg operators, and establish that a threshold QSS scheme realizes the fundamental objectives of encrypted cloning.
Load-bearing premise
The input state must be uniform across the dimension for the equivalence and the encrypted-state computation to hold.
Editorial extensions
If this is right
- Encrypted cloning extends from qubits to qudits of arbitrary dimension.
- A threshold quantum secret sharing scheme achieves the core objectives of encrypted cloning.
- The five-party AME equivalence supplies an analytic expression for the encrypted state under the uniform-input condition.
- The construction recovers the original qubit case and supplies an independent route to higher dimensions via displacement operators.
Reading between the lines
- AME-state constructions already known in the literature could be reused to generate new encrypted-cloning protocols without starting from scratch.
- Practical implementations would need to enforce or verify the uniform-input condition before claiming the AME property.
- The unification suggests that security proofs developed for quantum secret sharing might transfer directly to encrypted cloning.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript generalizes encrypted cloning from qubits to qudits of arbitrary dimension via Weyl-Heisenberg displacement operators. It analytically computes the encrypted state for a system consisting of two signal-noise qudit pairs and proves that this state is equivalent to a five-party absolutely maximally entangled (AME) state whenever the input is uniform. It further proves that any threshold quantum secret sharing (QSS) scheme realizes the fundamental objectives of encrypted cloning, thereby positioning QSS as the natural encompassing framework.
Significance. If the claimed analytical computations and equivalence proofs hold, the work supplies an explicit, dimension-independent bridge between encrypted cloning, AME states, and threshold QSS. The reliance on standard Weyl-Heisenberg operators and the uniform-input condition are clearly stated, which would make the result reproducible and falsifiable. This extends the original Yamaguchi-Kempf qubit construction and complements the parallel Zadoff-Chu approach, potentially informing higher-dimensional quantum information protocols.
minor comments (3)
- The abstract states that the equivalence holds 'provided the input state is uniform,' yet the manuscript should explicitly define the uniformity condition (e.g., maximally mixed or equal superposition) in the main text before the proof, preferably with a short equation or density-matrix expression.
- The connection to QSS is described as a formal proof that threshold schemes achieve the encrypted-cloning objectives; a brief statement of the precise threshold parameters (k,n) used in the reduction would improve clarity.
- The parallel construction with Ceará's Zadoff-Chu work is mentioned; a short comparative paragraph or table highlighting differences in operator choice or state construction would help readers situate the two approaches.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our work, the recognition of its potential to bridge encrypted cloning, AME states, and threshold QSS, and the recommendation for minor revision. No specific major comments were provided in the report.
Circularity Check
No significant circularity; derivation is self-contained
full rationale
The paper analytically computes the encrypted state using standard Weyl-Heisenberg displacement operators and proves equivalence to a five-party AME state under the explicitly stated condition that the input state is uniform. The QSS connection is established by a separate proof that threshold schemes achieve the encrypted cloning objectives. No load-bearing step reduces by definition, by fitting, or by self-citation chain to its own inputs; prior qubit work is cited only for context while the qudit case is derived independently. The uniformity condition is not smuggled but required and declared upfront.
Assumptions & free parameters
assumptions (1)
- standard math Standard postulates of quantum mechanics and linear algebra over finite-dimensional Hilbert spaces
Cite this review
Pith. "Pith review of Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing." pith.science (2026). https://pith.science/paper/Z62UHV7W
@misc{pith2026260526866,
author = {Pith},
title = {Pith review of: Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing},
year = {2026},
howpublished = {\url{https://pith.science/paper/Z62UHV7W}},
note = {Machine review of arXiv:2605.26866}
}
read the original abstract
The no-cloning theorem prohibits the creation of identical copies of quantum information, imposing fundamental constraints on quantum technologies. A recently proposed protocol, encrypted cloning, introduced by Yamaguchi and Kempf, showed that perfect qubit clones can be produced if they are simultaneously encrypted with a single-use key. They also observed a connection between this scheme and quantum secret sharing (QSS). However, it remained an open question whether encrypted cloning could be generalised to arbitrary dimensions, and the broader relationship between the two schemes had not been formally established. In this work, we address both questions by framing encrypted clones as Absolutely Maximally Entangled (AME) states. In parallel with recent work by Cear\'a that utilises Zadoff-Chu sequences, we independently develop a complementary framework for arbitrary dimensions based on Weyl-Heisenberg displacement operators, both tracing back to the original qubit construction by Yamaguchi and Kempf. We analytically compute the encrypted state and prove that an encrypted qudit system comprising two signal-noise qudit pairs is equivalent to a five-party AME state in any dimension, provided the input state is uniform. We then formalise the connection to QSS by proving that a threshold QSS scheme can achieve the fundamental objectives of encrypted cloning, establishing QSS as the natural general framework within which encrypted cloning can be contextualised.
Figures
Forward citations
Cited by 1 Pith paper
-
Beyond the Canonical Protocol: Quantum Encrypted Cloning from Secret-Sharing Access Structures
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.
Reference graph
Works this paper leans on
-
[1]
jl−1, jl+1,
free indicesj 1, . . . jl−1, jl+1, . . . , jn (which we will now callj i{i̸=l}) contributes a factor ofd n−1. After working out the terms withi̸=land not- ing that the only remaining free index alongside are k, k′, jl andj ′ l, the density matrix becomes ρSl = 1 d X k,k′,jl,j′ l ψkψ∗ k′ ·δ jl,j′ l |k⟩⟨k′| Therefore, we recover: ρSl = X k,k′ ψkψ∗ k′ |k⟩ ⟨k...
-
[2]
·(dδ b,b′) The Kronecker deltaδ b,b′ forcesb=b ′, leading to two critical simplifications:
-
[3]
The quadratic phase becomesτ b2−b2 =τ 0 = 1
-
[4]
The signal indexkin theωterms cancels: ωbk−bk = 1. The expression simplifies to: S=d 2X b=0 ωb(j′ 1−j1) Applying the orthogonality identity again to the remaining sum overb: 2X b=0 ωb(j′ 1−j1) =dδ j1,j′ 1 Thus, the total internal sum collapses to: S=d·dδ j1,j′ 1 =d 2δj1,j′ 1 SubstitutingSback into the marginal density ma- trixρ S1N1 and sinceP k |ψk|2 = 1...
-
[5]
=d δ k−k′,j1−j′ 1 Unlike the AME(5, d) case where we do not have such marginals withAand same pairings, this is a single constraint on a four variable system (k, j1, k′, j′ 1). It only requires the sum of the indices to match, which allows for off-diagonal terms where k̸=k ′,j ′ 1 ̸=j ′ 1 butk−j 1 =k ′ −j ′ 1 which hinders it from becoming a maximally mix...
-
[6]
Encrypted Qubits Can Be Cloned,
K. Yamaguchi, A. Kempf,“Encrypted Qubits Can Be Cloned,”Phys. Rev. Lett., 136, 010801, 2026
2026
-
[7]
A single quantum cannot be cloned,
K. Wootters and W. H. Zurek,“A single quantum cannot be cloned,”Nature, 299, 802–803, 1982
1982
-
[8]
Communication by EPR devices,
D. Dieks,“Communication by EPR devices,”Phys. Lett. A 92 (6), 271–272, 1982
1982
Show all 28 references
-
[9]
Cloning encrypted quantum states in arbitrary dimensions,
F.I. Cear´ a,“Cloning encrypted quantum states in arbitrary dimensions,”arXiv:2604.04888v1, 2026
2026 arXiv
-
[10]
How to Share a Quantum Secret,
R. Cleve, D. Gottesman and H.-K. Lo,“How to Share a Quantum Secret,”Phys. Rev. Lett. 83, 648, 1999
1999
-
[11]
Theory of quantum secret sharing,
D. Gottesman,“Theory of quantum secret sharing,” Phys. Rev. A, 61, 042311, 2000
2000
-
[12]
Quantum Secret Sharing,
M. Hillery, V. Buzek and A. Berthiaume,“Quantum Secret Sharing,”Phys. Rev. A 59, p.1829, 1999
1999
-
[13]
Uni- versal blind quantum computation,
A. Broadbent, J. Fitzsimons, and E. Kashefi,“Uni- versal blind quantum computation,”, IEEE Sympo- sium on Foundations of Computer Science, 517–526, 2009
2009
-
[14]
Quan- tum Homomorphic Encryption for Polynomial-Size Circuits,
Y. Dulek, C. Schaffner, and F. Speelman,“Quan- tum Homomorphic Encryption for Polynomial-Size Circuits,”, ToC, vol. 14, no. 7, pp 1-45., 2016
2016
-
[15]
The Theory of Groups and Quantum Me- chanics,
H. Weyl,“The Theory of Groups and Quantum Me- chanics,”Dover (New York), 1931
1931
-
[16]
Optimal state-determination by mutually unbiased measure- ments,
W. K. Wootters and B. D. Fields,“Optimal state-determination by mutually unbiased measure- ments,”Ann. Phys. 191, 363-381 (1989)
1989
-
[17]
A new proof for the existence of mutually unbiased bases,
S. Bandyopadhyay, P. O. Boykin, V. Roychowdhury, and F. Vatan,“A new proof for the existence of mutually unbiased bases,”Algorithmica 34, 512-528, 2002
2002
-
[18]
Maximally multipartite entangled states,
P. Facchi, G. Florio, G. Parisi and S. Pascazio, “Maximally multipartite entangled states,”Phys. Rev. A, 77(6), 060304, 2008
2008
-
[19]
How entangled can two couples get?
A. Higuchi.and A. Sudbery,“How entangled can two couples get?”Phys. Lett. A, 273(4), 213–217, 2000
2000
-
[20]
Multipartite entanglement, quantum- error-correcting codes, and entangling power of quantum evolutions,
A. J. Scott,“Multipartite entanglement, quantum- error-correcting codes, and entangling power of quantum evolutions,”Phys. Rev. A, 69, 052330, 2004
2004
-
[21]
Absolutely Maximally Entangled States of Seven Qubits Do Not Exist,
F. Huber, O G¨ uhne, and J. Siewert,“Absolutely Maximally Entangled States of Seven Qubits Do Not Exist,”Phys. Rev. Lett., 118, 200502, 2017
2017
-
[22]
Absolute maximal entanglement and quan- tum secret sharing,
W. Helwig, W. Cui, J. I. Latorre, A. Riera, and H.- K. Lo,“Absolute maximal entanglement and quan- tum secret sharing,”Phys. Rev. A, 86,052335, 2012
2012
-
[23]
Multipartite entanglement, quantum- error-correcting codes, and entangling power of quantum evolutions,
A. J. Scott,“Multipartite entanglement, quantum- error-correcting codes, and entangling power of quantum evolutions,”Phys. Rev. A 69, 052330, 2004
2004
-
[24]
Error-correcting codes and absolutely maximally entangled states for mixed- dimensional Hilbert spaces,
S. Ball, R. Zhang,“Error-correcting codes and absolutely maximally entangled states for mixed- dimensional Hilbert spaces,”Phys. Rev. A 113, 012432, 2026
2026
-
[25]
Quantum error-correction codes and absolutely maximally entangled states,
P. Mazurek, M. Farkas, A. Grudka, M. Horodecki and M. Studzi´ nski,“Quantum error-correction codes and absolutely maximally entangled states,” Phys. Rev. A 101, 042305, 2020
2020
-
[26]
Experimental demonstration that qubits can be cloned at will, if encrypted with a single-use decryption key,
K. Yamaguchi, et. al,“Experimental demonstration that qubits can be cloned at will, if encrypted with a single-use decryption key,”arXiv:2602.10695, 2026
2026
-
[27]
The number of signal and noise qudit pairsnhas to be more than 1, as whenn= 1, the encrypted clone cannot be decrypted, as shown in the supplementary materials of [1]
-
[28]
It was shown in [17] that a 5-qubit code can be used to construct an AME(5,2) state, though the authors did not establish the converse
Reviewed June 29, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.