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

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics

Genetic Algorithms based on Bhattacharyya Distance for Quantum Measurement Error Mitigation

Giovanni Acampora, Michele Grossi, Autilia Vitiello

Published Oct 17, 2021• 1 citation
Publisher

Abstract

Quantum computing is a fascinating research area which promises a revolution in computing performance. Since the launch of the IBM Quantum Experience project in 2016, the research activities in this area are strongly increased. This project provides the public access to quantum processors composed of superconducting physical computing elements known as qubits. Unfortunately, qubits are sensitive to noise and, for this reason, quantum computation can be affected by errors. As a consequence, there is a strong emergence for so- called quantum error mitigation methods aimed to attenuate the quantum error as much as possible, without requiring a strong additional computational effort. Among the most error- prone operations, there is surely the quantum measurement. Conventionally, mitigation methods for quantum measurement error compute a so-called mitigation matrix capable of correcting results outputted by a quantum processor. In this paper, a new measurement error mitigation approach based on genetic algorithms whose fitness function uses Bhattacharyya distance is proposed to learn an appropriate mitigation matrix. As shown in the experimental session, the proposed measurement error mitigation method outperforms the traditional approach.

DOI
10.1109/smc52423.2021.9658897

Related papers

Genetic Algorithms for Error Mitigation in Quantum Measurement

Giovanni Acampora, Michele Grossi, Autilia Vitiello

Noisy Intermediate Scale Quantum (NISQ) devices are expected to demonstrate the real potential of quantum computing in solving hard problems. However, quantum noise that characterizes this kind of devices still remains an obstacle for their practical exploitation in real world scenarios. As a consequence, there is a strong emergence for error correction techniques aimed at making NISQ devices stable and fully operative. Unfortunately, current approaches for quantum error correction are prohibitive for NISQ devices because of the enormous multiplicative cost in resources that they require. For this reason, so-called quantum error mitigation methods are emerging as alternative approaches able to attenuate the quantum error as much as possible, without requiring a strong additional computational effort. Among the most error-prone operations, there is surely the quantum measurement. Conventionally, mitigation methods for quantum measurement error compute a so-called mitigation matrix capable of correcting results outputted by a quantum processor. In this paper, a new measurement error mitigation approach based on genetic algorithms is proposed to learn an appropriate mitigation matrix. As shown in the experimental session, the proposed measurement error mitigation method is comparable with or better than a conventional algebraic approach in terms of the Hellinger fidelity.

IEEE Congress on Evolutionary Computation (CEC)•Jun 28, 2021•10 citations

A Competent Memetic Algorithm for Error Mitigation in Quantum Measurement

Giovanni Acampora, Autilia Vitiello

Recently, a significant interest is arising in developing techniques capable of correcting errors in noisy quantum computations without using additional quantum resources. These techniques, known as mitigation methods, are aimed at post-processing the quantum outcome without working at quantum hardware level. Among the most error-prone operations on the current quantum devices, there is surely the quantum measurement. Currently, the most popular mitigation method for quantum measurement error consists of computing a so-called mitigation matrix to be applied on the results outputted by a quantum processor to transform them and make them closer to the ideal ones. In this paper, a new measurement error mitigation method based on a competent memetic algorithm is proposed to generate an appropriate mitigation matrix. As shown in the experimental session, the proposed measurement error mitigation method shows better results when compared with the conventional method and the state of the art among the evolutionary approaches.

IEEE Congress on Evolutionary Computation (CEC)•Jul 1, 2023•0 citations

Bayesian mitigation of measurement errors in multiqubit experiments

F. Cosco, Francesco Plastina, Nicola Lo Gullo

In Phys. Rev. A 108, L060402 (2023), we introduced a Bayesian measurement error mitigation algorithm, which leveraged complete information from the readout signal, and validated the protocol on a quantum device with five superconducting qubits. Here, we present an improved algorithm's implementation, tailored for multiqubit experiments on near-term superconducting qubit quantum devices. In particular, we provide a detailed algorithm workflow, from calibrating the detector response functions to the postprocessing of measurement outcomes, offering a computationally efficient solution for the output size typical of current quantum computing devices. We show how the numerical representation of the noise function affects the performance of the error mitigation algorithm and test the convergence criteria. We benchmark our protocol on actual quantum computers with superconducting qubits, where the readout signal encodes the measurement information as unprocessed analog data before qubit state assignment. Finally, we compare the performance of our algorithm against other measurement error mitigation methods, such as iterative Bayesian unfolding and the Mthree method, and show how our method can be integrated on top of other readout error mitigation protocols.

arXiv:2408.00869•Physical Review A•Sep 30, 2025•2 citations

