Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Optik

Quantum-randomness-assisted image encryption using hardware QRNG-driven block permutation and Fisher-Yates shuffling

Utkarsh Kumar Singh, Bhavana Sharma, Devnath Dhirhe

Published Aug 19, 2026• 0 citations
Publisher
DOI
10.1016/j.ijleo.2026.172874

Related papers

A quantum image dual-scrambling encryption scheme based on random permutation

Haihua Zhu, Xiu‐Bo Chen, Yixian Yang

Science China Information Sciences•Nov 11, 2019•13 citations

Enhanced quantum image encryption using DNA–QTRNG and Sattolo-RQFT shuffling

T. S. Gururaja, Padmapriya Praveenkumar

The Journal of Supercomputing•Mar 28, 2025•13 citations

Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations

Lennart Binkowski, Marvin Schwiering

Uniform superpositions over permutations play a central role in quantum error correction, cryptography, and combinatorial optimisation. We introduce a simple yet powerful quantisation of the classical Fisher-Yates shuffle, yielding a suite of efficient quantum algorithms for preparing such superpositions on composite registers. Our method replaces classical randomness with coherent control, enabling five variants that differ in their output structure and entanglement with ancillary systems. We demonstrate that this construction achieves the best known combination of asymptotic resources among all existing approaches, requiring only $\mathcal{O}(n \log(n))$ qubits and $\mathcal{O}(n^{2} \log(n))$ gates and circuit depth. These results position the quantum Fisher-Yates shuffle as a strong candidate for optimality within this class of algorithms. Our work unifies several prior constructions under a single, transparent framework and opens up new directions for quantum state preparation using classical combinatorial insights. Our implementation in Qiskit is available as open-source code, supporting reproducibility and future exploration of quantum permutation-based algorithms.

arXiv:2504.17965•Apr 24, 2025•5 citations

Quantum image encryption algorithm based on Fisher–Yates algorithm and Logistic mapping

Ping Fan, Yiteng Zhang

Abstract The parallel computing power of quantum computing and the special properties of qubits provide an effective solution for image processing tasks. This paper presents a quantum image encryption algorithm based on Fisher-Yates algorithm and Logistic mapping. Firstly, the Fisher-Yates algorithm is used to generate three key sequences, one of which is used to encode the coordinate qubits of the image. Using the other two keys and the preset rules, the quantum coordinate scrambling operation is designed based on the encoded coordinate qubit, which effectively scrambles the spatial information of the plaintext image. Next, another set of key sequences is generated, one of which is used to encode the color qubits of the image. Using two other key sequences and different rules, a qubit plane scrambling operation based on coded color qubits is designed, and the color information of image is scrambled successfully. Finally, the quantum key image is generated based on Logistic mapping, and the key image is scrambled based on Fisher-Yates algorithm to improve the key complexity. The final ciphertext image is obtained by performing XOR operation between the original image and the scrambled key image. The complete quantum circuit diagram of the scheme is given in this paper. The experimental results and security analysis prove the effectiveness of the scheme, which provides a large key space and the computational complexity is only O(n).

Quantum Information Processing•Jun 12, 2024•13 citations

Quantum image encryption algorithm via optimized quantum circuit and parity bit-plane permutation

Jinwen He, Hegui Zhu, Xv Zhou

Journal of Information Security and Applications•Jan 13, 2024•41 citations

An Encryption Method of 8-Qubit States Using Unitary Matrix and Permutation

Bekti Maryuni Susanto, Rizky Alfanio Atmoko, Erik Yohan Kartiko +1 more

The paper explores the methods for encrypting and decrypting an 8-qubit states of quantum system using unitary and permutation matrix. Our approach utilizes a unitary matrix to create a new superpositions of an encrypted 8-qubits states. By applying a permutation matrix, we shuffle the state vectors, adding an additional layer of security. The encryption process will be performed on the encrypted state using the formula , where is the original state vector, is the unitary matrix, and is the permutation matrix. To ensure the total probability remains normalized, we showed that the resulting new 8-qubits state remains normalized. The decryption process is achieved by applying the following operations retrieving the original state. This paper also is showing that the original quantum state can be accurately recovered post-decryption. This highlights the robustness of our approach in maintaining the integrity of quantum information. Furthermore, we aim to create block for different 8-qubits state using a different key in each block from the initial unitary matrix and permutation . In order to implement these methods, we need to generate a new unitary matrix for each block. Either by random pick or using iteration. In fact, we showed how to create the new unitary matrix using iteration for each block. Here we showed that the new generated matrix is also a unitary matrix so that we can use iteration proses to create a new unitary matrix in each block for different 8-qubits state. Here we generate the unitary matrix from as key in block . This result in the encryption of each block for each 8-qubits state using the formula resulting in a more robust security. The encryption/decryption scheme we referenced can theoretically be implemented on modern quantum hardware but verifying operations involving hundreds of qubits would demand rigorous calibration and error correction

