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

Quantum Information Processing

Data rotation and its influence on quantum encoding

Daniel Sierra-Sosa, Soham Pal, Michael Telahun

Published Jan 23, 2023• 8 citations
Publisher
DOI
10.1007/s11128-023-03837-1

Related papers

Quantum Data Structures and Encoding

Jesse Van Griensven Thé, Roydon Andrew Fraser, José R. Rosas-Bustos

Springer eBooks•Jan 1, 2025•0 citations

Incremental Data-Uploading for Full-Quantum Classification

Maniraman Periyasamy, Nico Meyer, Christian Ufrecht +3 more

The data representation in a machine-learning model strongly influences its performance. This becomes even more important for quantum machine learning models implemented on noisy intermediate scale quantum (NISQ) devices. Encoding high dimensional data into a quantum circuit for a NISQ device without any loss of information is not trivial and brings a lot of challenges. While simple encoding schemes (like single qubit rotational gates to encode high dimensional data) often lead to information loss within the circuit, complex encoding schemes with entanglement and data re-uploading lead to an increase in the encoding gate count. This is not well-suited for NISQ devices. This work proposes ‘incremental data-uploading’, a novel encoding pattern for high dimensional data that tackles these challenges. We spread the encoding gates for the feature vector of a given data point throughout the quantum circuit with parameterized gates in between them. This encoding pattern results in a better representation of data in the quantum circuit with a minimal pre-processing requirement. We show the efficiency of our encoding pattern on a classification task using the MNIST and Fashion-MNIST datasets, and compare different encoding methods via classification accuracy and the effective dimension of the model.

arXiv:2205.03057•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•16 citations

Quantum aliasing: a negative influence of data scarcity on quantum machine learning

Shan Suthaharan

Quantum machine Learning (QML) is an emerging technique that leverages quantum theory and the yet-to-be fully developed quantum computers. QML may help solve classification problems that cannot be resolved by deep neural network (DNN). However, QML suffers from a quantum aliasing problem that is created by the inevitable downsampling and binarization operations. QML takes classical data domain as its input, transforms it into a domain of quantum states (a subset of the Hilbert space) using quantum encoding, generates quantum feature vectors, and builds a quantum circuit on the quantum feature vectors—as a machine learning model—to perform classification tasks. Hence, quantum encoding is an important task in QML. However, in addition to the quantum aliasing problem created by the downsampling and binarization operations in the quantum encoding of the classical data to quantum bits, the data scarcity can intensify this problem into an uncontrollable state. This problem has been rarely studied in the QML research literature. Therefore, it is important to study this problem in depth and develop a robust quantum encoding scheme that improves the performance of QML under the influence of data scarcity. In this work, the performance instability of QML under the severity of quantum aliasing and the influence of data scarcity (a combined effect of data and quantum paucity) has been studied by using the TensorFlow Quantum software framework and the MNIST handwritten digits dataset. A quantum encoding—by leveraging Fast Fourier Transform (FFT) and Blackman-Harris window—that encodes the data into qubits to reduce quantum aliasing has been proposed. An empirical study shows that QML significantly improves its learning behavior and performs better than DNN under data scarcity with the use of the proposed FFT-based quantum encoding.

SPIE Quantum Technologies•May 6, 2022•0 citations

Representing Data on a Quantum Computer

Maria Schuld, Francesco Petruccione

Quantum science and technology•Jan 1, 2021•8 citations

Quantum-parallel vectorized data encodings and computations on trapped-ions and transmons QPUs

J. T. Balewski, Mercy G. Amankwah, Roel Van Beeumen +3 more

