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:2102.00753 · Proceedings of the AAAI/ACM Conference on AI Ethics and Society

Quantum Fair Machine Learning

Elija Perrier

Published Jul 21, 2021• 19 citations
arXivHTMLPDF

Abstract

In this paper, we inaugurate the field of quantum fair machine learning. We undertake a comparative analysis of differences and similarities between classical and quantum fair machine learning algorithms, specifying how the unique features of quantum computation alter measures, metrics and remediation strategies when quantum algorithms are subject to fairness constraints. We present the first results in quantum fair machine learning by demonstrating the use of Grover's search algorithm to satisfy statistical parity constraints imposed on quantum algorithms. We provide lower-bounds on iterations needed to achieve such statistical parity within ε-tolerance. We extend canonical Lipschitz-conditioned individual fairness criteria to the quantum setting using quantum metrics. We examine the consequences for typical measures of fairness in machine learning context when quantum information processing and quantum data are involved. Finally, we propose open questions and research programmes for this new field of interest to researchers in computer science, ethics and quantum computation.

DOI
10.1145/3461702.3462611

Related papers

Quantum Inspired Search Algorithm for Bias Mitigation

Harsha Avinash Bhute, Ashish Bhosale, Abhinandan Ashtekar

Machine Learning (ML) algorithms in real-world applications have created an enormous and significant impact in terms of accuracy, efficiency and reliability. However, maintaining an appropriate bias in these algorithms seems to be a rigorous challenge to ensure fair and precise results obtained from decision making models. Various ML algorithms like Fairness Representation Learning, Adversarial Debiasing and Equalized Odds Post-Processing exist to mitigate bias but due to their computational limitations they lack the ability to do so which can have an adverse impact in sensitive sectors like finance and healthcare. Hence quantum algorithms arise with their promising features that can improve model performance with enhanced accuracy and fairness. In this study, we explore quantum approaches like Grover’s search algorithm and analyse the performance using different metrics. A comparative study of classical machine learning algorithms against quantum algorithms is done on adult income dataset. The results display a significant drop in Statistical Parity Difference (SPD) from 0.5173 (Baseline) to 0.4956 (Quantum) which indicates that the model is now less biased and fair predictions are done by the model. In future, hybrid quantum-machine learning techniques will play a key role in mitigation framework and general ML real-world applications.

International Conference on Computing Technologies (ICOCT)•Jun 13, 2025•2 citations

Verifying Fairness in Quantum Machine Learning

Ji Guan, Wang Sheng Fang, Mingsheng Ying

Abstract Due to the beyond-classical capability of quantum computing, quantum machine learning is applied independently or embedded in classical models for decision making, especially in the field of finance. Fairness and other ethical issues are often one of the main concerns in decision making. In this work, we define a formal framework for the fairness verification and analysis of quantum machine learning decision models, where we adopt one of the most popular notions of fairness in the literature based on the intuition—any two similar individuals must be treated similarly and are thus unbiased. We show that quantum noise can improve fairness and develop an algorithm to check whether a (noisy) quantum machine learning model is fair. In particular, this algorithm can find bias kernels of quantum data (encoding individuals) during checking. These bias kernels generate infinitely many bias pairs for investigating the unfairness of the model. Our algorithm is designed based on a highly efficient data structure—Tensor Networks—and implemented on Google’s TensorFlow Quantum. The utility and effectiveness of our algorithm are confirmed by the experimental results, including income prediction and credit scoring on real-world data, for a class of random (noisy) quantum decision models with 27 qubits ( $$2^{27}$$ 227 -dimensional state space) tripling ( $$2^{18}$$ 218 times more than) that of the state-of-the-art algorithms for verifying quantum machine learning models.

arXiv:2207.11173•Lecture notes in computer science•Jan 1, 2022•21 citations

Quantum algorithms for machine learning and optimization

Tongyang Li

The theories of optimization and machine learning answer foundational questions in computer science and lead to new algorithms for practical applications. While these topics have been extensively studied in the context of classical computing, their quantum counterparts are far from well-understood. In this thesis, we explore algorithms that bridge the gap between the fields of quantum computing and machine learning. First, we consider general optimization problems with only function evaluations. For two core problems, namely general convex optimization and volume estimation of convex bodies, we give quantum algorithms as well as quantum lower bounds that constitute the quantum speedups of both problems to be polynomial compared to their classical counterparts. We then consider machine learning and optimization problems with input data stored explicitly as matrices. We first look at semidefinite programs and provide quantum algorithms with polynomial speedup compared to the classical state-of-the-art. We then move to machine learning and give the optimal quantum algorithms for linear and kernel-based classifications. To complement with our quantum algorithms, we also introduce a framework for quantum-inspired classical algorithms, showing that for low-rank matrix arithmetics there can only be polynomial quantum speedup. Finally, we study statistical problems on quantum computers, with the focus on testing properties of probability distributions. We show that for testing various properties including L1-distance, L2-distance, Shannon and Renyi entropies, etc., there are polynomial quantum speedups compared to their classical counterparts. We also extend these results to testing properties of quantum states.

•Jan 1, 2020•2 citations

Machine Learning: Quantum vs Classical

