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:2105.14434

Provable superior accuracy in machine learned quantum models

Chengran Yang, Andrew J. P. Garner, Feiyang Liu, Nora Tischler, Jayne E. Thompson, Man‐Hong Yung, Mile Gu, Oscar Dahlsten

Published May 30, 2021• 6 citations
arXivHTMLPDF

Abstract

In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the future. There is thus enormous interest in dimensional reduction-finding automated means to reduce the memory dimension of our models while minimizing its impact on its predictive accuracy. Here we construct dimensionally reduced quantum models by machine learning methods that can achieve greater accuracy than provably optimal classical counterparts. We demonstrate this advantage on present-day quantum computing hardware. Our algorithm works directly off classical time-series data and can thus be deployed in real-world settings. These techniques illustrate the immediate relevance of quantum technologies to time-series analysis and offer a rare instance where the resulting quantum advantage can be provably established.

DOI
10.48550/arxiv.2105.14434

Related papers

Provably superior accuracy in quantum stochastic modeling

Chengran Yang, Andrew J. P. Garner, Feiyang Liu +5 more

In the design of stochastic models, there is a constant trade-off between model complexity and accuracy. Here we prove that quantum models enable a more favorable trade-off. We present a technique for identifying fundamental upper bounds on the predictive accuracy of dimensionality-constrained classical models. We identify quantum models that surpass this bound by creating an algorithm that learns quantum models given time-series data. We demonstrate that this quantum accuracy advantage is attainable in a present-day noisy quantum device. These results illustrate the immediate relevance of quantum technologies to time-series analysis and offer an instance where their resulting accuracy advantage can be provably established.

Physical Review A•Aug 10, 2023•3 citations

Extreme Dimensionality Reduction with Quantum Modeling

Thomas J. Elliott, Chengran Yang, Felix C. Binder +3 more

Effective and efficient forecasting relies on identification of the relevant information contained in past observations-the predictive features-and isolating it from the rest. When the future of a process bears a strong dependence on its behavior far into the past, there are many such features to store, necessitating complex models with extensive memories. Here, we highlight a family of stochastic processes whose minimal classical models must devote unboundedly many bits to tracking the past. For this family, we identify quantum models of equal accuracy that can store all relevant information within a single two-dimensional quantum system (qubit). This represents the ultimate limit of quantum compression and highlights an immense practical advantage of quantum technologies for the forecasting and simulation of complex systems.

arXiv:1909.02817•Physical Review Letters•Dec 22, 2020•42 citations

A Comparative Study: Predicting Time Series Data with Quantum and Classical Machine Learning

Anirudh Sharma, Rahul Mandrai

This research project embarks on a comprehensive comparative analysis of classical and quantum machine learning models specifically tailored for time series forecasting. By employing a range of classical machine learning models alongside quantum machine learning models, the study aims to predict future data points with heightened accuracy and efficiency. Leveraging AWS Braket, the project facilitates the deployment of quantum models on both quantum simulators and quantum hardware devices, providing a robust platform for empirical evaluation. The goal is to meticulously assess the performance metrics, computational efficiency, and predictive accuracy of these models. Ultimately, the research aspires to enhance the understanding and practical application of quantum machine learning techniques in the realm of time series forecasting, potentially uncovering new paradigms in predictive analytics. Our research indicates that the performance metrics for classical machine learning models yielded superior results compared to those of quantum machine learning models for our use case, although when ensembled with classical models, we get better results.

International Conference on Electrical and Computer Engineering Researches (ICECER)•Dec 4, 2024•0 citations

Exponential quantum advantage in processing massive classical data

Haimeng Zhao, Alexander Zlokapa, Hartmut Neven +4 more

Broadly applicable quantum advantage, particularly in classical data processing and machine learning, has been a fundamental open problem. In this work, we prove that a small quantum computer of polylogarithmic size can perform large-scale classification and dimension reduction on massive classical data by processing samples on the fly, whereas any classical machine achieving the same prediction performance requires exponentially larger size. Furthermore, classical machines that are exponentially larger yet below the required size need superpolynomially more samples and time. We provide evidence for these quantum advantages in real-world applications, including single-cell RNA sequencing and movie review sentiment analysis, demonstrating four to six orders of magnitude reduction in size with fewer than 60 logical qubits. These quantum advantages are enabled by quantum oracle sketching, an algorithm for accessing the classical world in quantum superposition using only random classical data samples. Combined with classical shadows, our algorithm circumvents the data loading and readout bottleneck to construct succinct classical models from massive classical data, a task provably impossible for any classical machine that is not exponentially larger than the quantum machine. These quantum advantages persist even when classical machines are granted unlimited time or if BPP = BQP, and rely only on the correctness of quantum mechanics. Together, our results establish machine learning on classical data as a broad and natural domain of quantum advantage and a fundamental test of quantum mechanics at the complexity frontier.