Jurnal Teknologi Informasi dan Terapan•Oct 17, 2025•0 citations
Uniform superpositions over permutations play a central role in quantum error correction, cryptography, and combinatorial optimisation. We introduce a simple yet powerful quantisation of the classical Fisher-Yates shuffle, yielding a suite of efficient quantum algorithms for preparing such superpositions on composite registers. Our method replaces classical randomness with coherent control, enabling five variants that differ in their output structure and entanglement with ancillary systems. We demonstrate that this construction achieves the best known combination of asymptotic resources among all existing approaches, requiring only O(nlog⁡(n))\mathcal{O}(n \log(n))O(nlog(n)) qubits and O(n2log⁡(n))\mathcal{O}(n^{2} \log(n))O(n2log(n)) gates and circuit depth. These results position the quantum Fisher-Yates shuffle as a strong candidate for optimality within this class of algorithms. Our work unifies several prior constructions under a single, transparent framework and opens up new directions for quantum state preparation using classical combinatorial insights. Our implementation in Qiskit is available as open-source code, supporting reproducibility and future exploration of quantum permutation-based algorithms.
Abstract The parallel computing power of quantum computing and the special properties of qubits provide an effective solution for image processing tasks. This paper presents a quantum image encryption algorithm based on Fisher-Yates algorithm and Logistic mapping. Firstly, the Fisher-Yates algorithm is used to generate three key sequences, one of which is used to encode the coordinate qubits of the image. Using the other two keys and the preset rules, the quantum coordinate scrambling operation is designed based on the encoded coordinate qubit, which effectively scrambles the spatial information of the plaintext image. Next, another set of key sequences is generated, one of which is used to encode the color qubits of the image. Using two other key sequences and different rules, a qubit plane scrambling operation based on coded color qubits is designed, and the color information of image is scrambled successfully. Finally, the quantum key image is generated based on Logistic mapping, and the key image is scrambled based on Fisher-Yates algorithm to improve the key complexity. The final ciphertext image is obtained by performing XOR operation between the original image and the scrambled key image. The complete quantum circuit diagram of the scheme is given in this paper. The experimental results and security analysis prove the effectiveness of the scheme, which provides a large key space and the computational complexity is only O(n).
The paper explores the methods for encrypting and decrypting an 8-qubit states of quantum system using unitary and permutation matrix. Our approach utilizes a unitary matrix to create a new superpositions of an encrypted 8-qubits states. By applying a permutation matrix, we shuffle the state vectors, adding an additional layer of security. The encryption process will be performed on the encrypted state using the formula , where is the original state vector, is the unitary matrix, and is the permutation matrix. To ensure the total probability remains normalized, we showed that the resulting new 8-qubits state remains normalized. The decryption process is achieved by applying the following operations retrieving the original state. This paper also is showing that the original quantum state can be accurately recovered post-decryption. This highlights the robustness of our approach in maintaining the integrity of quantum information. Furthermore, we aim to create block for different 8-qubits state using a different key in each block from the initial unitary matrix and permutation . In order to implement these methods, we need to generate a new unitary matrix for each block. Either by random pick or using iteration. In fact, we showed how to create the new unitary matrix using iteration for each block. Here we showed that the new generated matrix is also a unitary matrix so that we can use iteration proses to create a new unitary matrix in each block for different 8-qubits state. Here we generate the unitary matrix from as key in block . This result in the encryption of each block for each 8-qubits state using the formula resulting in a more robust security. The encryption/decryption scheme we referenced can theoretically be implemented on modern quantum hardware but verifying operations involving hundreds of qubits would demand rigorous calibration and error correction