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

arXiv:2602.23501

Machine learning of quantum data using optimal similarity measurements

Zhenghao Li, Hao Zhan, Shana H. Winston, Ewan Mer, Zhenghao Yin, Shang Yu, Yazeed K. Alwehaibi, Gerard J. Machado, Dayne Marcus Lopena, Lijian Zhang, M. S. Kim, Aonan Zhang, Ian A. Walmsley, Raj B. Patel

quant-phSubmitted Feb 26, 2026• Announced Mar 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum machine learning seeks a computational advantage in data processing by evaluating functions of quantum states, such as their similarity, that can be classically intractable to compute. For quantum advantage to be possible, however, it is essential to bypass costly characterisation of individual data instances in favour of efficient, direct similarity evaluation. Here we demonstrate a sample-optimal, hardware-efficient protocol for estimating quantum similarity -- the state overlap -- using bosonic quantum interference. The sample complexity of this approach is independent of the system dimension and is information-theoretically optimal up to a constant factor. Experimentally, we implement the scheme on \emph{Prakash-1}, a quantum computing platform based on a fully programmable integrated photonic processor. By preparing and interfering qudit states on the chip to directly extract their overlap, we demonstrate classification and online learning of quantum data with high accuracy in realistic noisy experiments. Our results establish joint overlap measurements as a scalable pathway to efficient quantum data analysis and a practical building block for network-integrated quantum machine learning.

Comments
32 pages, 10 figures, 1 table, including Supplementary Information

Related papers

Quantum-enhanced bosonic learning machine

Chi Huan Nguyen, Ko-Wei Tseng, Gleb Maslennikov +2 more

Quantum processors enable computational speedups for machine learning through parallel manipulation of high-dimensional vectors. Early demonstrations of quantum machine learning have focused on processing information with qubits. In such systems, a larger computational space is provided by the collective space of multiple physical qubits. Alternatively, we can encode and process information in the infinite-dimensional Hilbert space of bosonic systems such as quantum harmonic oscillators. This approach offers a hardware-efficient solution with potential quantum speedups to practical machine learning problems. Here we demonstrate a quantum-enhanced bosonic learning machine operating on quantum data with a system of trapped ions. Core elements of the learning processor are the universal feature-embedding circuit that encodes data into the motional states of ions, and the constant-depth circuit that estimates overlap between two quantum states. We implement the unsupervised K-means algorithm to recognize a pattern in a set of high-dimensional quantum states and use the discovered knowledge to classify unknown quantum states with the supervised k-NN algorithm. These results provide building blocks for exploring machine learning with bosonic processors.

arXiv:2104.04168•Apr 9, 2021•1 citation

Provably efficient experimental classification of quantum data with quantum kernels

Keitaro Anai, Akimoto Nakayama, Shintaro Ooka +9 more

Analyzing quantum systems is essential for quantum information processing, but can require exponentially many measurements without exploiting the structure of the system or task. Quantum machine learning offers a promising way to reduce this cost by learning from quantum data. Here, we theoretically establish a framework for efficient quantum-state classification and experimentally demonstrate the resulting scheme on a programmable photonic processor. Our analysis links learning efficiency to the structure of quantum data, without relying on a physical description tailored to each task. We derive sufficient conditions for accurate classification with a number of measurements polynomial in system size. We apply this guarantee to a resource problem in continuous-variable (CV) quantum computing: classifying stellar rank, a measure of non-Gaussianity. Experimentally, we implement the classification of single-mode CV quantum states with stellar rank zero and one. This is enabled by developing a programmable CV photonic processor capable of preparing and processing diverse Gaussian and non-Gaussian states and performing virtual projection onto such states, going beyond the Gaussian-only capabilities of most existing photonic platforms. The experiment demonstrates accurate classification despite experimental imperfections. Our results establish a theory-guided and experimentally validated framework for quantum-state classification that can be implemented on quantum devices available today.

quant-pharXiv:2610.39350•Oct 30, 2026•0 citations

A Hybrid Quantum Machine Learning Framework Based on Nyström Approximation for Scalability Enhancement of Quantum Kernels

Mohammad Hossein Rezvannia

