Quantum Discrete Cosine Transform for Image Compression

Simple item page
dc.creatorPang, Chao Yang
dc.creatorZhou, Zheng Wei
dc.creatorGuo, Guang Can
dc.date2006-01-08
dc.date2006-01-22
dc.date.accessioned2026-07-07T07:00:17Z
dc.date.available2026-07-07T07:00:17Z
dc.descriptionDiscrete Cosine Transform (DCT) is very important in image compression. Classical 1-D DCT and 2-D DCT has time complexity O(NlogN) and O(N²logN) respectively. This paper presents a quantum DCT iteration, and constructs a quantum 1-D and 2-D DCT algorithm for image compression by using the iteration. The presented 1-D and 2-D DCT has time complexity O(sqrt(N)) and O(N) respectively. In addition, the method presented in this paper generalizes the famous Grover's algorithm to solve complex unstructured search problem.
dc.descriptionModify on Jan. 22, 2006. Only Add ref. 19
dc.identifierhttps://arxiv.org/abs/quant-ph/0601043
dc.identifierhttp://arxiv.org/abs/quant-ph/0601043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107996
dc.subjectQuantum Physics
dc.titleQuantum Discrete Cosine Transform for Image Compression
dc.typetext

Files

Collections

arXiv