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:2501.10414 · Kuantum teknolojileri ve enformatik araştırmaları dergisi.

Quantum-Enhanced Conformal Methods for Multi-Output Uncertainty: A Holistic Exploration and Experimental Analysis

Davut Emre Tasar

Published Apr 5, 2025• 5 citations
arXivHTMLPDF

Abstract

Quantum computing introduces unique forms of randomness arising from measurement processes, gate noise, and hardware imperfections. Ensuring reliable uncertainty quantifi- cation in such quantum-driven or quantum-derived predictions is an emerging challenge. In classical machine learning, conformal prediction has proven to be a robust frame- work for distribution-free uncertainty calibration, often focusing on univariate or low- dimensional outputs. Recent advances have extended conformal methods to handle multi-output or multi-dimensional responses, addressing sophisticated tasks such as time-series, image classification sets, and quantum-generated probability distributions. However, bridging the gap between these powerful conformal frameworks and the high- dimensional, noise-prone distributions typical of quantum measurement scenarios remains largely open. In this paper, we propose a unified approach to harness quantum conformal methods for multi-output distributions, with a particular emphasis on two experimental paradigms: (i) a standard 2-qubit circuit scenario producing a four-dimensional outcome distribution, and (ii) a multi-basis measurement setting that concatenates measurement probabilities in different bases (Z, X, Y) into a twelve-dimensional output space. By combining a multi- output regression model (e.g., random forests) with distributional conformal prediction, we validate coverage and interval-set sizes on both simulated quantum data and multi-basis measurement data. Our results confirm that classical conformal prediction can effectively provide coverage guarantees even when the target probabilities derive from inherently quantum processes. Such synergy opens the door to next-generation quantum-classical hybrid frameworks, providing both improved interpretability and rigorous coverage for quantum machine learning tasks. All codes and full reproducible Colab notebooks are made available at https://github.com/detasar/QECMMOU.

DOI
10.70447/ktve.2702

Related papers

Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning

Sangwoo Park, Osvaldo Simeone

Quantum machine learning is a promising programming paradigm for the optimization of quantum algorithms in the current era of noisy intermediate scale quantum (NISQ) computers. A fundamental challenge in quantum machine learning is generalization, as the designer targets performance under testing conditions, while having access only to limited training data. Existing generalization analyses, while identifying important general trends and scaling laws, cannot be used to assign reliable and informative “error bars” to the decisions made by quantum models. In this article, we propose a general methodology that can reliably quantify the uncertainty of quantum models, irrespective of the amount of training data, of the number of shots, of the ansatz, of the training algorithm, and of the presence of quantum hardware noise. The approach, which builds on probabilistic conformal prediction, turns an arbitrary, possibly small, number of shots from a pre-trained quantum model into a set prediction, e.g., an interval, thatprovablycontains the true target with any desired coverage level. Experimental results confirm the theoretical calibration guarantees of the proposed framework, referred to asquantum conformal prediction.

arXiv:2304.03398•IEEE Transactions on Quantum Engineering•Nov 17, 2023•27 citations

Uncertainty-Calibrated Quantum Neural Networks via Bayesian Variational Circuits and Conformal Prediction

Bryan Daniel Angelino

Reliable decision-making with quantum neural networks on NISQ hardware requires uncertainty estimates that remain meaningful under finite-shot measurement noise and distribution shift. This study introduces an end-to-end pipeline that combines Bayesian variational quantum circuits with post hoc probability calibration and conformal prediction to produce coverage-controlled prediction sets. Across shot budgets from 128 to 4096 shots, the Bayesian variational circuit improves accuracy from 0.828 to 0.839 at 128 shots and from 0.862 to 0.892 at 4096 shots, while reducing negative log-likelihood from 0.462 to 0.448 at 128 shots and from 0.392 to 0.357 at 4096 shots. Calibration preserves accuracy while further lowering negative log-likelihood to 0.432 at 128 shots and 0.350 at 4096 shots, and reduces expected calibration error from 0.058 to 0.027. Conformalization achieves empirical coverage of 0.952 at miscoverage 0.05, with average set size 1.39 and singleton rate 0.71, and maintains coverage between 0.944 and 0.948 under feature corruption and subpopulation shift, where deterministic accuracy degrades to 0.801 and 0.774, respectively, while the Bayesian model retains 0.842 and 0.816. Ablations identify an operational knee at circuit depth 8, and show diminishing returns beyond 8 posterior samples per prediction, supporting deployment-efficient uncertainty control for quantum learning.

