⚛️ quantum physics

Cloning Encrypted Quantum States in Arbitrary Dimensions

This paper generalizes the recent discovery that encrypted qubits can be cloned to arbitrary-dimensional quantum systems by introducing a new unitary operator for encryption and adapting the decryption protocol, demonstrating that the resulting circuit overhead scales linearly with the qudit dimension.

Original authors: Filip-Ioan Ceară

Published 2026-04-07

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Filip-Ioan Ceară

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Idea: The "Magic Photocopier" for Secret Messages

Imagine you have a super-secure, unbreakable safe (a quantum state) containing a secret message. In the world of quantum physics, there is a famous rule called the "No-Cloning Theorem." It says you cannot make a perfect copy of a secret quantum message. If you try to copy it, you inevitably destroy the original or ruin the copy. It's like trying to photocopy a piece of paper that instantly turns into ash if you shine a light on it.

However, a few years ago, scientists Yamaguchi and Kempf discovered a loophole. They found a way to "clone" a quantum message if it was first scrambled (encrypted) in a very specific way. Think of it like this: You can't photocopy a secret letter, but if you first put that letter inside a locked, spinning, vibrating box that looks like random noise to anyone who touches it, you can make copies of the box. Later, with the right key, you can open one of the copies to reveal the original letter.

This paper solves a new problem: The original "magic box" only worked for simple 2-level systems (like a coin that is Heads or Tails, known as a qubit). The authors of this paper asked: "What if our secret message isn't just a coin, but a complex die with 3, 4, or even 100 sides (known as a qudit)?"

They successfully built a new version of the magic box that works for these complex, multi-sided dice.

The Problem: The "Broken Key"

In the original 2-level system (the coin), the scientists used a specific mathematical "key" (an operator) to scramble the message. This key was like a simple switch: flip it, and the message is scrambled.

But when they tried to use this same simple switch on a complex die (3 or more sides), it broke. In math terms, the key stopped being "unitary" (a fancy word meaning "reversible and energy-conserving"). It was like trying to use a flat key to open a 3D puzzle lock; it just didn't fit.

The Solution: The "Chaos Sequence"

To fix this, the authors invented a new kind of key using something called a CAZAC sequence (specifically, a Zadoff-Chu sequence).

The Analogy:
Imagine you are trying to hide a message in a room full of people.

The Old Way (2-level): You tell everyone to stand in a line and swap places in a simple pattern. Easy to reverse.
The Problem (Multi-level): If you have 100 people, that simple pattern gets messy and you lose track of who is who.
The New Way (This Paper): You give everyone a unique, complex rhythm to clap. It sounds like random noise to an outsider (perfect encryption), but because the rhythm follows a specific mathematical "beat" (the CAZAC sequence), you can perfectly reverse the pattern later to find the original person.

The authors proved that this new "rhythm" works for any size of the system, whether it's a coin, a die, or a complex 100-sided shape.

The Process: How the "Cloning" Works

The Setup: You have one "Data" die (the secret) and $n$ pairs of "Entangled" dice. Entangled dice are like magic twins; if you change one, the other changes instantly, no matter how far apart they are.
The Encryption (Scrambling): You apply the new "Chaos Sequence" key to the Data die and all the "Twin" dice.
- Result: If you look at any single "Twin" die now, it looks like pure static noise. It reveals zero information about the secret. It's like looking at a TV screen with only static; you can't tell what movie is playing.
The Distribution: You can now send these "Twin" dice to different people (or different locations).
The Decryption (Unscrambling): When you want to retrieve the secret, you pick one of the "Twin" dice and bring it back to the original "Data" location. You apply a special "Decryption Machine" (a complex circuit of gates) to the chosen Twin and the remaining "Twin" partners.
- Result: The secret message magically jumps from the original Data die into the chosen Twin die. The other "Twin" dice remain as static noise.

Why Does This Matter? (The "Why Bother?" Factor)

You might ask, "Why do we need dice with 100 sides instead of just coins?"

More Information: A coin holds 1 bit of info. A 100-sided die holds much more. This makes communication faster and more efficient.
Better Noise Resistance: In a noisy environment (like a storm), a coin flip is easily ruined. A complex die is more robust; it can withstand more interference before the message is lost.
Scalability: The authors showed that even though the dice are bigger and more complex, the "cost" to build the machine to scramble and unscramble them only goes up linearly.
- Analogy: If you double the size of the die, you don't need to build a factory twice as big; you just need a slightly bigger toolbox. The complexity doesn't explode; it grows in a manageable, straight line.

The Conclusion

This paper is a major step forward in quantum cryptography. It proves that the "loophole" allowing us to clone encrypted secrets isn't just a fluke that works for simple coins. It is a fundamental property of the universe that works for any size of quantum system.

By inventing a new mathematical "rhythm" (the CAZAC sequence) to handle the complexity, the authors have opened the door to building more secure, faster, and more robust quantum communication networks for the future. They turned a "coin trick" into a "universal magic trick."

1. Problem Statement

The paper addresses a specific open problem in quantum information theory regarding the cloning of encrypted quantum states.

Background: Recently, Yamaguchi and Kempf (2026) proved that encrypted qubits (2-level systems) can be cloned without violating the No-Cloning Theorem. Their protocol relies on applying a unitary encryption gate to a data qubit and $n$ pairs of entangled states, followed by a decryption gate that allows a specific party to retrieve the original state while others receive only maximally mixed states.
The Challenge: The authors attempt to generalize this protocol to qudits (quantum systems with dimension $d \geq 3$ ).
The Obstacle: A straightforward generalization of the encryption operator used in the qubit case—defined as the exponential of generalized Pauli operators ( $V(P) = e^{-i\theta P}$ )—fails for $d \geq 3$ . In higher dimensions, the generalized Pauli operators ( $X_d, Z_d$ ) are not Hermitian, causing the exponential map to produce non-unitary matrices, which are invalid as quantum gates.

