Analysis and improvement of the quantum Arnold image scrambling

• Published in: Quantum information processing Vol. 13; no. 7; pp. 1545 - 1551
• Main Authors: Jiang, Nan, Wang, Luo
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.07.2014; Springer
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Artificial intelligence; Classical and quantum physics: mechanics and fields; Computer science; control theory; systems; Data Structures and Information Theory; Exact sciences and technology; Mathematical Physics; Memory and file management (including protection and security); Memory organisation. Data processing; Pattern recognition. Digital image processing. Computational geometry; Physics; Physics and Astronomy; Quantum computation; Quantum Computing; Quantum information; Quantum Information Technology; Quantum Physics; Software; Spintronics; Theoretical computing; Arnold image scrambling; Quantum computation; Quantum image processing; Subtraction; Arithmetics; Image processing; Fibonacci sequence; Cryptography
• ISSN: 1570-0755; 1573-1332
• DOI: 10.1007/s11128-014-0749-3

We investigate the quantum Arnold image scrambling proposed by Jiang et al. (Quantum Inf Process 13(5):1223–1236, 2014 ). It is aimed to realize Arnold and Fibonacci image scrambling in quantum computer. However, the algorithm does not perceive the particularities of “mod 2 n ,” multiply by 2, and subtraction in binary arithmetic. In this paper, a possible simplified version is presented based on 3 theorems and a corollary which represent the particularities of binary arithmetic. The theoretical analysis indicates that the network complexity is dropped from 140 n ∼ 168 n to 28 n ∼ 56 n and the unitarity of circuits is not destroyed.