Parrondo paradox in quantum image encryption

We present a quantum image encryption protocol that harnesses discrete-time quantum walks (DTQWs) on cycles and explicitly examines the role of the Parrondo paradox in security. Using the NEQR representation, a DTQW-generated probability mask is transformed into a quantum key image and applied via CNOT to encrypt grayscale images. We adopt an efficient circuit realization of DTQWs based on QFT-diagonalization and coin-conditioned phase layers, yielding low depth for (N=2^n) positions and (t) steps. On (64\times 64) benchmark images, the scheme suppresses adjacent-pixel correlations to near zero after encryption (e.g., (|C_H|, |C_V|, |C_D| \approx 10^{-2})), produces nearly uniform histograms, and achieves high ciphertext entropy close to the 8-bit ideal. Differential analyses further indicate strong diffusion and confusion: NPCR exceeds (99%) and UACI is around (30%), consistent with robust sensitivity to small plaintext changes. Crucially, we investigate the impact of the Parrondo paradox on encryption quality and demonstrate that our fully unitary protocol remains robust even in paradoxical regimes. We show that while the paradox can introduce biases in simpler measurement-based schemes, our integrated approach which incorporates spatial diffusion and position-color entanglement, effectively leverages the complex interference patterns of the Parrondo walk to enhance substitution, maintaining high entropy and low correlations. Our results provide a performant DTQW-based quantum image cipher and confirm the suitability of paradoxical dynamics for secure quantum image processing. We discuss implications for hardware implementations and extensions to higher-dimensional walks.

💡 Research Summary

The paper introduces a fully unitary quantum image encryption scheme that leverages discrete‑time quantum walks (DTQWs) on a cycle together with the Parrondo paradox to generate high‑quality encryption keys. Images are encoded using the Novel Enhanced Quantum Representation (NEQR), which stores each 8‑bit gray‑scale pixel value in a dedicated color register while the pixel coordinates are represented by two n‑qubit position registers, yielding a quantum state |I⟩ = Σ_{i,j}|c_{i,j}⟩⊗|i⟩⊗|j⟩ for a 2ⁿ×2ⁿ image.

The encryption process consists of three reversible layers: (1) Diffusion – a global permutation U_diff applied to the position registers (bit‑reversal and swap operations) that spreads local pixel correlations across the whole lattice; (2) Confusion – a non‑linear entangling operation U_conf built from Toffoli gates that conditionally flips color bits based on position bits and vice‑versa, thereby destroying any residual position‑color correlation; (3) Substitution – a unitary Parrondo quantum walk W(m) acting on the color register, where the coin operator switches among three parameterised rotations (θ₁, θ₂, θ₃) according to a binary message m. Each individual coin corresponds to a “losing” strategy, but when alternated according to the Parrondo scheme the overall walk exhibits a “winning” outcome, i.e., a highly mixed, near‑uniform probability distribution.

A key technical contribution is the circuit implementation of the DTQW. By diagonalising the conditional shift with a Quantum Fourier Transform (QFT) and using coin‑controlled phase rotations (Σ), the authors achieve a depth‑optimal design that requires only O(n²+nt) two‑qubit gates for t steps on an N=2ⁿ‑cycle, a substantial improvement over earlier O(n²t) constructions. When the walker starts at |0⟩, the QFT can be replaced by a layer of Hadamards, further reducing overhead.

Experimental evaluation is performed on four 64×64 gray‑scale benchmark images (Lena, Frog, Dumbbell, Triceratops). Two scenarios are examined: (i) a walk that does not exhibit the Parrondo paradox, and (ii) a walk that does. In both cases the encrypted images show:

• Adjacent‑pixel correlation coefficients (horizontal, vertical, diagonal) reduced to ≈10⁻², effectively erasing statistical dependencies;
• Uniform histograms with all 256 intensity levels occurring with equal probability;
• Cipher‑text entropy H≈7.96–7.99 bits, approaching the ideal 8‑bit value;
• Differential attack metrics NPCR≈99.5 % and UACI≈30 %, indicating strong diffusion and confusion.

Crucially, the presence of the Parrondo paradox does not degrade security. Instead, the interference patterns generated by the alternating “losing” coins enhance the substitution layer, maintaining high entropy and low correlations. The scheme remains fully reversible: decryption is achieved by applying the inverse unitary U_total† = U_diff†·U_conf†·W(m)†, recovering the original NEQR state without any classical key management beyond the small set of walk parameters.

The authors also discuss practical implementation aspects. The low‑depth QFT‑based walk circuit is compatible with current NISQ devices (IBM Q, Rigetti, IonQ), and the required qubit count scales modestly with image size (≈2n+8 qubits for a 2ⁿ×2ⁿ image). They outline extensions to higher‑dimensional walks, multi‑coin strategies, and hybrid quantum‑classical cryptographic frameworks.

In summary, the paper demonstrates that DTQW‑driven quantum image encryption can achieve classical‑level security metrics while preserving quantum reversibility, and that the Parrondo paradox, rather than being a vulnerability, can be harnessed to enrich the cryptographic diffusion‑confusion‑substitution paradigm. This work opens a pathway toward practical, hardware‑friendly quantum image ciphers that exploit the full power of quantum superposition, entanglement, and paradoxical dynamics.