Abstract Quantum Machine Learning (QML) is an emerging field at the intersection of quantum computing and artificial intelligence, offering high potential for extracting complex nonlinear patterns from high-dimensional data. However, many quantum kernel-based methods suffer from high computational costs, the requirement for numerous quantum circuit executions, and the limitations of current Noisy Intermediate-Scale Quantum (NISQ) hardware. These challenges, particularly when dealing with large datasets, represent a major barrier to the widespread adoption of these methods in practical applications. In this paper, a hybrid quantum machine learning framework based on Nyström approximation is proposed to effectively reduce the computational complexity of quantum kernels and enhance their scalability. In the proposed framework, classical data is first mapped to the quantum Hilbert space via parameterized quantum circuits, and the quantum kernel is defined based on the overlap of quantum states. Then, utilizing the Nyström approximation technique, the full kernel calculation is restricted to a representative subset of data, and the final learning process is conducted in the classical space. This approach reduces computational complexity from \(\:O\left({N}^{2}\right)\) to \(\:O\left(Nm\right)\), where N is the number of samples and m is the size of the selected subset. Analytical results and simulations on the Breast Cancer Wisconsin dataset demonstrate that the proposed framework reduces computational costs by over 60% while maintaining the geometric structure of the quantum feature space, with a classification accuracy loss of less than 3%. These results suggest that the proposed method can serve as a practical, scalable, and noise-resilient solution for applying quantum machine learning to real-world data-driven problems.

•Feb 18, 2026•0 citations

A Scalable Quantum Machine Learning Methodology Design for Handling Large-Scale Data Classification and Optimization Principle

M.S.Mohamed Mallick, D. David Neels Ponkumar, Sivaneasan Bala Krishnan +2 more

In this paper, a scalable Quantum Machine Learning (QML) algorithm is introduced to perform large-scale data classification and optimization with limited quantum resources. The method combines the amplitude-based encoding of quantum features with quantum circuits with parameters and hybrid optimization with RMSProp to lead to a high quality of accuracy and scalability in comparison with traditional machine learning models. The model has been run on 16-qubit NISQ processors with Qiskit and PennyLane frameworks and compared to the classical neural and kernel-based systems. Findings show that the suggested approach had a mean classification accuracy of 96.42 % better than classical models by an average of 5.2 % and with the same level of computation efficiency. The quantum kernel and entanglement optimization drastically enhanced high-dimensional similarity measurement and the noise mitigation strategies inherent in it also increased fidelity to 0.93. A test of the scalability of the system was a stable performance with sizes of up to 10,000 samples in datasets, with a sub-linear increase in time. These results confirm that quantum-enhanced architectures have the ability to learn complicated patterns and still be resource-efficient. The article forms a solid basis of the application of QML to other fields, including bioinformatics, finance, and IoT analytics where the dimensions of data and computation requirements are intensive.

International Conference on Science Technology Engineering and Mathematics (ICONSTEM)•Nov 6, 2025•0 citations

Quantum Machine Learning via Contrastive Training

Liudmila A. Zhukas, Vivian Ni Zhang, Qiang Miao +5 more

Quantum machine learning (QML) has attracted growing interest with the rapid parallel advances in large-scale classical machine learning and quantum technologies. Similar to classical machine learning, QML models also face challenges arising from the scarcity of labeled data, particularly as their scale and complexity increase. Here, we introduce self-supervised pretraining of quantum representations that reduces reliance on labeled data by learning invariances from unlabeled examples. We implement this paradigm on a programmable trapped-ion quantum computer, encoding images as quantum states. In situ contrastive pretraining on hardware yields a representation that, when fine-tuned, classifies image families with higher mean test accuracy and lower run-to-run variability than models trained from random initialization. Performance improvement is especially significant in regimes with limited labeled training data. We show that the learned invariances generalize beyond the pretraining image samples. Unlike prior work, our pipeline derives similarity from measured quantum overlaps and executes all training and classification stages on hardware. These results establish a label-efficient route to quantum representation learning, with direct relevance to quantum-native datasets and a clear path to larger classical inputs.

cs.LGCross-listedarXiv:2511.13497•Nov 18, 2025•0 citations

GBS-Assisted Quantum Unsupervised Machine Learning on a Universal Programmable Integrated Quantum Chip

Huihui Zhu, Wei Luo, Rudai Yan +11 more

