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• 3 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•5 citations

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

Parallel data processing in quantum machine learning

Sina Asadiyan Zargar, Mehdi Ramezani, Abolfazl Bahrampour +2 more

We propose a Quantum Machine Learning (QML) framework that applies the core design principle of quantum algorithms–superposition, oracle, and interference–to accelerate training. Building on the structural analogy between feature extraction in foundational quantum algorithms and parameter optimization in QML, we reformulate the training process to leverage quantum parallelism: all training samples are encoded into a quantum superposition, processed through a parameterized quantum circuit, and classified via an interferometer module that implements quantum interference across the dataset. This architectural reformulation reduces the theoretical complexity of loss function evaluation from \(O(N^{2})\) in conventional QML training to O ( N ), where N is the dataset size. Numerical simulations on multiple binary and multi-class classification datasets (with up to \(N=128\) samples) demonstrate that our method achieves classification accuracies comparable to conventional circuits while reducing the number of quantum circuit executions per cost function evaluation from N to 1. This represents a near N -fold reduction in quantum overhead per training iteration, reducing the required circuit executions without loss of accuracy. These results highlight the potential of quantum algorithmic design principles as a scalable pathway to efficient QML implementations.

arXiv:2508.12006•Scientific Reports•Aug 19, 2026•2 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 with Adaptive Boson Sampling via post-selection

Francesco Hoch, Eugenio Caruccio, Giovanni Rodari +18 more

The implementation of large-scale universal quantum computation represents a challenging and ambitious task on the road to quantum processing of information. In recent years, an intermediate approach has been pursued to demonstrate quantum computational advantage via non-universal computational models. A relevant example for photonic platforms has been provided by the Boson Sampling paradigm and its variants, which are known to be computationally hard while requiring at the same time only the manipulation of the generated photonic resources via linear optics and detection. Beside quantum computational advantage demonstrations, a promising direction towards possibly useful applications can be found in the field of quantum machine learning, considering the currently almost unexplored intermediate scenario between non-adaptive linear optics and universal photonic quantum computation. Here, we report the experimental implementation of quantum machine learning protocols by adding adaptivity via post-selection to a Boson Sampling platform based on universal programmable photonic circuits fabricated via femtosecond laser writing. Our experimental results demonstrate that Adaptive Boson Sampling is a viable route towards dimension-enhanced quantum machine learning with linear optical devices. Extending quantum photonics’ capabilities from simple linear-optics-based schemes to universal quantum computing presents several challenges, but intermediate regimes with some degree of adaptivity might already bring practical advantages. Here, the authors experimentally emulate an adaptive Boson Sampling scheme using post-selection, and apply it to a data classification task.

arXiv:2502.20305•Nature Communications•Jan 21, 2025•46 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.
We propose a Quantum Machine Learning (QML) framework that applies the core design principle of quantum algorithms–superposition, oracle, and interference–to accelerate training. Building on the structural analogy between feature extraction in foundational quantum algorithms and parameter optimization in QML, we reformulate the training process to leverage quantum parallelism: all training samples are encoded into a quantum superposition, processed through a parameterized quantum circuit, and classified via an interferometer module that implements quantum interference across the dataset. This architectural reformulation reduces the theoretical complexity of loss function evaluation from O(N2)O(N^{2})O(N2) in conventional QML training to O ( N ), where N is the dataset size. Numerical simulations on multiple binary and multi-class classification datasets (with up to N=128N=128N=128 samples) demonstrate that our method achieves classification accuracies comparable to conventional circuits while reducing the number of quantum circuit executions per cost function evaluation from N to 1. This represents a near N -fold reduction in quantum overhead per training iteration, reducing the required circuit executions without loss of accuracy. These results highlight the potential of quantum algorithmic design principles as a scalable pathway to efficient QML implementations.
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.
The implementation of large-scale universal quantum computation represents a challenging and ambitious task on the road to quantum processing of information. In recent years, an intermediate approach has been pursued to demonstrate quantum computational advantage via non-universal computational models. A relevant example for photonic platforms has been provided by the Boson Sampling paradigm and its variants, which are known to be computationally hard while requiring at the same time only the manipulation of the generated photonic resources via linear optics and detection. Beside quantum computational advantage demonstrations, a promising direction towards possibly useful applications can be found in the field of quantum machine learning, considering the currently almost unexplored intermediate scenario between non-adaptive linear optics and universal photonic quantum computation. Here, we report the experimental implementation of quantum machine learning protocols by adding adaptivity via post-selection to a Boson Sampling platform based on universal programmable photonic circuits fabricated via femtosecond laser writing. Our experimental results demonstrate that Adaptive Boson Sampling is a viable route towards dimension-enhanced quantum machine learning with linear optical devices. Extending quantum photonics’ capabilities from simple linear-optics-based schemes to universal quantum computing presents several challenges, but intermediate regimes with some degree of adaptivity might already bring practical advantages. Here, the authors experimentally emulate an adaptive Boson Sampling scheme using post-selection, and apply it to a data classification task.