EVOLVING QUANTUM ERROR CORRECTION CODES

DANIEL RIBAS TANDEITNIK

Computational methods become essential in the face of complex problems where human intuition and traditional methods fail.Recent works present artificial neural networks capable of efficiently performing tasks intractable by conventional algorithms using machine learning, rendering it one of the most popular methods.Concomitantly, genetic algorithms, inspired by the biological processes of natural selection and mutation, have been used as a metaheuristic method to find solutions to optimization problems.We then raise the question of whether genetic algorithms have the potential to solve problems in the context of quantum computing, where human intuition decreases as physical systems grow.Specifically, we focus on the evolution of quantum error-correcting codes within the stabilizer code formalism.By specifying an appropriate fitness function, we show that we can evolve celebrated codes, such as the Perfect and Shor's code with respectively 5 and 9 qubits, in addition to new unanticipated examples.Additionally, we compared it with a brute force random search and verified an increasing superiority of the genetic algorithm as the total number of qubits increases.Given the results, we foresee that genetic algorithms can become valuable tools to perform complex applications in quantum systems and produce tailored circuits that satisfy restrictions imposed by hardware.

•May 11, 2022•0 citations

Scalable General Error Mitigation for Quantum Circuits

Philip Döbler, Jannik Pflieger, Fengping Jin +4 more

In quantum computing, error mitigation is a method to improve the results of an error-prone quantum processor by post-processing them on a classical computer. In this work, we improve the General Error Mitigation (GEM) method for scalability. GEM relies on the use of a matrix to represent the device error, which requires the execution of $2^{n+1}$ calibration circuits on the quantum hardware, where $n$ is the number of qubits. With our improved method, the number of calibration runs is independent of the number of qubits and depends only on the number of non-zero states in the output distribution. We run 1853 randomly generated circuits with widths between 2-7 qubits and depths between 10-140 gates on IBMQ superconducting devices. The experiments show that the mitigation works comparably well to GEM, while requiring a fraction of the calibration runs. Finally, an experiment to mitigate errors in a 100 qubit circuit demonstrates the scalable features of our method.

arXiv:2411.07916•Nov 12, 2024•3 citations

Error Mitigation in Quantum Measurement through Fuzzy C-Means Clustering

Giovanni Acampora, Autilia Vitiello

