Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Analysis and improvement of the quantum Arnold image scrambling

Analysis and improvement of the quantum Arnold image scrambling 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}$$ 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 140n $$\sim $$ ∼ 168n to 28n $$\sim $$ ∼ 56n and the unitarity of circuits is not destroyed. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Analysis and improvement of the quantum Arnold image scrambling

Quantum Information Processing , Volume 13 (7) – May 11, 2014

Loading next page...
 
/lp/springer-journals/analysis-and-improvement-of-the-quantum-arnold-image-scrambling-tP3t32HITZ

References (4)

Publisher
Springer Journals
Copyright
Copyright © 2014 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-014-0749-3
Publisher site
See Article on Publisher Site

Abstract

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}$$ 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 140n $$\sim $$ ∼ 168n to 28n $$\sim $$ ∼ 56n and the unitarity of circuits is not destroyed.

Journal

Quantum Information ProcessingSpringer Journals

Published: May 11, 2014

There are no references for this article.