Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing
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: We're looking at the paper: "Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing".
Paper summary: Kai: So we're looking at this paper "Encrypted Cloning, Absolute Maximal Entanglement and Quantum Secret Sharing" and the main idea is that encrypted cloning isn't just for qubits anymore; they generalize it to any dimension.
Mira: Exactly. They frame these encrypted clones as absolutely maximally entangled states, or AME states, and connect that directly to quantum secret sharing through a threshold QSS scheme. It seems like they’re saying QSS is the natural way to look at encrypted cloning.
Lev: But what does that mean for the hardware side? If we're talking about arbitrary dimensions, how does that change the complexity for someone trying to build this on real superconducting platforms?
Kai: They developed a new framework using Weyl-Heisenberg displacement operators, which traces back to earlier qubit work by Yamaguchi and Kempf. They show that an encrypted qudit system with two signal and noise qudit pairs is mathematically equivalent to a five-party AME state in any dimension if the input state is uniform.
Mira: That’s a strong claim about the equivalence, but we need to be careful—it only holds for that specific condition where the input state is uniform. The paper then formalizes how a threshold QSS scheme can achieve exactly what encrypted cloning wants to do.
Lev: So if I'm building this, and I have a system of two signal and noise qudits, the paper suggests it maps onto this AME(five d) state for any dimension d greater than or equal to two <ref:2605.26866#pg1>. That’s a lot of entanglement for us to manage at once.
Kai: They also propose specific encryption and decryption unitary operators using these generalized Weyl-Heisenberg operators. The encryption operator is described by equation one three, which generalizes the qubit case you know from the beginning, and the decryption operator must involve that signal qudit plus all of those noise qudits.
Mira: That decryption operator is quite specific, designed so that after you run it, the state of your signal qudit becomes exactly what you started with, using only one of those encrypted clones if you have the right keys. It’s a bit complex looking but fundamentally it guarantees recovery under certain conditions.
Paper summary: Lev: I'm trying to figure out the overhead here. If we need to implement this decryption operator on real hardware, how does that scale? Does it push us into some kind of high-dimensional tensor product complexity that makes error correction really tough?
Kai: The paper shows that for any dimension d greater than or equal to two, the encrypted state becomes an AME(five d) state when you have two signal and noise qudits <ref:2605.26866#pg1>. They also note something interesting: if you have more than two signal and noise pairs, say n greater than two, it doesn't result in an AME(2n plus one, d) state <ref:2605.26866#pg1>.
Mira: That distinction is important because it sets a limit on the structure of this entanglement relationship. It shows that the equivalence to that specific AME state is quite constrained by having only two signal and noise pairs.
Lev: And then there’s this correspondence to threshold QSS for a d-dimensional Bell state under partial encryption. They show a one to one mapping between a two signal and noise qudit protocol and a pure-state three party QSS scheme for any dimension d greater than or equal to two.
Kai: That mapping is established by showing that every three party marginal that includes the first signal qudit is maximally mixed, which mathematically implies the state has to be an AME(six d) state. That’s a pretty tight constraint on the entanglement structure.
Mira: So what this means practically for QSS is that we can use existing QSS frameworks to implement encrypted cloning in many dimensions. It makes the conceptual leap from pure cloning to sharing information over a threshold structure much clearer.
Lev: If I look at the recovery protocol, it says you can still get the original input state even if some of those noise qudits are lost, as long as you're willing to sacrifice some of the signal qudits instead. You replace that missing noise qudit with the second signal qudit.
Paper summary: Kai: That means we don't need perfect fidelity across all components for recovery; we just need enough signal and some key information from the noise. But this recovery works with a slightly different decryption operator than before, which is something they detail in equation three.
Mira: It seems like the paper’s focus isn't just on achieving cloning, but on showing how this specific type of entanglement—the AME states—provides a robust foundation for quantum information sharing protocols like QSS.
Lev: I wonder about the limitations they mention. They point out that for two qubits with an even number of signal and noise pairs n, the postencoding register effectively behaves in a certain way, which suggests some specific constraints on what can be reconstructed without those extra parameters.
Kai: So for future work, they suggest looking at using this encrypted cloning as an error correction code and exploring the link between stabilizer codes and these encrypted states. They also see a path toward blind quantum computing where Weyl-masked qudits are transmitted to a remote server.
Mira: That connection to blind quantum computing is interesting because it suggests that this entanglement structure might be useful for transmitting information without needing direct control over every single component in the channel. But simulating this high-dimensional encryption on current superconducting platforms will be a big hurdle.
Lev: I agree, the scaling of these operators and the required precision for those AME states sounds like it’s going to demand some serious engineering effort to get a working demonstration outside of small toy systems.
Kai: So, we've seen how they generalize encrypted cloning using AME states and tied it up with threshold QSS, showing the math works for any dimension if the input state is uniform.
Mira: And the core implication seems to be that QSS provides a natural general framework for understanding and implementing these types of encrypted protocols, even though there are specific constraints on how many signal and noise pairs you can have.
Lev: Ultimately, it shows that even with the no-cloning theorem, we can still have very structured ways to share or recover quantum information by leveraging this maximal entanglement.
Conclusion: Kai: So, we've been looking at how they take encrypted cloning and link it to these absolutely maximally entangled states, or AME states, and Quantum Secret Sharing schemes through a threshold setup.
Mira: Yeah, essentially they are showing that QSS isn't just some abstract concept anymore; it becomes the natural framework for understanding how this kind of encrypted cloning works across different dimensions.
Lev: I mean if you look at the math they developed, framing these clones as AME states means you’re dealing with a very high level of entanglement, specifically five parties in any dimension greater than two when you have two signal and noise qudit pairs.
Kai: That’s right, and what this means for us is that even though we can't clone an unknown state perfectly, this structure tells us exactly how much information we can securely share or recover under certain conditions.
Mira: The authors are pushing the idea that you can use a threshold QSS scheme to achieve those fundamental objectives of encrypted cloning, which is pretty neat because it connects two very different areas of quantum information theory.
Lev: It does connect them, but the caveat they put on it is crucial: this equivalence only holds if the input state you’re trying to clone is uniform across all possibilities.
Kai: That uniformity condition is a big deal for hardware implementation because real-world inputs are almost never perfectly uniform, so that means we have to be very careful about what we actually test.
Mira: Exactly, and they do give us some specific recovery protocols too, showing you can still get the original input state even if some of the noise qudits get lost by sacrificing some of your signal qudits.
Lev: That recovery protocol changes the game a little bit because it means you don't need perfect fidelity across every single component for reconstruction, which is something engineers always worry about when building these systems.
Kai: So to wrap up, the paper is really laying out a solid mathematical bridge between complex entanglement structures and practical quantum information sharing protocols like QSS.
Mira: It suggests that if you want to build secure information transfer schemes in high dimensions, looking at these AME states through the lens of threshold secret sharing is a very powerful way to think about it.
Lev: And the next thing we need to figure out is how much overhead those specific encryption and decryption operators actually put on a real superconducting platform.
Zheng Liang Lim, Hoi-Kwong Lo
Centre for Quantum Technologies, National University of Singapore · Department of Physics, National University of Singapore · Quantum Bridge Technologies Inc. · Department of Electrical and Computer Engineering, University of Toronto
quant-ph
Submitted: 2026-05-26
Updated: 2026-11-16
Comments: Total of 22 pages and 1 figure, corrected some typos in v1 and improved on the proof of theorem 2 and 3. In v3, we added some more references and corrected some typos
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 85/100
The gist: Encrypted cloning can be generalized to arbitrary dimensions by framing encrypted clones as Absolutely Maximally Entangled (AME) states and formalizing their connection to Quantum Secret Sharing…
Key concepts
- Absolutely Maximally Entangled (AME) states
- These are highly entangled quantum states that represent the maximum possible entanglement achievable for a given number of parties and dimensions. The paper uses these states to characterize encrypted clones in arbitrary dimensions, showing that the cloned system corresponds to a specific AME state structure.
- Quantum Secret Sharing (QSS)
- QSS is a scheme where secret information is distributed among multiple parties so that only a certain threshold of them can reconstruct it. The research formalizes how encrypted cloning can be achieved using threshold QSS, making QSS the overarching framework for understanding the cloning process.
- Weyl-Heisenberg displacement operators
- These are mathematical operators used to construct encryption and decryption unitaries in arbitrary dimensions. They generalize the original qubit construction method, allowing researchers to develop specific unitary operations necessary for encrypting and recovering quantum information in higher-dimensional systems.
- Threshold QSS scheme
- This is a specific type of Quantum Secret Sharing where a certain minimum number of participants are required to successfully reconstruct the secret. The paper demonstrates that this threshold QSS structure is mathematically identical to the encrypted cloning protocol for Bell states in any dimension.
Terminology
Summary
Encrypted cloning can be generalized to arbitrary dimensions by framing encrypted clones as Absolutely Maximally Entangled (AME) states and formalizing their connection to Quantum Secret Sharing (QSS) through a threshold QSS scheme. p. 0
Generalization of Encrypted Cloning
The paper addresses the open questions regarding whether encrypted cloning can be generalized to arbitrary dimensions and the broader relationship between encrypted cloning and QSS by framing encrypted clones as Absolutely Maximally Entangled (AME) states. They independently developed a complementary framework for arbitrary dimensions based on Weyl-Heisenberg displacement operators, tracing back to the original qubit construction by Yamaguchi and Kempf. p. 0 They 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. p. 0
Formal Connection to QSS
The paper formalizes the connection between encrypted cloning and 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 contextualized. They establish that an encrypted system of two signal and noise qudit pairs is mathematically identical to a five-party absolutely maximally entangled (AME) state provided that the input state to be cloned is uniform. p. 1
Operator Construction for Qudits
The paper proposes encryption and decryption unitary operators for encrypted cloning in arbitrary dimension using the generalized Weyl-Heisenberg operators. The encryption unitary is given by equation (13), which generalizes the qubit case, and the decryption operator is designed such that it must involve the signal qudit Sl and all noise qudits N1, ··· Nn. p. 4
Relationship to AME States
The paper demonstrates that for arbitrary dimension d ≥ 2, the encrypted state is an AME(5, d) state for n = 2 provided the input state to be cloned is uniform. For n > 2, the process does not result in an AME(2n + 1, d) state. p. 9
Correspondence to Threshold QSS
For a d-dimensional Bell state under partial encryption, there exists a one to one correspondence between the n = 2 encrypted cloning protocol and a pure-state ((3, 5)) threshold QSS scheme for arbitrary d ≥ 2. This correspondence is established by showing that every three-party marginal containing A1 is maximally mixed, which implies the state is an AME(6, d) state. p. 8
Recovery Protocol
The paper shows that even if some of the noise qudits are lost, one can still recover the original input state by sacrificing some of the signal qudits, albeit with a slightly different decryption unitary operator. This is achieved by replacing the missing noise qudit with the signal qudit S2. p. 5
Future Directions
Future work will explore the usage of encrypted cloning as an error correction code and examine the relationship between stabilizer codes and encrypted states. Encrypted Cloning of qudits also provides a natural route towards blind quantum computing (BQC) where Weyl-masked qudits act as encrypted inputs transmitted to a remote server. p. 9 The paper concludes by noting that simulating these high-dimensional encrypted cloning on advanced superconducting platforms will be essential. p. 9
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
-
Improved AI systems can perform blind quantum computing by using Weyl-masked qudits as encrypted inputs transmitted to a remote server for direct computation on masked data.
-
The system can implement error correction by utilizing the encrypted state for n = 2 to correct errors from the computation, as suggested in the future work section.
-
The AI can utilize the correspondence between an AME(6, d) state and a ((3, 5)) threshold Quantum Secret Sharing scheme to distribute quantum information such that it is
hidden from local parties but remains globally accessible.
Sources
- Cloning Encrypted Quantum States in Arbitrary Dimensions
- Experimental demonstration that qubits can be cloned at will, if encrypted with a single-use decryption key
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- 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