Journal Article10.1007/S11433-020-1582-8
Efficient quantum arithmetic operation circuits for quantum image processing
98
TL;DR: This study proposes the fault-tolerant implementations for TR and Peres gates with optimized T-depth and T-Count and implements cyclic and complete translations of quantum images using quantum arithmetic operations, and the scalar matrix multiplication.
read more
Abstract: Efficient quantum circuits for arithmetic operations are vital for quantum algorithms. A fault-tolerant circuit is required for a robust quantum computing in the presence of noise. Quantum circuits based on Clifford+T gates are easily rendered fault-tolerant. Therefore, reducing the T-depth and T-Count without increasing the qubit number represents vital optimization goals for quantum circuits. In this study, we propose the fault-tolerant implementations for TR and Peres gates with optimized T-depth and T-Count. Next, we design fault-tolerant circuits for quantum arithmetic operations using the TR and Peres gates. Then, we implement cyclic and complete translations of quantum images using quantum arithmetic operations, and the scalar matrix multiplication. Comparative analysis and simulation results reveal that the proposed arithmetic and image operations are efficient. For instance, cyclic translations of a quantum image produce 50% T-depth reduction relative to the previous best-known cyclic translation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Quantum multi-image compression-encryption scheme based on quantum discrete cosine transform and 4D hyper-chaotic Henon map
Jing-Yi Dai,Yan Ma,Nanrun Zhou +2 more
TL;DR: In this paper, a new quantum multi-image compression and encryption algorithm combining quantum discrete cosine transform with 4D hyper-chaotic Henon map is proposed, where the four original images are firstly transformed by quantum DCT, and then the obtained frequency coefficient matrices are compressed with the measurement matrices to construct four compressed images.
50
A New Trend of Quantum Image Representations
TL;DR: This work defines the definition of these quantum image representations the preparation of quantum images and the number of quantum bits required as well as the computational complexity, and analyzes, compares and summarizes the similarities and differences.
Novel quantum circuit implementation of Advanced Encryption Standard with low costs
Zhenqiang Li,Binbin Cai,HongWei Sun,Haiying Liu,Lin-Chun Wan,Su-Juan Qin,Qiao-Yan Wen,Fei Gao +7 more
TL;DR: It is found that the number of qubits in the round function of the Advanced Encryption Standard can be decreased by introducing the circuit sending |a〉 to |S (a)⌬ to reduce the T-depth, and compared with the previous quantum circuits, this study only requires 270/334/398 qubits.
41
A review on reversible quantum adders
TL;DR: This work analyzes the reversible adders in the state-of-the-art for quantum computing, classifying them according to their type, and comparing each other using referenced and validated metrics that allow highlighting the strengths and weaknesses of each adder.
39
Contemporary Quantum Computing Use Cases: Taxonomy, Review and Challenges
TL;DR: A literature survey of some of the dedicated work done by researchers in the quantum field is presented and the conceptual and notational information that segregates quantum computing from conventional computing is offered.
38
References
•Book
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Jan 2000
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Quantum computation and quantum information
TL;DR: This book inchides well-known classics such as "On the Criteria to be used in Decomposing Systems into Modules," "On a 'Buzzword': Hierarchical Structure," and "Software Aging."
20.4K
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
19.6K
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
7.5K
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for both problems, which takes a number of steps polynomial in the input size, e.g., the number of digits to be factored.
5.9K
Related Papers (5)
Edgard Munoz-Coreas,Himanshu Thapliyal +1 more
- 01 Oct 2018
Moayad A. Fahdil,Ali Foud Al-Azawi,Sammer Said +2 more
- 01 Jan 2010