Author:
Haque Md Ershadul,Paul Manoranjan,Ulhaq Anwaar,Debnath Tanmoy
Abstract
AbstractIn recent years, quantum image computing draws a lot of attention due to storing and processing image data faster compared to classical computers. A number of approaches have been proposed to represent the quantum image inside a quantum computer. Representing and compressing medium and big-size images inside the quantum computer is still challenging. To address this issue, we have proposed a block-wise DCT-EFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) approach to represent and compress the gray-scale image efficiently to save computational time and reduce the quantum bits (qubits) for the state preparation. In this work, we have demonstrated the capability of block-wise DCT and DWT transformation inside the quantum domain to investigate their relative performances. The Quirk simulation tool is used to design the corresponding quantum image circuit. In the proposed DCT-EFRQI approach, a total of 17 qubits are used to represent the coefficients, the connection between coefficients and state (i.e., auxiliary), and their position for representing and compressing grayscale images inside a quantum computer. Among those, 8 qubits are used to map the coefficient values and the rest are used to generate the corresponding coefficient XY-coordinate position including one auxiliary qubit. Theoretical analysis and experimental results show that the proposed DCT-EFRQI scheme provides better representation and compression compared to DCT-GQIR, DWT-GQIR, and DWT-EFRQI in terms of rate-distortion performance.
Publisher
Springer Science and Business Media LLC
Reference34 articles.
1. Khan, R. A. An improved flexible representation of quantum images. Quant. Inf. Process. 1, 1–19 (2019).
2. Jacobs, I. Fine particles, thin films and exchange anisotropy. Magnetism 1, 271–350 (1963).
3. Venegas-Andraca, S. E. & Bose, S. Storing, processing, and retrieving an image using quantum mechanics. Quant. Inf. Comput. 5105, 137–147 (2003).
4. Ladd, T. D. et al. Quantum computers. Nature 464, 45–53 (2010).
5. Mandra, S., Guerreschi, G. G. & Aspuru-Guzik, A. Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems. N. J. Phys. 18, 073003 (2016).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献