2. Methodology

The authors propose a novel approach to construct valid unitary encryption and decryption operators for arbitrary dimensions $d$ .

A. Encryption Operator Construction

Instead of using the exponential map, the authors define the encryption operator $V(P)$ using a Constant-Amplitude Zero-Autocorrelation (CAZAC) sequence, specifically a Chu Sequence (a subset of Zadoff-Chu sequences).

Definition: The operator is defined as a linear combination of powers of the generalized Pauli operators $P$ (where $P$ is either $P_X$ or $P_Z$ ):
$V(P) = \frac{1}{\sqrt{d}} \sum_{k=0}^{d-1} c(k) P^k$
Here, $c(k)$ are coefficients derived from the Chu sequence: $c(k) = \exp\left(-i \frac{\pi k(k + d\%2)}{d}\right)$ .
Properties: These sequences possess perfect periodic autocorrelation (Kronecker-delta function), ensuring that the resulting operator is unitary.
Consistency: The authors prove that for $d=2$ , this construction reduces exactly to the operator used in the original Yamaguchi-Kempf paper, ensuring it is a consistent generalization.
Structure: The total encryption unitary $U_{enc}^{(n)}$ is the product of two such matrices, $A_X$ and $A_Z$ , acting on the data qudit and $n$ entangled pairs.

B. Decryption Operator Construction

The decryption operator is adapted from the qubit case but modified to handle the non-Hermitian nature of higher-dimensional Pauli operators.

Theorem III.1: The authors prove a new identity for generalized Bell states $|\Phi_d\rangle$ :
$\left( X_{Q1}^{k_1} Z_{Q1}^{-k_2} \otimes X_{Q2}^{k_1} Z_{Q2}^{k_2} \right) |\Phi_d\rangle = |\Phi_d\rangle$
This identity is crucial for canceling out the encryption operations during decryption.
Circuit Design: The decryption operator involves:
1. A SWAP gate between the target qudit and the first entangled pair.
2. A specific gate $C$ composed of Fourier transforms and controlled operations.
3. A summation of controlled Pauli operations weighted by the inverse of the encryption coefficients ( $c_{kl}^{-1}$ ).
Unitarity: The authors prove that the decryption matrix is unitary by leveraging the orthogonality of the generalized Pauli basis and the properties of the CAZAC coefficients.

C. Correctness Verification

The paper mathematically verifies two critical conditions:

Security (Encryption): By computing the partial trace over any single subsystem $S_i$ of the encrypted state, the authors show the result is the maximally mixed state ( $\frac{1}{d}I_d$ ). This proves no information about the original data qudit is leaked to any single party holding an encrypted share.
Recoverability (Decryption): By applying the decryption operator to the encrypted state, the original quantum state $|\psi\rangle$ is successfully transferred to the chosen party's qudit ( $S_1$ ), while all other parties remain in a maximally mixed state.

3. Key Contributions

Generalization to Arbitrary Dimensions: Successfully extends the encrypted cloning protocol from qubits ( $d=2$ ) to qudits ( $d \geq 3$ ), proving the protocol is intrinsic to finite-dimensional quantum information.
Novel Unitary Construction: Introduces a new encryption operator based on Chu Sequences (CAZAC) to overcome the non-unitarity of the exponential map in higher dimensions.
Theoretical Proofs: Provides rigorous proofs for the unitarity of both encryption and decryption operators and establishes new identities for generalized Bell states in arbitrary dimensions (Theorem III.1).
Complexity Analysis: Analyzes the circuit implementation, quantifying the gate overhead required for $d$ -dimensional systems.

4. Results and Complexity Analysis

The authors analyze the resource scaling required to implement the protocol:

Encryption Complexity:
- Two-qudit gates: Scales linearly with the number of parties ( $n$ ) but is independent of the dimension $d$ ( $4n$ gates).
- Single-qudit gates: Scales linearly with dimension $d$ ( $2n + 2(d-1)$ gates).
Decryption Complexity:
- The complexity scales as $O(nd^3)$ for both single and two-qudit gates.
- This increase is primarily due to the decomposition of double-controlled qudit gates required for the decryption logic, which scales as $O(d)$ per gate.
Comparison to Qubits: While the decryption cost increases with dimension, the authors note that the protocol does not introduce a fundamental complexity barrier compared to the qubit case; the scaling is a natural consequence of decomposing higher-dimensional controlled gates.

5. Significance

Scalability: The work demonstrates that encrypted cloning is a scalable protocol applicable to high-dimensional quantum systems, which are increasingly relevant for quantum communication due to their higher noise thresholds and larger information capacity.
Quantum Cryptography: By enabling the cloning of encrypted states in arbitrary dimensions, the paper opens avenues for new quantum cryptographic schemes, such as sophisticated secret-sharing protocols and secure quantum networks utilizing qudits.
Theoretical Foundation: It resolves a specific open problem posed by Yamaguchi and Kempf, confirming that the ability to clone encrypted states is not an artifact of 2-level systems but a fundamental property of quantum information in finite dimensions.

In summary, the paper provides a mathematically rigorous and practically implementable framework for cloning encrypted quantum states in high-dimensional systems, overcoming the limitations of previous exponential-based approaches through the use of CAZAC sequences.