quant-pharXiv:2604.07639•Apr 10, 2026•0 citations

Quantum-Based Feature Selection and Dimensionality Reduction

Jincheng Zhang

This paper explores the application of quantum computing to the critical tasks of feature selection and dimensionality reduction within machine learning. Traditional methods often struggle with high-dimensional data, leading to computational bottlenecks and potentially reduced model accuracy. We propose a novel approach leveraging the principles of quantum error correction and quantum entanglement to construct an algorithm capable of efficiently identifying and reducing the most relevant features. The core mechanism utilizes quantum machine learning techniques, specifically quantum feature mapping and feature extraction, to transform data into a quantum state that inherently captures feature relationships. This allows for a more effective selection process based on quantum interference and the exploration of complex correlations. We demonstrate, theoretically, the potential advantages of this approach over classical methods, highlighting improvements in both efficiency and predictive accuracy. The algorithm's design incorporates error correction to mitigate the effects of noise inherent in quantum systems, further enhancing its robustness. The research contributes to the growing field of quantum machine learning, offering a new paradigm for tackling complex data challenges.

•Sep 5, 2026•0 citations

A comparative analysis of classical machine learning models with quantum-inspired models for predicting world surface temperature

Trilok Nath Pandey, Vishvajeet Ravalekar, Sidharth D. Nair +1 more

This research paper delves into the realm of quantum machine learning (QML) by conducting a comprehensive study on time-series data. The primary objective is to compare the results and time complexity of classical machine learning algorithms on traditional hardware to their quantum counterparts on quantum computers. As the amount and complexity of time-series data in numerous fields continues to expand, the investigation of advanced computational models becomes critical for efficient analysis and prediction. We employ a time-series dataset that include temperature records from different nations throughout the world spanning the previous half of the century. The study compares the performance of classical machine learning algorithms to quantum algorithms, which use the concepts of superposition and entanglement to handle subtle temporal patterns in time-series data. This study attempts to reveal the different benefits and drawbacks of quantum machine learning in the time-series domain through rigorous empirical analysis. The findings of this study not only help to comprehend the applicability of quantum algorithms in real-world contexts, but they also open the way for future advances in utilizing quantum computing for increased time-series analysis and prediction. This study's findings could have ramifications in industries ranging from finance to healthcare, where precise forecasting using time-series data is critical for informed decision-making.

