⚛️ quantum physics

Parrondo paradox in quantum image encryption

This paper proposes a robust quantum image encryption protocol utilizing discrete-time quantum walks on cycles within the NEQR framework, demonstrating that the integration of Parrondo paradox dynamics effectively enhances security by suppressing pixel correlations, achieving high entropy, and maintaining strong diffusion and confusion properties through a low-depth, fully unitary circuit.

Original authors: Łukasz Pawela

Published 2026-02-03

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Łukasz Pawela

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

Imagine you have a secret photo you want to send to a friend, but you're worried about hackers stealing it. In the old days, we used math tricks (classical encryption) to scramble the image. But now, with the rise of powerful quantum computers, those old tricks might not be safe anymore.

This paper introduces a new way to lock up digital photos using the strange rules of quantum physics. The author, Lukasz Pawela, proposes a system that turns a picture into a quantum puzzle so complex that even a quantum computer would struggle to solve it without the right key.

Here is how the paper explains it, broken down into simple concepts:

1. The "Quantum Walker" (The Engine)

At the heart of this system is something called a Discrete-Time Quantum Walk.

The Analogy: Imagine a person walking on a circular track with many spots. In the real world, if you flip a coin to decide whether to walk left or right, you end up in a somewhat predictable pattern.
The Quantum Twist: In the quantum world, this "walker" can be in a superposition, meaning they are walking left and right at the same time. As they walk, they create a complex web of interference (like ripples in a pond crashing into each other). This creates a pattern that looks completely random and is incredibly hard to predict.

2. The "Parrondo Paradox" (The Secret Sauce)

The paper tests a weird phenomenon called the Parrondo Paradox.

The Analogy: Imagine you are playing two different gambling games. Game A makes you lose money. Game B also makes you lose money. The paradox is that if you switch back and forth between Game A and Game B randomly, you suddenly start winning.
The Fear: In previous attempts to use quantum walks for encryption, researchers worried that if they used these "losing" game parameters (the paradox), the resulting image might get "biased" or predictable, making it easier to hack.
The Paper's Discovery: The author found that while the paradox does create weird biases in simple systems, their new, more complex system neutralizes this risk. Even when the "walker" is playing the "losing" games, the final result is still perfectly secure.

3. The Three-Layer Lock (How the Encryption Works)

To encrypt the image, the system doesn't just scramble the pixels once; it does it in three distinct, reversible layers, like a high-tech safe:

Layer 1: The Shuffle (Diffusion)
Imagine taking a deck of cards and shuffling them so that a card that was next to the King is now next to the Queen. This layer scrambles the positions of the pixels so that neighbors in the original photo are no longer neighbors in the encrypted photo.
Layer 2: The Mix (Confusion)
This layer mixes the color of a pixel with its position. It's like taking a red pixel and saying, "If you are in the top-left corner, turn blue; if you are in the bottom-right, turn green." This destroys any simple patterns.
Layer 3: The Quantum Walk (Substitution)
Finally, the "Quantum Walker" runs its race. It uses the complex, interference-heavy patterns generated by the walk to change the actual color values of the pixels. This is where the "Parrondo Paradox" is tested.

4. The Results: Did it Work?

The author tested this on standard test images (like the famous "Lena" photo) at a size of 64x64 pixels. Here is what happened:

The "Before" vs. "After": The original photos had clear patterns (like a smooth gradient in a sky). The encrypted photos looked like pure, static TV snow.
No Clues: The author measured how much one pixel "knew" about its neighbor. In the original photo, neighbors were very similar (high correlation). In the encrypted photo, the correlation dropped to almost zero. This means if a hacker steals the encrypted image, they can't guess what the original looked like.
The "Paradox" Test: The author specifically ran the system using the "Parrondo Paradox" settings (the "losing" games).
- Old worry: The image would be weak or biased.
- Actual result: The image was just as secure as the non-paradox version. The system's extra layers of shuffling and mixing protected it from the paradox's quirks.
Sensitivity: If you changed just one single pixel in the original photo before encrypting it, the entire encrypted photo changed completely (over 99% of the pixels changed). This proves the system is extremely sensitive to tiny changes, a key requirement for strong security.

The Bottom Line

The paper claims to have built a fully reversible, quantum-safe image encryption system. It uses the weird, counter-intuitive rules of quantum mechanics (specifically quantum walks) to scramble images.

Crucially, it proves that you don't have to avoid the "Parrondo Paradox" to stay safe. Even if you use the "losing" strategies that usually cause problems, this specific three-layer design keeps the image perfectly secure, turning the paradox's complexity into a strength rather than a weakness.

The author concludes that this method is ready for future quantum computers and offers a robust way to protect digital images in a quantum world.