Journal of Quantum Artificial Intelligence•Aug 31, 2026•0 citations

Quantum Circuit-Based Learning Models: Bridging Quantum Computing and Machine Learning

Fan Fan, Yilei Shi, Mihai Datcu +5 more

Machine Learning (ML) has been widely applied across numerous domains due to its ability to automatically identify informative patterns from data for various tasks. The availability of large-scale data and advanced computational power enables the development of sophisticated models and training strategies, leading to state-of-the-art performance, but it also introduces substantial challenges. Quantum Computing (QC), which exploits quantum mechanisms for computation, has attracted growing attention and significant global investment as it may address these challenges. Consequently, Quantum Machine Learning (QML), the integration of these two fields, has received increasing interest, with a notable rise in related studies in recent years. We are motivated to review these existing contributions regarding quantum circuit-based learning models for classical data analysis and highlight the identified potentials and challenges of this technique. Specifically, we focus not only on QML models, both kernel-based and neural network-based, but also on recent explorations of their integration with classical machine learning layers within hybrid frameworks. Moreover, we examine both theoretical analysis and empirical findings to better understand their capabilities, and we also discuss the efforts on noise-resilient and hardware-efficient QML that could enhance its practicality under current hardware limitations. In addition, we cover several emerging paradigms for advanced quantum circuit design and highlight the adaptability of QML across representative application domains. This study aims to provide an overview of the contributions made to bridge quantum computing and machine learning, offering insights and guidance to support its future development and pave the way for broader adoption in the coming years.

quant-pharXiv:2602.00048•Artificial Intelligence Review•Jan 20, 2026•2 citations

Innovative Techniques using Quantum Computing: Improve Pattern Recognition in Multi-Dimensional Machine Learning Complications

V.S. Prakash, Hebatullah Awwad, J. Refonaa +3 more

This phenomenon is due to the development of complex high-dimensional datasets within machine learning that may not be effectively processed, identified or classified by classical computers. Multi-dimensional data are increasingly common in a wide range of scientific disciplines including genomics, finance modeling, computer vision, climate prediction et al, and standard approaches to analysis have begun to falter in the face of the curse of dimensionality, computational efficiency, and reduced interpretability. Quantum computing, in this context, is a disruptive paradigm that can bring about a substantial overhaul to machines ability to learn. In this work, we investigate a family of new quantumenhanced protocols specially designed for enhancing pattern recognition in multi-dimensional machine learning problems. We demonstrate a hybrid quantum-classical scheme, combining quantum state representation, quantum feature encoding and quantum kernel estimation to make complex data transformations in a time that scales only with the squareroot of the data size. Important techniques are the use of variational quantum circuits, quantum principal component analysis (qPCA), and quantum support vector machines (QSVMs) to uncover the structure of non-linear and highdimensional features spaces that would have been hidden otherwise. We benchmark these quantum models against classical deep learning models on three datasets: healthcare diagnostics, image classification, and sensor-based time series prediction. Experiments demonstrate that quantum-enhanced models not only accelerate the training process and save the memory space but also achieve better generalization on identifying shape features and abstract patterns. By entanglement and quantum parallelism, we can encode and process information of a multi-dimensional input at the same time and provide a compact and informative representation. In addition to that, quantum circuits show a good potential to deal with noisy and overfitting when dealing with sparsed and imbalanced data. This work demonstrates the quantumcomputational power for pattern recognition, and paves the way for scalable, efficient, and interpretable quantum machine learning. Through connecting quantum algorithms to practical machine learning problems, the work paves the way for applications of quantum computing in challenging highdimensional data analysis problems and in a new territory of research interests at the intersection of quantum information and artificial intelligence.