Scientific Reports•Aug 4, 2025•11 citations
In modelling complex processes, the potential past data that influence future expectations are immense. Models that track all this data are not only computationally wasteful but also shed little light on what past data most influence the future. There is thus enormous interest in dimensional reduction-finding automated means to reduce the memory dimension of our models while minimizing its impact on its predictive accuracy. Here we construct dimensionally reduced quantum models by machine learning methods that can achieve greater accuracy than provably optimal classical counterparts. We demonstrate this advantage on present-day quantum computing hardware. Our algorithm works directly off classical time-series data and can thus be deployed in real-world settings. These techniques illustrate the immediate relevance of quantum technologies to time-series analysis and offer a rare instance where the resulting quantum advantage can be provably established.
In the design of stochastic models, there is a constant trade-off between model complexity and accuracy. Here we prove that quantum models enable a more favorable trade-off. We present a technique for identifying fundamental upper bounds on the predictive accuracy of dimensionality-constrained classical models. We identify quantum models that surpass this bound by creating an algorithm that learns quantum models given time-series data. We demonstrate that this quantum accuracy advantage is attainable in a present-day noisy quantum device. These results illustrate the immediate relevance of quantum technologies to time-series analysis and offer an instance where their resulting accuracy advantage can be provably established.
Effective and efficient forecasting relies on identification of the relevant information contained in past observations-the predictive features-and isolating it from the rest. When the future of a process bears a strong dependence on its behavior far into the past, there are many such features to store, necessitating complex models with extensive memories. Here, we highlight a family of stochastic processes whose minimal classical models must devote unboundedly many bits to tracking the past. For this family, we identify quantum models of equal accuracy that can store all relevant information within a single two-dimensional quantum system (qubit). This represents the ultimate limit of quantum compression and highlights an immense practical advantage of quantum technologies for the forecasting and simulation of complex systems.
This research project embarks on a comprehensive comparative analysis of classical and quantum machine learning models specifically tailored for time series forecasting. By employing a range of classical machine learning models alongside quantum machine learning models, the study aims to predict future data points with heightened accuracy and efficiency. Leveraging AWS Braket, the project facilitates the deployment of quantum models on both quantum simulators and quantum hardware devices, providing a robust platform for empirical evaluation. The goal is to meticulously assess the performance metrics, computational efficiency, and predictive accuracy of these models. Ultimately, the research aspires to enhance the understanding and practical application of quantum machine learning techniques in the realm of time series forecasting, potentially uncovering new paradigms in predictive analytics. Our research indicates that the performance metrics for classical machine learning models yielded superior results compared to those of quantum machine learning models for our use case, although when ensembled with classical models, we get better results.
Broadly applicable quantum advantage, particularly in classical data processing and machine learning, has been a fundamental open problem. In this work, we prove that a small quantum computer of polylogarithmic size can perform large-scale classification and dimension reduction on massive classical data by processing samples on the fly, whereas any classical machine achieving the same prediction performance requires exponentially larger size. Furthermore, classical machines that are exponentially larger yet below the required size need superpolynomially more samples and time. We provide evidence for these quantum advantages in real-world applications, including single-cell RNA sequencing and movie review sentiment analysis, demonstrating four to six orders of magnitude reduction in size with fewer than 60 logical qubits. These quantum advantages are enabled by quantum oracle sketching, an algorithm for accessing the classical world in quantum superposition using only random classical data samples. Combined with classical shadows, our algorithm circumvents the data loading and readout bottleneck to construct succinct classical models from massive classical data, a task provably impossible for any classical machine that is not exponentially larger than the quantum machine. These quantum advantages persist even when classical machines are granted unlimited time or if BPP = BQP, and rely only on the correctness of quantum mechanics. Together, our results establish machine learning on classical data as a broad and natural domain of quantum advantage and a fundamental test of quantum mechanics at the complexity frontier.
This paper explores the application of quantum computing to the critical tasks of feature selection and dimensionality reduction within machine learning. Traditional methods often struggle with high-dimensional data, leading to computational bottlenecks and potentially reduced model accuracy. We propose a novel approach leveraging the principles of quantum error correction and quantum entanglement to construct an algorithm capable of efficiently identifying and reducing the most relevant features. The core mechanism utilizes quantum machine learning techniques, specifically quantum feature mapping and feature extraction, to transform data into a quantum state that inherently captures feature relationships. This allows for a more effective selection process based on quantum interference and the exploration of complex correlations. We demonstrate, theoretically, the potential advantages of this approach over classical methods, highlighting improvements in both efficiency and predictive accuracy. The algorithm's design incorporates error correction to mitigate the effects of noise inherent in quantum systems, further enhancing its robustness. The research contributes to the growing field of quantum machine learning, offering a new paradigm for tackling complex data challenges.
This research paper delves into the realm of quantum machine learning (QML) by conducting a comprehensive study on time-series data. The primary objective is to compare the results and time complexity of classical machine learning algorithms on traditional hardware to their quantum counterparts on quantum computers. As the amount and complexity of time-series data in numerous fields continues to expand, the investigation of advanced computational models becomes critical for efficient analysis and prediction. We employ a time-series dataset that include temperature records from different nations throughout the world spanning the previous half of the century. The study compares the performance of classical machine learning algorithms to quantum algorithms, which use the concepts of superposition and entanglement to handle subtle temporal patterns in time-series data. This study attempts to reveal the different benefits and drawbacks of quantum machine learning in the time-series domain through rigorous empirical analysis. The findings of this study not only help to comprehend the applicability of quantum algorithms in real-world contexts, but they also open the way for future advances in utilizing quantum computing for increased time-series analysis and prediction. This study's findings could have ramifications in industries ranging from finance to healthcare, where precise forecasting using time-series data is critical for informed decision-making.