Technical Summary: Parrondo Paradox in Quantum Image Encryption

Problem Statement
The secure transmission and storage of digital images face significant challenges from emerging quantum computing capabilities, which threaten to undermine classical cryptographic methods. While Quantum Image Processing (QIP) offers advantages through superposition and entanglement, existing quantum image encryption schemes often rely on measurement-based approaches. These methods collapse quantum states to generate classical random masks, effectively discarding intrinsic quantum information and reversibility, thereby reducing the quantum walk to a classical random number generator. Furthermore, the role of the Parrondo paradox—a phenomenon where alternating two losing strategies yields a winning outcome—in quantum cryptographic security remains under-explored, with concerns that paradoxical dynamics might introduce exploitable biases in simpler schemes.

Methodology
The paper proposes a fully coherent, unitary quantum image encryption protocol that avoids state collapse throughout the encryption process. The scheme utilizes the Novel Enhanced Quantum Representation (NEQR) to encode grayscale images, where pixel intensities are stored in 8-qubit quantum registers.

The encryption process integrates three reversible quantum layers:

Spatial Diffusion: A permutation layer using coordinate-dependent bit-reversal and swap operations to scatter local pixel correlations globally across the image lattice.
Confusion: A non-linear operation utilizing Toffoli gates to entangle position and color registers, destroying linear correlations between pixel coordinates and intensity values.
Substitution via Discrete-Time Quantum Walk (DTQW): A unitary Parrondo quantum walk is applied to the color register. The walk occurs on a cycle of $N=2^n$ positions. The coin operator sequence is dynamically selected based on a binary message key, alternating between three distinct coin configurations ( $C_0, C_1, C_2$ ) parameterized by angles $\theta_1, \theta_2, \theta_3$ .

Quantum Circuit Implementation
To ensure efficiency on current quantum hardware, the authors employ an optimized DTQW circuit based on QFT-diagonalization. Instead of repeated Quantum Fourier Transforms (QFT) for every step, the conditional shift operator is diagonalized using a single QFT and its inverse. The time evolution is implemented via layers of single-qubit and controlled-phase gates acting conditionally on the coin state. This approach reduces the circuit depth and multi-qubit gate count to $O(n^2 + nt)$ for $t$ steps on an $N=2^n$ cycle, a significant improvement over previous $O(n^2t)$ scaling.

Key Contributions

Unitary Protocol: The paper introduces a fully reversible encryption scheme that preserves superposition and entanglement, contrasting with prior measurement-based protocols that discard quantum coherence.
Parrondo Paradox Investigation: The work explicitly examines the impact of the Parrondo paradox on encryption quality. It demonstrates that while paradoxical regimes (where alternating losing strategies produce a winning outcome) can introduce biases in simpler measurement-based schemes, the proposed multi-layered unitary architecture effectively mitigates these risks.
Integrated Architecture: By combining spatial diffusion, position-color entanglement, and the complex interference patterns of the Parrondo walk, the protocol leverages the paradox to enhance substitution rather than compromise security.

Results
The protocol was evaluated on $64 \times 64$ benchmark images (e.g., Lena, Frog, Triceratops) under two conditions: standard parameters (non-paradox) and paradoxical parameters.

Correlation Suppression: In both cases, the encryption reduced adjacent-pixel correlations (horizontal, vertical, and diagonal) to near-zero values (approximately $10^{-2}$ ), indicating effective scrambling.
Histogram Uniformity: Encrypted images exhibited nearly uniform histograms, contrasting with the non-uniform distributions of original images.
Entropy: The entropy of encrypted pixel values approached the ideal 8-bit limit (values $\approx 7.95$ ), signifying high uncertainty and uniform distribution.
Diffusion and Confusion Sensitivity:
- NPCR (Number of Pixel Change Rate): Exceeded 99% in all tests, indicating that changing a single plaintext pixel alters almost the entire ciphertext.
- UACI (Unified Average Changing Intensity): Remained around 30%, consistent with robust sensitivity to small plaintext changes.
Paradox Robustness: Crucially, the results confirmed that the protocol remains secure and effective even when the quantum walk operates in a paradoxical regime. The additional diffusion and confusion layers prevented the paradox from introducing exploitable biases, maintaining high entropy and low correlations comparable to the non-paradox case.

Significance
The paper concludes that the proposed fully unitary protocol is a performant quantum image cipher suitable for secure quantum image processing. It confirms that paradoxical dynamics, when integrated into a multi-layered unitary pipeline, do not degrade security but can be harnessed to enhance the complexity of the encryption. The work provides a reversible, deterministic, and highly sensitive mechanism that leverages the full power of quantum superposition and entanglement. The authors suggest that these findings support the suitability of such methods for future hardware implementations and potential extensions to higher-dimensional walks.