Access the full text.
Sign up today, get DeepDyve free for 14 days.
G Peano (1890)
Sur une courbe qui remplit toute une aire planeMath. Ann., 36
V Vlatko, B Adriano, E Artur (1996)
Quantum networks for elementary arithmetic operationsPhys. Rev. A, 54
L Honglian, F Jing (2012)
Generalization of Arnold transform FAN transform and its application in image scrambling encryptionRecent. Adv. CSIE. LNEE., 128
PQ Le, F Dong, K Hirota (2011)
A flexible representation of quantum images for polynomial preparation, image compression and processing operationsQuantum Inf. Process., 10
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.
Quantum Information Processing – Springer Journals
Published: May 11, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.