Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Science China Information Sciences

A theoretical framework for quantum image representation and data loading scheme

Ben-Qiong Hu, Xudong Huang, Ri‐Gui Zhou, Yanyu Wei, Qun Wan, Chao-Yang Pang

Published Feb 1, 2014• 23 citations
Publisher
DOI
10.1007/s11432-013-4866-x

Related papers

A survey of quantum image representations

Fei Yan, Abdullah M. Iliyasu, Salvador Elías Venegas-Andraca

Quantum Information Processing•Dec 11, 2015•318 citations

A comparative study of Quantum Image Representation techniques as data encoding in Variational Classifiers

I.M.A. Cabot

Quantum Image Representation represents a promising frontier in Machine Learning and image processing. It provides unique opportunities to revolutionize how classical images can be represented as a quantum state using a reasonable number of qubits. This research investigates three state-of-theart Quantum Image Representation techniques to determine their benefits in obtaining a quantum state representing the classical image. By implementing and comparing these techniques, we explore their potential for encoding classical images. Subsequently, the Variational Classifier is applied to investigate whether these encoding types offer advantages over traditional data loading functions. Despite observed efficiency gains, distinguishing significant advantages over traditional data loading techniques remains challenging.

•Jan 1, 2024•0 citations

Quantum Image Representations

Fei Yan, Salvador Elías Venegas-Andraca

Springer eBooks•Jan 1, 2020•5 citations

Using Quantum State to Represent Vector and Matrix

Chao-Yang Pang

This paper presents a simple and fast method to represent vector and matrix using quantum state. Two application examples of the method presented in this paper are given as follows. 1. Applying the method directly to design quantum loading scheme that evades the efficiency bottleneck of classical computer. CPU and memory are the most important two parts of computer, "CPU + Memory=Computer". Loading scheme is defined as loading data into registers of CPU from memory, it connects CPU and memory as a whole machine. Classical loading scheme has time complexity O(N) in terms of arbitrary algorithm, it is the efficiency bottleneck of classical computer. By contrast, quantum loading scheme presented in this paper has time complexity O(logN)! 2. The method is also suitable to represent image and brings many advantages to image compression.

•Dec 8, 2006•0 citations

A quantum computing method for multidimensional cycle shift transformations for quantum image processing

Konstantinos P. Prousalis, Asimakis Kydros, Nikos Konofaos

Abstract Quantum image processing in qubit-based image representations for more than two dimensions seems to offer great opportunities for advanced data analysis and processing in quantum computers. Of fundamental importance is cycle shifting an image along an arbitrary direction, as various operations are based on it. In this work, a widely used image representation scheme is generalized into a single, multidimensional encoding. Within this framework, we define a cycle shifting method capable of translating a representation along any linear combination of its dimensional axes. The algorithmic procedure is appropriately redefined to accommodate arbitrary shifts in the Hilbert space. The corresponding computational complexity is optimized, achieving an exponential reduction in quantum resource requirements with respect to the shift-step magnitude. A comparative complexity analysis substantiates the efficiency gain, while simulation results validate the proposed multidimensional framework for two- and three-dimensional representations.

Physica Scripta•Nov 1, 2025•2 citations

Quantum image representation: a review

Marina Lisnichenko, Stanislav Protasov

Quantum Machine Intelligence•Dec 26, 2022•46 citations
Quantum Image Representation represents a promising frontier in Machine Learning and image processing. It provides unique opportunities to revolutionize how classical images can be represented as a quantum state using a reasonable number of qubits. This research investigates three state-of-theart Quantum Image Representation techniques to determine their benefits in obtaining a quantum state representing the classical image. By implementing and comparing these techniques, we explore their potential for encoding classical images. Subsequently, the Variational Classifier is applied to investigate whether these encoding types offer advantages over traditional data loading functions. Despite observed efficiency gains, distinguishing significant advantages over traditional data loading techniques remains challenging.
This paper presents a simple and fast method to represent vector and matrix using quantum state. Two application examples of the method presented in this paper are given as follows. 1. Applying the method directly to design quantum loading scheme that evades the efficiency bottleneck of classical computer. CPU and memory are the most important two parts of computer, "CPU + Memory=Computer". Loading scheme is defined as loading data into registers of CPU from memory, it connects CPU and memory as a whole machine. Classical loading scheme has time complexity O(N) in terms of arbitrary algorithm, it is the efficiency bottleneck of classical computer. By contrast, quantum loading scheme presented in this paper has time complexity O(logN)! 2. The method is also suitable to represent image and brings many advantages to image compression.
Abstract Quantum image processing in qubit-based image representations for more than two dimensions seems to offer great opportunities for advanced data analysis and processing in quantum computers. Of fundamental importance is cycle shifting an image along an arbitrary direction, as various operations are based on it. In this work, a widely used image representation scheme is generalized into a single, multidimensional encoding. Within this framework, we define a cycle shifting method capable of translating a representation along any linear combination of its dimensional axes. The algorithmic procedure is appropriately redefined to accommodate arbitrary shifts in the Hilbert space. The corresponding computational complexity is optimized, achieving an exponential reduction in quantum resource requirements with respect to the shift-step magnitude. A comparative complexity analysis substantiates the efficiency gain, while simulation results validate the proposed multidimensional framework for two- and three-dimensional representations.