International Conference on Natural Language Processing and Computer Vision (ICNPCV)•Jul 1, 2026•0 citations

Uncertainty Quantification for Quantum Fidelity Estimation

Kuchibhotla Aditi, Stephen Becker

Quantum fidelity estimation is a fundamental task in quantum information and computing to benchmark the quality of quantum states, and hence of quantum processes, on noisy quantum hardware. Point estimates of fidelity by existing methods generally lack the rigorous uncertainty quantification required for reliable preparation and verification of these tasks. While Bayesian and bootstrap frameworks are widely used for uncertainty quantification, they are sensitive to model misspecification or lack formal coverage guarantees in non-asymptotic regimes. This paper introduces a hybrid "Bayesian-informed" conformal prediction-based framework to provide distribution-free, rigorous prediction intervals for quantum state fidelity estimation which can be used, with care, to approximate confidence intervals with respect to the quantum randomness of Born's rule. The framework requires a point estimator, and we consider both classical point estimators as well as data-driven neural net estimators. We evaluate the robustness of the methodology across a diverse range of experimental challenges, including finite-sample noise, tomographic incompleteness, physical model error, and out-of-distribution data. Our results demonstrate that conformalized estimators maintain statistical validity where traditional methods fail, offering a scalable and reliable approach for the verification of modern quantum systems. The best performing variant of our methodology is based on a class-conditional conformal prediction, as this most closely approximates the conditional coverage desired for a true confidence interval.

quant-pharXiv:2610.10885•Oct 9, 2026•1 citation

Quantum Machine Learning: Diverse Perspectives on Application Scenarios

XU, Yangjie

In recent years, quantum computing, as a potential way to break the bottleneck of Moore's Law, has gradually shown its unique advantages in the field of machine learning. Not only can it bring exponential or polynomial acceleration in some specific tasks, it also provides entirely new ways of representing and processing information. Focusing on the core theme of application and method innovation of quantum machine learning in structured data, this thesis systematically studies the theoretical models and practical applications of quantum computing in many sub-fields such as agricultural remote sensing, graph neural networks, and hyperdimensional computing, and explores the adaptability, scalability, and effectiveness of quantum models in real-world tasks. Firstly, in the cropland classification and yield prediction task, this study identifies that traditional neural networks tend to underperform when facing imbalanced and small-sample remote sensing data, often misclassifying minority crop types. To address this, we propose a quantum-classical hybrid recognition framework that integrates quantum feature mapping with classical neural networks. After incorporating quantum feature encoding, we observe a significant improvement in classification performance, especially in cases involving subtle field boundaries and heterogeneous textures. The quantum-enhanced model demonstrates superior accuracy, robustness, and generalization compared to its classical counterpart, validating the advantage of leveraging quantum representations in real-world agricultural datasets. The second part focuses on the learning of graph structure data and proposes to embed the Continuous Time Quantum Walk (CTQW) into the Graph Neural Network (GNN) architecture. This method not only preserves the global interference characteristic of quantum states but also realizes the efficient modeling of graph topology through the spectral graph methods. Experiments show that the proposed method is superior to many classical graph learning models in tasks such as node classification and graph structure inference. The third and fourth components of this thesis collectively explore quantum approaches to hyperdimensional computing (HDC), establishing a progressive transition from native quantum-state-based implementation to quantum-enhanced HDC strategies. Initially, we investigate the intrinsic mathematical correspondence between quantum states and high-dimensional hypervectors, and propose a novel quantum-state-based high-dimensional encoding method. This method is realized through quantum circuits capable of generating hypervectors with controllable entropy, thereby implementing essential HDC operations, such as classification and memory reconstruction, on real quantum hardware. This marks the first successful migration of core HDC mechanisms into a fully quantum-native framework. Building upon this foundation, we further propose the first quantum-enhanced HDC strategy, which does not rely solely on quantum-native implementations but rather utilizes key quantum features to boost the efficiency and expressivity of conventional HDC systems. Specifically, we introduce mechanisms such as quantum-reference-state-based binding, using density matrices to represent superclass states, and quantum state tomography for robust feature extraction. These innovations significantly enhance the resilience and performance of HDC under high-noise and high-dimensional sensing environments. The resulting models achieve superior accuracy and robustness across a variety of multi-class classification tasks, demonstrating the practical benefits of integrating quantum computation into the broader HDC paradigm. In this thesis, experimental validation is carried out in multiple real and simulation environments, including Qiskit and Paddle Quantum platforms, and a complete closed loop was achieved from theoretical derivation, quantum circuit design to end-to-end experimental evaluation. The results show that quantum methods can expand the expressive power of classical models and become an important tool to deal with large-scale, structured data problems in the future. The work in this thesis provides methodological support for quantum machine learning from theory to application, and also expands the research boundaries of high-dimensional computation and graph learning in the quantum background.

