Efficient quantum image representation and compression circuit using zero-discarded state preparation approach
Md Ershadul Haque, Manoranjan Paul, Anwaar Ulhaq, Tanmoy Debnath

TL;DR
This paper introduces ZSCNEQR, a quantum image representation and compression circuit that reduces complexity and qubit requirements by discarding zeroes in location data, enhancing efficiency and performance.
Contribution
A novel zero-discarded state connection approach (ZSCNEQR) that improves quantum image representation and compression by reducing circuit complexity and qubit usage.
Findings
Requires 11.76% fewer qubits than existing methods
Achieves better rate-distortion performance
Significantly reduces circuit complexity
Abstract
Quantum image computing draws a lot of attention due to storing and processing image data faster than classical. With increasing the image size, the number of connections also increases, leading to the circuit complex. Therefore, efficient quantum image representation and compression issues are still challenging. The encoding of images for representation and compression in quantum systems is different from classical ones. In quantum, encoding of position is more concerned which is the major difference from the classical. In this paper, a novel zero-discarded state connection novel enhance quantum representation (ZSCNEQR) approach is introduced to reduce complexity further by discarding '0' in the location representation information. In the control operational gate, only input '1' contribute to its output thus, discarding zero makes the proposed ZSCNEQR circuit more efficient. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
