A dual quantum image scrambling method

2018 ◽  
Vol 18 (1) ◽  
Author(s):  
Shahrokh Heidari ◽  
Matin Vafaei ◽  
Monireh Houshmand ◽  
Narges Tabatabaey-Mashadi
IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 138233-138243 ◽  
Author(s):  
Hai-Sheng Li ◽  
Xiao Chen ◽  
Shuxiang Song ◽  
Zhixian Liao ◽  
Jianying Fang

2020 ◽  
Vol 35 (17) ◽  
pp. 2050145 ◽  
Author(s):  
Chengan Hou ◽  
Xingbin Liu ◽  
Songyang Feng

Quantum image processing has become a significant aspect within the field of quantum information processing because the image is an essential carrier of information, and quantum computation has powerful image processing ability. Image scrambling algorithms are often required as initial image operations in quantum image processing applications such as quantum image encryption and watermarking. However, the efficiency of existing quantum image scrambling algorithms needs to be improved urgently, especially in terms of periodicity. Therefore, a novel quantum image scrambling algorithm based on discrete Baker map is proposed in this paper, which can be implemented by swapping qubits with low circuit complexity. The quantum version of discrete Baker map is deduced and the corresponding quantum circuit is designed. The simulation results show that the scrambling algorithm has the characteristic of long period, which can further enhance the security of quantum image encryption algorithms. Besides, for generalized discrete Baker maps, the conditions that they can be implemented by swapping qubits are given. Moreover, the number of discrete Baker maps satisfying the conditions is also calculated.


Author(s):  
Fei Yan ◽  
◽  
Yiming Guo ◽  
Abdullah M. Iliyasu ◽  
Zhengang Jiang ◽  
...  

Image scrambling is a technique used for confidential storage and transmission as well as for image information hiding. In this study, we propose a multi-channel quantum image scrambling method, which applies both color and geometric transformations of an image. This is a simple and reliable method for transforming a meaningful quantum image into a meaningless or disordered one. We performed two simulation experiments, which demonstrated the efficiency and flexibility of the proposed method. Previous studies mainly developed scrambling strategies for grayscale quantum images, whereas the proposed method is effective for the color image scrambling in the quantum computing domain.


2013 ◽  
Vol 33 (9) ◽  
pp. 2497-2500
Author(s):  
Tiesheng FAN ◽  
Zhongqing ZHANG ◽  
Jing SUN ◽  
Xuechun LUO ◽  
Guiqiang LU ◽  
...  
Keyword(s):  

2013 ◽  
Vol 32 (12) ◽  
pp. 3470-3473
Author(s):  
Cong-li WANG ◽  
Zhi-bin CHEN ◽  
Ming-xi XUE ◽  
Chao ZHANG

2015 ◽  
Vol 32 (4) ◽  
pp. 428
Author(s):  
Rijun Liao ◽  
Xiongjun Li ◽  
Jianjie Xu ◽  
Jinlong Li ◽  
Jianbiao Xian ◽  
...  

2021 ◽  
Vol 51 (3) ◽  
Author(s):  
Maurice A. de Gosson

AbstractWe define and study the notion of quantum polarity, which is a kind of geometric Fourier transform between sets of positions and sets of momenta. Extending previous work of ours, we show that the orthogonal projections of the covariance ellipsoid of a quantum state on the configuration and momentum spaces form what we call a dual quantum pair. We thereafter show that quantum polarity allows solving the Pauli reconstruction problem for Gaussian wavefunctions. The notion of quantum polarity exhibits a strong interplay between the uncertainty principle and symplectic and convex geometry and our approach could therefore pave the way for a geometric and topological version of quantum indeterminacy. We relate our results to the Blaschke–Santaló inequality and to the Mahler conjecture. We also discuss the Hardy uncertainty principle and the less-known Donoho–Stark principle from the point of view of quantum polarity.


Sign in / Sign up

Export Citation Format

Share Document