Recently, Quantum Computing is entered in the so-called Noisy Intermediate-Scale Quantum (NISQ) era, where devices characterized by a few number of qubits are potentially able to overcome classical computers in performing specific tasks. However, noise in quantum operators still limits the size of quantum circuits that can be run in a reliable way. Consequently, there is a strong need for error mitigation approaches aimed at increasing reliability in quantum computation and making this paradigm really useful and productive in real world applications. In this paper, a fuzzy method, such as Fuzzy C-Means (FCM) clustering, has been used, for the very first time, to support the identification of matrices for error mitigation in quantum measurement. As shown in experiments, mitigation matrices identified with the support of FCM are able to strongly reduce error in computation when compared to mitigation matrices conventionally identified, like those used by IBM in its quantum library named Qiskit.

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)•Jul 11, 2021•10 citations
Quantum computing is a fascinating research area which promises a revolution in computing performance. Since the launch of the IBM Quantum Experience project in 2016, the research activities in this area are strongly increased. This project provides the public access to quantum processors composed of superconducting physical computing elements known as qubits. Unfortunately, qubits are sensitive to noise and, for this reason, quantum computation can be affected by errors. As a consequence, there is a strong emergence for so- called quantum error mitigation methods aimed to attenuate the quantum error as much as possible, without requiring a strong additional computational effort. Among the most error- prone operations, there is surely the quantum measurement. Conventionally, mitigation methods for quantum measurement error compute a so-called mitigation matrix capable of correcting results outputted by a quantum processor. In this paper, a new measurement error mitigation approach based on genetic algorithms whose fitness function uses Bhattacharyya distance is proposed to learn an appropriate mitigation matrix. As shown in the experimental session, the proposed measurement error mitigation method outperforms the traditional approach.
Noisy Intermediate Scale Quantum (NISQ) devices are expected to demonstrate the real potential of quantum computing in solving hard problems. However, quantum noise that characterizes this kind of devices still remains an obstacle for their practical exploitation in real world scenarios. As a consequence, there is a strong emergence for error correction techniques aimed at making NISQ devices stable and fully operative. Unfortunately, current approaches for quantum error correction are prohibitive for NISQ devices because of the enormous multiplicative cost in resources that they require. For this reason, so-called quantum error mitigation methods are emerging as alternative approaches able to attenuate the quantum error as much as possible, without requiring a strong additional computational effort. Among the most error-prone operations, there is surely the quantum measurement. Conventionally, mitigation methods for quantum measurement error compute a so-called mitigation matrix capable of correcting results outputted by a quantum processor. In this paper, a new measurement error mitigation approach based on genetic algorithms is proposed to learn an appropriate mitigation matrix. As shown in the experimental session, the proposed measurement error mitigation method is comparable with or better than a conventional algebraic approach in terms of the Hellinger fidelity.
Recently, a significant interest is arising in developing techniques capable of correcting errors in noisy quantum computations without using additional quantum resources. These techniques, known as mitigation methods, are aimed at post-processing the quantum outcome without working at quantum hardware level. Among the most error-prone operations on the current quantum devices, there is surely the quantum measurement. Currently, the most popular mitigation method for quantum measurement error consists of computing a so-called mitigation matrix to be applied on the results outputted by a quantum processor to transform them and make them closer to the ideal ones. In this paper, a new measurement error mitigation method based on a competent memetic algorithm is proposed to generate an appropriate mitigation matrix. As shown in the experimental session, the proposed measurement error mitigation method shows better results when compared with the conventional method and the state of the art among the evolutionary approaches.
In Phys. Rev. A 108, L060402 (2023), we introduced a Bayesian measurement error mitigation algorithm, which leveraged complete information from the readout signal, and validated the protocol on a quantum device with five superconducting qubits. Here, we present an improved algorithm's implementation, tailored for multiqubit experiments on near-term superconducting qubit quantum devices. In particular, we provide a detailed algorithm workflow, from calibrating the detector response functions to the postprocessing of measurement outcomes, offering a computationally efficient solution for the output size typical of current quantum computing devices. We show how the numerical representation of the noise function affects the performance of the error mitigation algorithm and test the convergence criteria. We benchmark our protocol on actual quantum computers with superconducting qubits, where the readout signal encodes the measurement information as unprocessed analog data before qubit state assignment. Finally, we compare the performance of our algorithm against other measurement error mitigation methods, such as iterative Bayesian unfolding and the Mthree method, and show how our method can be integrated on top of other readout error mitigation protocols.
Computational methods become essential in the face of complex problems where human intuition and traditional methods fail.Recent works present artificial neural networks capable of efficiently performing tasks intractable by conventional algorithms using machine learning, rendering it one of the most popular methods.Concomitantly, genetic algorithms, inspired by the biological processes of natural selection and mutation, have been used as a metaheuristic method to find solutions to optimization problems.We then raise the question of whether genetic algorithms have the potential to solve problems in the context of quantum computing, where human intuition decreases as physical systems grow.Specifically, we focus on the evolution of quantum error-correcting codes within the stabilizer code formalism.By specifying an appropriate fitness function, we show that we can evolve celebrated codes, such as the Perfect and Shor's code with respectively 5 and 9 qubits, in addition to new unanticipated examples.Additionally, we compared it with a brute force random search and verified an increasing superiority of the genetic algorithm as the total number of qubits increases.Given the results, we foresee that genetic algorithms can become valuable tools to perform complex applications in quantum systems and produce tailored circuits that satisfy restrictions imposed by hardware.
In quantum computing, error mitigation is a method to improve the results of an error-prone quantum processor by post-processing them on a classical computer. In this work, we improve the General Error Mitigation (GEM) method for scalability. GEM relies on the use of a matrix to represent the device error, which requires the execution of 2n+12^{n+1}2n+1 calibration circuits on the quantum hardware, where nnn is the number of qubits. With our improved method, the number of calibration runs is independent of the number of qubits and depends only on the number of non-zero states in the output distribution. We run 1853 randomly generated circuits with widths between 2-7 qubits and depths between 10-140 gates on IBMQ superconducting devices. The experiments show that the mitigation works comparably well to GEM, while requiring a fraction of the calibration runs. Finally, an experiment to mitigate errors in a 100 qubit circuit demonstrates the scalable features of our method.
Recently, Quantum Computing is entered in the so-called Noisy Intermediate-Scale Quantum (NISQ) era, where devices characterized by a few number of qubits are potentially able to overcome classical computers in performing specific tasks. However, noise in quantum operators still limits the size of quantum circuits that can be run in a reliable way. Consequently, there is a strong need for error mitigation approaches aimed at increasing reliability in quantum computation and making this paradigm really useful and productive in real world applications. In this paper, a fuzzy method, such as Fuzzy C-Means (FCM) clustering, has been used, for the very first time, to support the identification of matrices for error mitigation in quantum measurement. As shown in experiments, mitigation matrices identified with the support of FCM are able to strongly reduce error in computation when compared to mitigation matrices conventionally identified, like those used by IBM in its quantum library named Qiskit.