Compact quantum data representations are essential to the emerging field of quantum algorithms for data analysis. We introduce two new data encoding schemes, QCrank and QBArt, which have a high degree of quantum parallelism through uniformly controlled rotation gates. QCrank encodes a sequence of real-valued data as rotations of the data qubits, allowing for high storage density. QBArt directly embeds a binary representation of the data in the computational basis, requiring fewer quantum measurements and lending itself to well-understood arithmetic operations on binary data. We present several applications of the proposed encodings for different types of data. We demonstrate quantum algorithms for DNA pattern matching, Hamming weight calculation, complex value conjugation, and retrieving an O(400) bits image, all executed on the Quantinuum QPU. Finally, we use various cloud-accessible QPUs, including IBMQ and IonQ, to perform additional benchmarking experiments.

arXiv:2301.07841•Jan 19, 2023•1 citation

Data Processing Based on Quantum Embeddings

Vladislav L. Litvinov, Felix V. Filippov, Ilya V. Tsyvarev

IEEE International Conference on Soft Computing and Measurements (SCM)•May 1, 2026•0 citations
The data representation in a machine-learning model strongly influences its performance. This becomes even more important for quantum machine learning models implemented on noisy intermediate scale quantum (NISQ) devices. Encoding high dimensional data into a quantum circuit for a NISQ device without any loss of information is not trivial and brings a lot of challenges. While simple encoding schemes (like single qubit rotational gates to encode high dimensional data) often lead to information loss within the circuit, complex encoding schemes with entanglement and data re-uploading lead to an increase in the encoding gate count. This is not well-suited for NISQ devices. This work proposes ‘incremental data-uploading’, a novel encoding pattern for high dimensional data that tackles these challenges. We spread the encoding gates for the feature vector of a given data point throughout the quantum circuit with parameterized gates in between them. This encoding pattern results in a better representation of data in the quantum circuit with a minimal pre-processing requirement. We show the efficiency of our encoding pattern on a classification task using the MNIST and Fashion-MNIST datasets, and compare different encoding methods via classification accuracy and the effective dimension of the model.
Quantum machine Learning (QML) is an emerging technique that leverages quantum theory and the yet-to-be fully developed quantum computers. QML may help solve classification problems that cannot be resolved by deep neural network (DNN). However, QML suffers from a quantum aliasing problem that is created by the inevitable downsampling and binarization operations. QML takes classical data domain as its input, transforms it into a domain of quantum states (a subset of the Hilbert space) using quantum encoding, generates quantum feature vectors, and builds a quantum circuit on the quantum feature vectors—as a machine learning model—to perform classification tasks. Hence, quantum encoding is an important task in QML. However, in addition to the quantum aliasing problem created by the downsampling and binarization operations in the quantum encoding of the classical data to quantum bits, the data scarcity can intensify this problem into an uncontrollable state. This problem has been rarely studied in the QML research literature. Therefore, it is important to study this problem in depth and develop a robust quantum encoding scheme that improves the performance of QML under the influence of data scarcity. In this work, the performance instability of QML under the severity of quantum aliasing and the influence of data scarcity (a combined effect of data and quantum paucity) has been studied by using the TensorFlow Quantum software framework and the MNIST handwritten digits dataset. A quantum encoding—by leveraging Fast Fourier Transform (FFT) and Blackman-Harris window—that encodes the data into qubits to reduce quantum aliasing has been proposed. An empirical study shows that QML significantly improves its learning behavior and performs better than DNN under data scarcity with the use of the proposed FFT-based quantum encoding.
Compact quantum data representations are essential to the emerging field of quantum algorithms for data analysis. We introduce two new data encoding schemes, QCrank and QBArt, which have a high degree of quantum parallelism through uniformly controlled rotation gates. QCrank encodes a sequence of real-valued data as rotations of the data qubits, allowing for high storage density. QBArt directly embeds a binary representation of the data in the computational basis, requiring fewer quantum measurements and lending itself to well-understood arithmetic operations on binary data. We present several applications of the proposed encodings for different types of data. We demonstrate quantum algorithms for DNA pattern matching, Hamming weight calculation, complex value conjugation, and retrieving an O(400) bits image, all executed on the Quantinuum QPU. Finally, we use various cloud-accessible QPUs, including IBMQ and IonQ, to perform additional benchmarking experiments.