Tariq Mahmood Khan, Antonio Robles‐Kelly

Encouraged by growing computing power and algorithmic development, machine learning technologies have become powerful tools for a wide variety of application areas, spanning from agriculture to chemistry and natural language processing. The use of quantum systems to process classical data using machine learning algorithms has given rise to an emerging research area, i.e. quantum machine learning. Despite its origins in the processing of classical data, quantum machine learning also explores the use of quantum phenomena for learning systems, the use of quantum computers for learning on quantum data and how machine learning algorithms and software can be formulated and implemented on quantum computers. Quantum machine learning can have a transformational effect on computer science. It may speed up the processing of information well beyond the existing classical speeds. Recent work has seen the development of quantum algorithms that could serve as foundations for machine learning applications. Despite its great promise, there are still significant hardware and software challenges that need to be resolved before quantum machine learning becomes practical. In this paper, we present an overview of quantum machine learning in the light of classical approaches. Departing from foundational concepts of machine learning and quantum computing, we discuss various technical contributions, strengths and similarities of the research work in this domain. We also elaborate upon the recent progress of different quantum machine learning approaches, their complexity, and applications in various fields such as physics, chemistry and natural language processing.

IEEE Access•Jan 1, 2020•241 citations

An Accuracy Analysis Of Classical And Quantum Machine Learning Algorithms Using Different Datasets

Prashanthi Bhaskaran, S. Prasanna

Classical machine learning has practical significant advancements and extensive acceptance across various domains, enabling the growth of precise predictive models. The purpose of this work is to examine the accuracy gained by various machine learning algorithms, both classical and quantum. In addition, the study delves into the fundamental ideas and principles that form the backbone of quantum machine learning algorithms, such as quantum data representation, quantum feature mapping, and quantum optimization strategies. Experiments use classical machine learning models trained and tested on traditional hardware to measure evaluation metrics like classification accuracy, precision, recall, and F1-score for quantum machine learning models executed on quantum computing platforms or simulators. In quantum SVM, the seed dataset obtained 100% accuracy, and the supermarket dataset obtained 69% accuracy when compared to classical SVM. The findings imply that, under some conditions, quantum machine learning algorithms show the capacity to beat their conventional counterparts in terms of accuracy.

International Conference on Networking and Communications (ICNWC)•Apr 2, 2024•4 citations

The Use of Quantum Algorithms vs. Classical Algorithms in Machine Learning

Elina Saarikoski

Through the utilization of quantum phenomena to carry out computations that are beyond the capabilities of classical computers, quantum computing has the potential to revolutionize a variety of industries, including machine learning. In this research, we give a comparative study of conventional and quantum algorithms in the context of machine learning, and we compare and contrast the two types of algorithms. The advantages of quantum algorithms, such as quantum parallelism and entanglement, as well as their potential to outperform classical algorithms in tasks such as classification, clustering, and optimization, are investigated in this article. We explain the merits and limitations of quantum machine learning algorithms by means of theoretical analysis and practical tests. We also emphasize the possibility of these algorithms to achieve quantum advantage in certain scenarios. In addition, we examine the difficulties and opportunities associated with incorporating quantum computing into machine learning pipelines, and we describe potential future research objectives in this rapidly developing subject.

