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

International Journal of Quantum Information

Quantum error-correcting output codes

David Windridge, Riccardo Mengoni, Rajagopal Nagarajan

Published Aug 15, 2018• 5 citations
Publisher

Abstract

Quantum machine learning is the aspect of quantum computing concerned with the design of algorithms capable of generalized learning from labeled training data by effectively exploiting quantum effects. Error-correcting output codes (ECOC) are a standard setting in machine learning for efficiently rendering the collective outputs of a binary classifier, such as the support vector machine, as a multi-class decision procedure. Appropriate choice of error-correcting codes further enables incorrect individual classification decisions to be effectively corrected in the composite output. In this paper, we propose an appropriate quantization of the ECOC process, based on the quantum support vector machine. We will show that, in addition to the usual benefits of quantizing machine learning, this technique leads to an exponential reduction in the number of logic gates required for effective correction of classification error.

DOI
10.1142/s0219749918400038

Related papers

Simplifying Quantum Multi-class Classification for the NISQ Era Using Error-Code Output Correction

Eric Zielinski, Dipankar Mitra

Within the rapidly evolving realms of artificial intelligence and machine learning, quantum computing has emerged as a pivotal frontier. However, its progress is significantly hindered by the prevailing limitations of quantum hardware. This paper introduces an innovative quantum-classical hybrid algorithm, intricately designed for multi-class classification. The algorithm prioritizes memory efficiency, capitalizing on advanced amplitude encoding techniques and a specialized error-code output correction mechanism to reduce the quantum computational resources needed for data processing while maintaining exceptional speed and classification accuracy. Rigorous testing across a range of datasets, varying in complexities like feature count, class number, and data points, yields notable achievements, particularly in simpler datasets. Nevertheless, the presence of errors and occasional failures with more complex datasets highlights the ongoing need for refinement and optimization, positioning the algorithm toward practical applicability in the field.

IEEE International Conference on Electro Information Technology•May 30, 2024•0 citations

Quantum Support Vector Machine for Big Data Classification

Patrick Rebentrost, Masoud Mohseni, Seth Lloyd

Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases where classical sampling algorithms require polynomial time, an exponential speedup is obtained. At the core of this quantum big data algorithm is a nonsparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.

arXiv:1307.0471•Physical Review Letters•Sep 25, 2014•2,147 citations

Quantum support vector machine for big feature and big data classification.

Patrick Rebentrost, Masoud Mohseni, Seth Lloyd

Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized linear and non-linear binary classifier, can be implemented on a quantum computer, with exponential speedups in the size of the vectors and the number of training data examples. At the core of the algorithm is a non-sparse matrix simulation technique to efficiently perform a principal component analysis and matrix inversion of the training data kernel matrix. We thus provide an example of a quantum big feature and big data algorithm and pave the way for future developments at the intersection of quantum computing and machine learning.

•Jul 1, 2013•38 citations

Comparisons of Performance between Quantum and Classical Machine Learning

Christopher Havenstein, Damarcus Thomas, Swami Chandrasekaran

In this paper, we present a performance comparison of machine learning algorithms executed on traditional and quantum computers. Quantum computing has potential of achieving incredible results for certain types of problems, and we explore if it can be applied to machine learning. First, we identified quantum machine learning algorithms with reproducible code and had classical machine learning counterparts. Then, we found relevant data sets with which we tested the comparable quantum and classical machine learning algorithm's performance. We evaluated performance with algorithm execution time and accuracy. We found that quantum variational support vector machines in some cases had higher accuracy than classical support vector machines on multi-class classification problems. The main conclusion was that quantum multi-class SVM classifiers have the potential to be useful in the future as quantum computer’s available number of qubits increases.

SMU Data Science Review•Jan 1, 2018•33 citations

Quantum Error Correction and Detection for Quantum Machine Learning

Eromanga Adermann, Haiyue Kang, Martin Sevior +1 more

At the intersection of quantum computing and machine learning, quantum machine learning (QML) is poised to revolutionize artificial intelligence. However, the vulnerability of the current generation of quantum computers to noise and computational error poses a significant barrier to this vision. Whilst quantum error correction (QEC) offers a promising solution for almost any type of hardware noise, its application requires millions of qubits to encode even a simple logical algorithm, rendering it impractical in the near term. In this chapter, we examine strategies for integrating QEC and quantum error detection (QED) into QML under realistic resource constraints. We first quantify the resource demands of fully error-corrected QML and propose a partial QEC approach that reduces overhead while enabling error correction. We then demonstrate the application of a simple QED method, evaluating its impact on QML performance and highlighting challenges we have yet to overcome before we achieve fully fault-tolerant QML.

quant-pharXiv:2601.07223•Quantum science and technology•Jan 13, 2026•3 citations

Enhancing Classification Accuracy with Quantum Non-Negative Matrix Factorization and Quantum Support Vector Machines

