Method for achieving Arnold image scrambling effect on quantum computer

Abstract

The invention relates to a method for achieving an Arnold image scrambling effect on a quantum computer. The method is characterized in that the Arnold image scrambling effect can be achieved on the quantum computer. The method includes the steps that an original quantum image is provided, Arnold scrambling conversion is carried out on an x-axis coordinate of the original image, and Arnold scrambling conversion is carried out on a y-axis coordinate of the original image; scrambling conversion carried out on the x-axis coordinate further includes the procedures of calculation of x+y and execution of a modular arithmetic on 2n; scrambling conversion carried out on the y-axis coordinate further includes the procedures of calculation of 2y, calculation of x+2y and execution of a modular arithmetic on 2n. The algorithm is provided in a quantum circuit form, and it is guaranteed that the algorithm can directly operate on the quantum computer; compared with an existing method for achieving the Arnold image scrambling effect on the quantum computer, a modular arithmetic operation can be achieved by ignorance of carry directly, and network complexity is greatly reduced.

Description

technical field [0001] The invention relates to quantum computing technology and image scrambling technology, and relates to a method for realizing the effect of Arnold image scrambling on a quantum computer. Background technique [0002] 1. Arnold image scrambling [0003] Image scrambling refers to changing the image into an unreadable form by moving the position of pixels to protect image information. In order to ensure the scrambling degree of scrambling, scrambling is carried out according to a certain rule. According to different rules, there are many scrambling methods, and Arnold scrambling is one of them. [0004] On a classical computer, a digital image can be viewed as a two-dimensional matrix I(x,y). Assuming image size is 2 n ×2 n , n is a non-negative integer, the image after scrambling is I′(x′,y′), then Arnold scrambling can be defined as: [0005] x'=(x+y)mod2 n (1) [0006] y'=(x+2y)mod2 n [0007] Among them, mod is a modulo operation. ...

AI Technical Summary

Problems solved by technology

incompatible with each other

[0027] (2) The image representation method is different: a 2 on a classical computer n ×2 n image, requires a 2 n ×2 n Array to store, if each element in the array is represented by 8 bits, that is, the pixel color depth is 8, then the entire image needs to occupy 8×2 n ×2 n bits, if the color depth is 24, and RGB each occupies 8 bits, the entire image needs to occupy 24×2 n ×2 n bits, the space complexity is O(2 2n ); On a quantum computer, only 2n+1 qubits are needed, and the space complexity is O(n)

[0029] 6. Existing quantum Arnold scrambling method

[0030] The paper "The quantum realization of Arnold and Fibonacci image scrambling" published by Jiang Nan et al. on Quantum Information Processing discloses a quantum Arnold scrambling method, which is implemented based on a quantum adder, but the processing of the modulo operation is too complicated

Images