Quantum machine learning stands poised as a forefront application for near-term quantum devices, addressing scalability challenges posed by classical computers in handling large datasets. Gaussian boson sampling (GBS), an intricate quantum algorithm deemed computationally infeasible for classical counterparts, represents a substantial leap forward in computational tasks. However, to date, the benefits of GBS-assisted quantum unsupervised machine learning are not experimentally demonstrated. Here, we present the first experimental implementation of quantum unsupervised machine learning using the GBS protocol with a universal programmable integrated photonic chip. The experimental system contains 16 squeezing sources, a universal programmable unitary matrix network of 16 modes, and a multi-channel single-photon detector, producing substantial output data crucial for 2 typical types of unsupervised tasks: feature extraction and generative network. Compared to classical approaches, the study demonstrates quantum-enhanced capability in extracting complex features from high-dimensional spaces and improved performance in generating arbitrary curve points and reconstructing handwritten digit images. This work not only underscores the potential of GBS in expressing high-dimensional features but also charts a path toward practical implementations within scalable, dimension-enhanced quantum unsupervised machine learning frameworks. The quantum unsupervised machine learning paradigm, offering theoretical acceleration and reduced training parameters for high-dimensional datasets, shows significant promise for advancing real-world applications of quantum technologies.

Research•Jan 1, 2025•2 citations
Quantum machine learning seeks a computational advantage in data processing by evaluating functions of quantum states, such as their similarity, that can be classically intractable to compute. For quantum advantage to be possible, however, it is essential to bypass costly characterisation of individual data instances in favour of efficient, direct similarity evaluation. Here we demonstrate a sample-optimal, hardware-efficient protocol for estimating quantum similarity -- the state overlap -- using bosonic quantum interference. The sample complexity of this approach is independent of the system dimension and is information-theoretically optimal up to a constant factor. Experimentally, we implement the scheme on \emph{Prakash-1}, a quantum computing platform based on a fully programmable integrated photonic processor. By preparing and interfering qudit states on the chip to directly extract their overlap, we demonstrate classification and online learning of quantum data with high accuracy in realistic noisy experiments. Our results establish joint overlap measurements as a scalable pathway to efficient quantum data analysis and a practical building block for network-integrated quantum machine learning.
Quantum processors enable computational speedups for machine learning through parallel manipulation of high-dimensional vectors. Early demonstrations of quantum machine learning have focused on processing information with qubits. In such systems, a larger computational space is provided by the collective space of multiple physical qubits. Alternatively, we can encode and process information in the infinite-dimensional Hilbert space of bosonic systems such as quantum harmonic oscillators. This approach offers a hardware-efficient solution with potential quantum speedups to practical machine learning problems. Here we demonstrate a quantum-enhanced bosonic learning machine operating on quantum data with a system of trapped ions. Core elements of the learning processor are the universal feature-embedding circuit that encodes data into the motional states of ions, and the constant-depth circuit that estimates overlap between two quantum states. We implement the unsupervised K-means algorithm to recognize a pattern in a set of high-dimensional quantum states and use the discovered knowledge to classify unknown quantum states with the supervised k-NN algorithm. These results provide building blocks for exploring machine learning with bosonic processors.
Analyzing quantum systems is essential for quantum information processing, but can require exponentially many measurements without exploiting the structure of the system or task. Quantum machine learning offers a promising way to reduce this cost by learning from quantum data. Here, we theoretically establish a framework for efficient quantum-state classification and experimentally demonstrate the resulting scheme on a programmable photonic processor. Our analysis links learning efficiency to the structure of quantum data, without relying on a physical description tailored to each task. We derive sufficient conditions for accurate classification with a number of measurements polynomial in system size. We apply this guarantee to a resource problem in continuous-variable (CV) quantum computing: classifying stellar rank, a measure of non-Gaussianity. Experimentally, we implement the classification of single-mode CV quantum states with stellar rank zero and one. This is enabled by developing a programmable CV photonic processor capable of preparing and processing diverse Gaussian and non-Gaussian states and performing virtual projection onto such states, going beyond the Gaussian-only capabilities of most existing photonic platforms. The experiment demonstrates accurate classification despite experimental imperfections. Our results establish a theory-guided and experimentally validated framework for quantum-state classification that can be implemented on quantum devices available today.
Abstract Quantum Machine Learning (QML) is an emerging field at the intersection of quantum computing and artificial intelligence, offering high potential for extracting complex nonlinear patterns from high-dimensional data. However, many quantum kernel-based methods suffer from high computational costs, the requirement for numerous quantum circuit executions, and the limitations of current Noisy Intermediate-Scale Quantum (NISQ) hardware. These challenges, particularly when dealing with large datasets, represent a major barrier to the widespread adoption of these methods in practical applications. In this paper, a hybrid quantum machine learning framework based on Nyström approximation is proposed to effectively reduce the computational complexity of quantum kernels and enhance their scalability. In the proposed framework, classical data is first mapped to the quantum Hilbert space via parameterized quantum circuits, and the quantum kernel is defined based on the overlap of quantum states. Then, utilizing the Nyström approximation technique, the full kernel calculation is restricted to a representative subset of data, and the final learning process is conducted in the classical space. This approach reduces computational complexity from  O(N2)\:O\left({N}^{2}\right)O(N2) to  O(Nm)\:O\left(Nm\right)O(Nm), where N is the number of samples and m is the size of the selected subset. Analytical results and simulations on the Breast Cancer Wisconsin dataset demonstrate that the proposed framework reduces computational costs by over 60% while maintaining the geometric structure of the quantum feature space, with a classification accuracy loss of less than 3%. These results suggest that the proposed method can serve as a practical, scalable, and noise-resilient solution for applying quantum machine learning to real-world data-driven problems.
In this paper, a scalable Quantum Machine Learning (QML) algorithm is introduced to perform large-scale data classification and optimization with limited quantum resources. The method combines the amplitude-based encoding of quantum features with quantum circuits with parameters and hybrid optimization with RMSProp to lead to a high quality of accuracy and scalability in comparison with traditional machine learning models. The model has been run on 16-qubit NISQ processors with Qiskit and PennyLane frameworks and compared to the classical neural and kernel-based systems. Findings show that the suggested approach had a mean classification accuracy of 96.42 % better than classical models by an average of 5.2 % and with the same level of computation efficiency. The quantum kernel and entanglement optimization drastically enhanced high-dimensional similarity measurement and the noise mitigation strategies inherent in it also increased fidelity to 0.93. A test of the scalability of the system was a stable performance with sizes of up to 10,000 samples in datasets, with a sub-linear increase in time. These results confirm that quantum-enhanced architectures have the ability to learn complicated patterns and still be resource-efficient. The article forms a solid basis of the application of QML to other fields, including bioinformatics, finance, and IoT analytics where the dimensions of data and computation requirements are intensive.
Quantum machine learning (QML) has attracted growing interest with the rapid parallel advances in large-scale classical machine learning and quantum technologies. Similar to classical machine learning, QML models also face challenges arising from the scarcity of labeled data, particularly as their scale and complexity increase. Here, we introduce self-supervised pretraining of quantum representations that reduces reliance on labeled data by learning invariances from unlabeled examples. We implement this paradigm on a programmable trapped-ion quantum computer, encoding images as quantum states. In situ contrastive pretraining on hardware yields a representation that, when fine-tuned, classifies image families with higher mean test accuracy and lower run-to-run variability than models trained from random initialization. Performance improvement is especially significant in regimes with limited labeled training data. We show that the learned invariances generalize beyond the pretraining image samples. Unlike prior work, our pipeline derives similarity from measured quantum overlaps and executes all training and classification stages on hardware. These results establish a label-efficient route to quantum representation learning, with direct relevance to quantum-native datasets and a clear path to larger classical inputs.
Quantum machine learning stands poised as a forefront application for near-term quantum devices, addressing scalability challenges posed by classical computers in handling large datasets. Gaussian boson sampling (GBS), an intricate quantum algorithm deemed computationally infeasible for classical counterparts, represents a substantial leap forward in computational tasks. However, to date, the benefits of GBS-assisted quantum unsupervised machine learning are not experimentally demonstrated. Here, we present the first experimental implementation of quantum unsupervised machine learning using the GBS protocol with a universal programmable integrated photonic chip. The experimental system contains 16 squeezing sources, a universal programmable unitary matrix network of 16 modes, and a multi-channel single-photon detector, producing substantial output data crucial for 2 typical types of unsupervised tasks: feature extraction and generative network. Compared to classical approaches, the study demonstrates quantum-enhanced capability in extracting complex features from high-dimensional spaces and improved performance in generating arbitrary curve points and reconstructing handwritten digit images. This work not only underscores the potential of GBS in expressing high-dimensional features but also charts a path toward practical implementations within scalable, dimension-enhanced quantum unsupervised machine learning frameworks. The quantum unsupervised machine learning paradigm, offering theoretical acceleration and reduced training parameters for high-dimensional datasets, shows significant promise for advancing real-world applications of quantum technologies.