Belkacem Chikhaoui

Quantum machine learning combines the power of quantum computing with machine learning to address complex computational challenges. In this work, we propose an integrated approach that leverages Quantum Non-Negative Matrix Factorization (QNMF) for feature selection and dimensionality reduction, coupled with Quantum Support Vector Machines (QSVM) for accurate classification. By combining the strengths of these two quantum techniques, our approach reduces data complexity while maintaining classification accuracy. We evaluate the performance of our method across multiple datasets from finance, healthcare, and e-commerce. Experimental results demonstrate that the proposed QNMF+QSVM approach achieves superior accuracy compared to classical machine learning methods such as SVM, Random Forests, and Decision Trees, highlighting its potential for solving real-world classification problems.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•5 citations
Quantum machine learning is the aspect of quantum computing concerned with the design of algorithms capable of generalized learning from labeled training data by effectively exploiting quantum effects. Error-correcting output codes (ECOC) are a standard setting in machine learning for efficiently rendering the collective outputs of a binary classifier, such as the support vector machine, as a multi-class decision procedure. Appropriate choice of error-correcting codes further enables incorrect individual classification decisions to be effectively corrected in the composite output. In this paper, we propose an appropriate quantization of the ECOC process, based on the quantum support vector machine. We will show that, in addition to the usual benefits of quantizing machine learning, this technique leads to an exponential reduction in the number of logic gates required for effective correction of classification error.
Within the rapidly evolving realms of artificial intelligence and machine learning, quantum computing has emerged as a pivotal frontier. However, its progress is significantly hindered by the prevailing limitations of quantum hardware. This paper introduces an innovative quantum-classical hybrid algorithm, intricately designed for multi-class classification. The algorithm prioritizes memory efficiency, capitalizing on advanced amplitude encoding techniques and a specialized error-code output correction mechanism to reduce the quantum computational resources needed for data processing while maintaining exceptional speed and classification accuracy. Rigorous testing across a range of datasets, varying in complexities like feature count, class number, and data points, yields notable achievements, particularly in simpler datasets. Nevertheless, the presence of errors and occasional failures with more complex datasets highlights the ongoing need for refinement and optimization, positioning the algorithm toward practical applicability in the field.
Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases where classical sampling algorithms require polynomial time, an exponential speedup is obtained. At the core of this quantum big data algorithm is a nonsparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.
Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized linear and non-linear binary classifier, can be implemented on a quantum computer, with exponential speedups in the size of the vectors and the number of training data examples. At the core of the algorithm is a non-sparse matrix simulation technique to efficiently perform a principal component analysis and matrix inversion of the training data kernel matrix. We thus provide an example of a quantum big feature and big data algorithm and pave the way for future developments at the intersection of quantum computing and machine learning.
In this paper, we present a performance comparison of machine learning algorithms executed on traditional and quantum computers. Quantum computing has potential of achieving incredible results for certain types of problems, and we explore if it can be applied to machine learning. First, we identified quantum machine learning algorithms with reproducible code and had classical machine learning counterparts. Then, we found relevant data sets with which we tested the comparable quantum and classical machine learning algorithm's performance. We evaluated performance with algorithm execution time and accuracy. We found that quantum variational support vector machines in some cases had higher accuracy than classical support vector machines on multi-class classification problems. The main conclusion was that quantum multi-class SVM classifiers have the potential to be useful in the future as quantum computer’s available number of qubits increases.
At the intersection of quantum computing and machine learning, quantum machine learning (QML) is poised to revolutionize artificial intelligence. However, the vulnerability of the current generation of quantum computers to noise and computational error poses a significant barrier to this vision. Whilst quantum error correction (QEC) offers a promising solution for almost any type of hardware noise, its application requires millions of qubits to encode even a simple logical algorithm, rendering it impractical in the near term. In this chapter, we examine strategies for integrating QEC and quantum error detection (QED) into QML under realistic resource constraints. We first quantify the resource demands of fully error-corrected QML and propose a partial QEC approach that reduces overhead while enabling error correction. We then demonstrate the application of a simple QED method, evaluating its impact on QML performance and highlighting challenges we have yet to overcome before we achieve fully fault-tolerant QML.
Quantum machine learning combines the power of quantum computing with machine learning to address complex computational challenges. In this work, we propose an integrated approach that leverages Quantum Non-Negative Matrix Factorization (QNMF) for feature selection and dimensionality reduction, coupled with Quantum Support Vector Machines (QSVM) for accurate classification. By combining the strengths of these two quantum techniques, our approach reduces data complexity while maintaining classification accuracy. We evaluate the performance of our method across multiple datasets from finance, healthcare, and e-commerce. Experimental results demonstrate that the proposed QNMF+QSVM approach achieves superior accuracy compared to classical machine learning methods such as SVM, Random Forests, and Decision Trees, highlighting its potential for solving real-world classification problems.