Package Printing•Aug 3, 2026•0 citations
In this paper, we inaugurate the field of quantum fair machine learning. We undertake a comparative analysis of differences and similarities between classical and quantum fair machine learning algorithms, specifying how the unique features of quantum computation alter measures, metrics and remediation strategies when quantum algorithms are subject to fairness constraints. We present the first results in quantum fair machine learning by demonstrating the use of Grover's search algorithm to satisfy statistical parity constraints imposed on quantum algorithms. We provide lower-bounds on iterations needed to achieve such statistical parity within ε-tolerance. We extend canonical Lipschitz-conditioned individual fairness criteria to the quantum setting using quantum metrics. We examine the consequences for typical measures of fairness in machine learning context when quantum information processing and quantum data are involved. Finally, we propose open questions and research programmes for this new field of interest to researchers in computer science, ethics and quantum computation.
Machine Learning (ML) algorithms in real-world applications have created an enormous and significant impact in terms of accuracy, efficiency and reliability. However, maintaining an appropriate bias in these algorithms seems to be a rigorous challenge to ensure fair and precise results obtained from decision making models. Various ML algorithms like Fairness Representation Learning, Adversarial Debiasing and Equalized Odds Post-Processing exist to mitigate bias but due to their computational limitations they lack the ability to do so which can have an adverse impact in sensitive sectors like finance and healthcare. Hence quantum algorithms arise with their promising features that can improve model performance with enhanced accuracy and fairness. In this study, we explore quantum approaches like Grover’s search algorithm and analyse the performance using different metrics. A comparative study of classical machine learning algorithms against quantum algorithms is done on adult income dataset. The results display a significant drop in Statistical Parity Difference (SPD) from 0.5173 (Baseline) to 0.4956 (Quantum) which indicates that the model is now less biased and fair predictions are done by the model. In future, hybrid quantum-machine learning techniques will play a key role in mitigation framework and general ML real-world applications.
Abstract Due to the beyond-classical capability of quantum computing, quantum machine learning is applied independently or embedded in classical models for decision making, especially in the field of finance. Fairness and other ethical issues are often one of the main concerns in decision making. In this work, we define a formal framework for the fairness verification and analysis of quantum machine learning decision models, where we adopt one of the most popular notions of fairness in the literature based on the intuition—any two similar individuals must be treated similarly and are thus unbiased. We show that quantum noise can improve fairness and develop an algorithm to check whether a (noisy) quantum machine learning model is fair. In particular, this algorithm can find bias kernels of quantum data (encoding individuals) during checking. These bias kernels generate infinitely many bias pairs for investigating the unfairness of the model. Our algorithm is designed based on a highly efficient data structure—Tensor Networks—and implemented on Google’s TensorFlow Quantum. The utility and effectiveness of our algorithm are confirmed by the experimental results, including income prediction and credit scoring on real-world data, for a class of random (noisy) quantum decision models with 27 qubits ( 2272^{27}227 227 -dimensional state space) tripling ( 2182^{18}218 218 times more than) that of the state-of-the-art algorithms for verifying quantum machine learning models.
The theories of optimization and machine learning answer foundational questions in computer science and lead to new algorithms for practical applications. While these topics have been extensively studied in the context of classical computing, their quantum counterparts are far from well-understood. In this thesis, we explore algorithms that bridge the gap between the fields of quantum computing and machine learning. First, we consider general optimization problems with only function evaluations. For two core problems, namely general convex optimization and volume estimation of convex bodies, we give quantum algorithms as well as quantum lower bounds that constitute the quantum speedups of both problems to be polynomial compared to their classical counterparts. We then consider machine learning and optimization problems with input data stored explicitly as matrices. We first look at semidefinite programs and provide quantum algorithms with polynomial speedup compared to the classical state-of-the-art. We then move to machine learning and give the optimal quantum algorithms for linear and kernel-based classifications. To complement with our quantum algorithms, we also introduce a framework for quantum-inspired classical algorithms, showing that for low-rank matrix arithmetics there can only be polynomial quantum speedup. Finally, we study statistical problems on quantum computers, with the focus on testing properties of probability distributions. We show that for testing various properties including L1-distance, L2-distance, Shannon and Renyi entropies, etc., there are polynomial quantum speedups compared to their classical counterparts. We also extend these results to testing properties of quantum states.
Encouraged by growing computing power and algorithmic development, machine learning technologies have become powerful tools for a wide variety of application areas, spanning from agriculture to chemistry and natural language processing. The use of quantum systems to process classical data using machine learning algorithms has given rise to an emerging research area, i.e. quantum machine learning. Despite its origins in the processing of classical data, quantum machine learning also explores the use of quantum phenomena for learning systems, the use of quantum computers for learning on quantum data and how machine learning algorithms and software can be formulated and implemented on quantum computers. Quantum machine learning can have a transformational effect on computer science. It may speed up the processing of information well beyond the existing classical speeds. Recent work has seen the development of quantum algorithms that could serve as foundations for machine learning applications. Despite its great promise, there are still significant hardware and software challenges that need to be resolved before quantum machine learning becomes practical. In this paper, we present an overview of quantum machine learning in the light of classical approaches. Departing from foundational concepts of machine learning and quantum computing, we discuss various technical contributions, strengths and similarities of the research work in this domain. We also elaborate upon the recent progress of different quantum machine learning approaches, their complexity, and applications in various fields such as physics, chemistry and natural language processing.
Classical machine learning has practical significant advancements and extensive acceptance across various domains, enabling the growth of precise predictive models. The purpose of this work is to examine the accuracy gained by various machine learning algorithms, both classical and quantum. In addition, the study delves into the fundamental ideas and principles that form the backbone of quantum machine learning algorithms, such as quantum data representation, quantum feature mapping, and quantum optimization strategies. Experiments use classical machine learning models trained and tested on traditional hardware to measure evaluation metrics like classification accuracy, precision, recall, and F1-score for quantum machine learning models executed on quantum computing platforms or simulators. In quantum SVM, the seed dataset obtained 100% accuracy, and the supermarket dataset obtained 69% accuracy when compared to classical SVM. The findings imply that, under some conditions, quantum machine learning algorithms show the capacity to beat their conventional counterparts in terms of accuracy.
Through the utilization of quantum phenomena to carry out computations that are beyond the capabilities of classical computers, quantum computing has the potential to revolutionize a variety of industries, including machine learning. In this research, we give a comparative study of conventional and quantum algorithms in the context of machine learning, and we compare and contrast the two types of algorithms. The advantages of quantum algorithms, such as quantum parallelism and entanglement, as well as their potential to outperform classical algorithms in tasks such as classification, clustering, and optimization, are investigated in this article. We explain the merits and limitations of quantum machine learning algorithms by means of theoretical analysis and practical tests. We also emphasize the possibility of these algorithms to achieve quantum advantage in certain scenarios. In addition, we examine the difficulties and opportunities associated with incorporating quantum computing into machine learning pipelines, and we describe potential future research objectives in this rapidly developing subject.