We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Analysis and improvement of the quantum Arnold image scrambling.
- Authors
Jiang, Nan; Wang, Luo
- Abstract
We investigate the quantum Arnold image scrambling proposed by Jiang et al. (Quantum Inf Process 13(5):1223-1236, ). 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 $$\sim $$ 168 n to 28 n $$\sim $$ 56 n and the unitarity of circuits is not destroyed.
- Subjects
QUANTUM theory; QUANTUM communication; IMAGE processing; QUANTUM computing; SUBTRACTION (Mathematics)
- Publication
Quantum Information Processing, 2014, Vol 13, Issue 7, p1545
- ISSN
1570-0755
- Publication type
Article
- DOI
10.1007/s11128-014-0749-3