•Jul 8, 2025•0 citations
Quantum computing introduces unique forms of randomness arising from measurement processes, gate noise, and hardware imperfections. Ensuring reliable uncertainty quantifi- cation in such quantum-driven or quantum-derived predictions is an emerging challenge. In classical machine learning, conformal prediction has proven to be a robust frame- work for distribution-free uncertainty calibration, often focusing on univariate or low- dimensional outputs. Recent advances have extended conformal methods to handle multi-output or multi-dimensional responses, addressing sophisticated tasks such as time-series, image classification sets, and quantum-generated probability distributions. However, bridging the gap between these powerful conformal frameworks and the high- dimensional, noise-prone distributions typical of quantum measurement scenarios remains largely open. In this paper, we propose a unified approach to harness quantum conformal methods for multi-output distributions, with a particular emphasis on two experimental paradigms: (i) a standard 2-qubit circuit scenario producing a four-dimensional outcome distribution, and (ii) a multi-basis measurement setting that concatenates measurement probabilities in different bases (Z, X, Y) into a twelve-dimensional output space. By combining a multi- output regression model (e.g., random forests) with distributional conformal prediction, we validate coverage and interval-set sizes on both simulated quantum data and multi-basis measurement data. Our results confirm that classical conformal prediction can effectively provide coverage guarantees even when the target probabilities derive from inherently quantum processes. Such synergy opens the door to next-generation quantum-classical hybrid frameworks, providing both improved interpretability and rigorous coverage for quantum machine learning tasks. All codes and full reproducible Colab notebooks are made available at https://github.com/detasar/QECMMOU.
Quantum machine learning is a promising programming paradigm for the optimization of quantum algorithms in the current era of noisy intermediate scale quantum (NISQ) computers. A fundamental challenge in quantum machine learning is generalization, as the designer targets performance under testing conditions, while having access only to limited training data. Existing generalization analyses, while identifying important general trends and scaling laws, cannot be used to assign reliable and informative “error bars” to the decisions made by quantum models. In this article, we propose a general methodology that can reliably quantify the uncertainty of quantum models, irrespective of the amount of training data, of the number of shots, of the ansatz, of the training algorithm, and of the presence of quantum hardware noise. The approach, which builds on probabilistic conformal prediction, turns an arbitrary, possibly small, number of shots from a pre-trained quantum model into a set prediction, e.g., an interval, thatprovablycontains the true target with any desired coverage level. Experimental results confirm the theoretical calibration guarantees of the proposed framework, referred to asquantum conformal prediction.
Reliable decision-making with quantum neural networks on NISQ hardware requires uncertainty estimates that remain meaningful under finite-shot measurement noise and distribution shift. This study introduces an end-to-end pipeline that combines Bayesian variational quantum circuits with post hoc probability calibration and conformal prediction to produce coverage-controlled prediction sets. Across shot budgets from 128 to 4096 shots, the Bayesian variational circuit improves accuracy from 0.828 to 0.839 at 128 shots and from 0.862 to 0.892 at 4096 shots, while reducing negative log-likelihood from 0.462 to 0.448 at 128 shots and from 0.392 to 0.357 at 4096 shots. Calibration preserves accuracy while further lowering negative log-likelihood to 0.432 at 128 shots and 0.350 at 4096 shots, and reduces expected calibration error from 0.058 to 0.027. Conformalization achieves empirical coverage of 0.952 at miscoverage 0.05, with average set size 1.39 and singleton rate 0.71, and maintains coverage between 0.944 and 0.948 under feature corruption and subpopulation shift, where deterministic accuracy degrades to 0.801 and 0.774, respectively, while the Bayesian model retains 0.842 and 0.816. Ablations identify an operational knee at circuit depth 8, and show diminishing returns beyond 8 posterior samples per prediction, supporting deployment-efficient uncertainty control for quantum learning.
Machine Learning (ML) has been widely applied across numerous domains due to its ability to automatically identify informative patterns from data for various tasks. The availability of large-scale data and advanced computational power enables the development of sophisticated models and training strategies, leading to state-of-the-art performance, but it also introduces substantial challenges. Quantum Computing (QC), which exploits quantum mechanisms for computation, has attracted growing attention and significant global investment as it may address these challenges. Consequently, Quantum Machine Learning (QML), the integration of these two fields, has received increasing interest, with a notable rise in related studies in recent years. We are motivated to review these existing contributions regarding quantum circuit-based learning models for classical data analysis and highlight the identified potentials and challenges of this technique. Specifically, we focus not only on QML models, both kernel-based and neural network-based, but also on recent explorations of their integration with classical machine learning layers within hybrid frameworks. Moreover, we examine both theoretical analysis and empirical findings to better understand their capabilities, and we also discuss the efforts on noise-resilient and hardware-efficient QML that could enhance its practicality under current hardware limitations. In addition, we cover several emerging paradigms for advanced quantum circuit design and highlight the adaptability of QML across representative application domains. This study aims to provide an overview of the contributions made to bridge quantum computing and machine learning, offering insights and guidance to support its future development and pave the way for broader adoption in the coming years.
This phenomenon is due to the development of complex high-dimensional datasets within machine learning that may not be effectively processed, identified or classified by classical computers. Multi-dimensional data are increasingly common in a wide range of scientific disciplines including genomics, finance modeling, computer vision, climate prediction et al, and standard approaches to analysis have begun to falter in the face of the curse of dimensionality, computational efficiency, and reduced interpretability. Quantum computing, in this context, is a disruptive paradigm that can bring about a substantial overhaul to machines ability to learn. In this work, we investigate a family of new quantumenhanced protocols specially designed for enhancing pattern recognition in multi-dimensional machine learning problems. We demonstrate a hybrid quantum-classical scheme, combining quantum state representation, quantum feature encoding and quantum kernel estimation to make complex data transformations in a time that scales only with the squareroot of the data size. Important techniques are the use of variational quantum circuits, quantum principal component analysis (qPCA), and quantum support vector machines (QSVMs) to uncover the structure of non-linear and highdimensional features spaces that would have been hidden otherwise. We benchmark these quantum models against classical deep learning models on three datasets: healthcare diagnostics, image classification, and sensor-based time series prediction. Experiments demonstrate that quantum-enhanced models not only accelerate the training process and save the memory space but also achieve better generalization on identifying shape features and abstract patterns. By entanglement and quantum parallelism, we can encode and process information of a multi-dimensional input at the same time and provide a compact and informative representation. In addition to that, quantum circuits show a good potential to deal with noisy and overfitting when dealing with sparsed and imbalanced data. This work demonstrates the quantumcomputational power for pattern recognition, and paves the way for scalable, efficient, and interpretable quantum machine learning. Through connecting quantum algorithms to practical machine learning problems, the work paves the way for applications of quantum computing in challenging highdimensional data analysis problems and in a new territory of research interests at the intersection of quantum information and artificial intelligence.
Quantum fidelity estimation is a fundamental task in quantum information and computing to benchmark the quality of quantum states, and hence of quantum processes, on noisy quantum hardware. Point estimates of fidelity by existing methods generally lack the rigorous uncertainty quantification required for reliable preparation and verification of these tasks. While Bayesian and bootstrap frameworks are widely used for uncertainty quantification, they are sensitive to model misspecification or lack formal coverage guarantees in non-asymptotic regimes. This paper introduces a hybrid "Bayesian-informed" conformal prediction-based framework to provide distribution-free, rigorous prediction intervals for quantum state fidelity estimation which can be used, with care, to approximate confidence intervals with respect to the quantum randomness of Born's rule. The framework requires a point estimator, and we consider both classical point estimators as well as data-driven neural net estimators. We evaluate the robustness of the methodology across a diverse range of experimental challenges, including finite-sample noise, tomographic incompleteness, physical model error, and out-of-distribution data. Our results demonstrate that conformalized estimators maintain statistical validity where traditional methods fail, offering a scalable and reliable approach for the verification of modern quantum systems. The best performing variant of our methodology is based on a class-conditional conformal prediction, as this most closely approximates the conditional coverage desired for a true confidence interval.
In recent years, quantum computing, as a potential way to break the bottleneck of Moore's Law, has gradually shown its unique advantages in the field of machine learning. Not only can it bring exponential or polynomial acceleration in some specific tasks, it also provides entirely new ways of representing and processing information. Focusing on the core theme of application and method innovation of quantum machine learning in structured data, this thesis systematically studies the theoretical models and practical applications of quantum computing in many sub-fields such as agricultural remote sensing, graph neural networks, and hyperdimensional computing, and explores the adaptability, scalability, and effectiveness of quantum models in real-world tasks. Firstly, in the cropland classification and yield prediction task, this study identifies that traditional neural networks tend to underperform when facing imbalanced and small-sample remote sensing data, often misclassifying minority crop types. To address this, we propose a quantum-classical hybrid recognition framework that integrates quantum feature mapping with classical neural networks. After incorporating quantum feature encoding, we observe a significant improvement in classification performance, especially in cases involving subtle field boundaries and heterogeneous textures. The quantum-enhanced model demonstrates superior accuracy, robustness, and generalization compared to its classical counterpart, validating the advantage of leveraging quantum representations in real-world agricultural datasets. The second part focuses on the learning of graph structure data and proposes to embed the Continuous Time Quantum Walk (CTQW) into the Graph Neural Network (GNN) architecture. This method not only preserves the global interference characteristic of quantum states but also realizes the efficient modeling of graph topology through the spectral graph methods. Experiments show that the proposed method is superior to many classical graph learning models in tasks such as node classification and graph structure inference. The third and fourth components of this thesis collectively explore quantum approaches to hyperdimensional computing (HDC), establishing a progressive transition from native quantum-state-based implementation to quantum-enhanced HDC strategies. Initially, we investigate the intrinsic mathematical correspondence between quantum states and high-dimensional hypervectors, and propose a novel quantum-state-based high-dimensional encoding method. This method is realized through quantum circuits capable of generating hypervectors with controllable entropy, thereby implementing essential HDC operations, such as classification and memory reconstruction, on real quantum hardware. This marks the first successful migration of core HDC mechanisms into a fully quantum-native framework. Building upon this foundation, we further propose the first quantum-enhanced HDC strategy, which does not rely solely on quantum-native implementations but rather utilizes key quantum features to boost the efficiency and expressivity of conventional HDC systems. Specifically, we introduce mechanisms such as quantum-reference-state-based binding, using density matrices to represent superclass states, and quantum state tomography for robust feature extraction. These innovations significantly enhance the resilience and performance of HDC under high-noise and high-dimensional sensing environments. The resulting models achieve superior accuracy and robustness across a variety of multi-class classification tasks, demonstrating the practical benefits of integrating quantum computation into the broader HDC paradigm. In this thesis, experimental validation is carried out in multiple real and simulation environments, including Qiskit and Paddle Quantum platforms, and a complete closed loop was achieved from theoretical derivation, quantum circuit design to end-to-end experimental evaluation. The results show that quantum methods can expand the expressive power of classical models and become an important tool to deal with large-scale, structured data problems in the future. The work in this thesis provides methodological support for quantum machine learning from theory to application, and also expands the research boundaries of high-dimensional computation and graph learning in the quantum background.