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:2402.11830 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Qubit-Wise Majority Vote: Maximum Likelihood Quantum Error Mitigation for Algorithms with a Single Correct Output

Dror Baron, Hrushikesh Pramod Patil, Huiyang Zhou

Published Sep 15, 2024• 2 citations
arXivHTMLPDF

Abstract

Quantum error mitigation is an important technique to reduce the impact of noise in quantum computers. With more and more qubits being supported on quantum computers, there are two emerging fundamental challenges. First, the number of shots required for quantum algorithms with large numbers of qubits needs to increase in order to obtain a meaningful distribution or expected value of an observable. Second, although steady progress has been made in improving the fidelity of each qubit, circuits with a large number of qubits are likely to produce erroneous results. This low-shot, high-noise regime calls for highly scalable error mitigation techniques. In this paper, we propose a simple and effective mitigation scheme, qubit-wise majority vote, for quantum algorithms with a single correct output. We show that our scheme produces the maximum likelihood (ML) estimate under certain assumptions and bound the number of shots required. Our experimental results on real quantum devices confirm that our proposed approach requires fewer shots than existing ones, and can sometimes recover the correct answers even when they are not observed from the measurement results.

DOI
10.1109/qce60285.2024.00024

Related papers

Efficient quantum readout-error mitigation for sparse measurement outcomes of near-term quantum devices

Bo Yang, Rudy Raymond, Shumpei Uno

The readout error on near-term quantum devices is one of the dominant noise factors, which can be mitigated by classical postprocessing called quantum readout error mitigation (QREM). The standard QREM applies the inverse of noise calibration matrix to the outcome probability distribution using exponential computational resources to the number of measured qubits. This becomes infeasible for the current quantum devices with tens of qubits or more. Here we propose two efficient QREM methods finishing in $O(n{s}^{2})$ time for probability distributions of $n$ qubits and $s$ shots, which mainly aim at mitigating sparse probability distributions such that only a few states are dominant. We compare the proposed methods with several recent QREM methods in the following three cases: expectation values of the GHZ state, its fidelities, and the estimation error of maximum likelihood amplitude estimation (MLAE) algorithm with a modified Grover iterator. The two cases of the GHZ state are on real IBM quantum devices, while the third is with numerical simulation. Using the proposed method, the mitigation of the 65-qubit GHZ state takes only a few seconds, and we witness the fidelity of the 29-qubit GHZ state exceeding 0.5. The proposed methods also succeed in reducing the estimation error in the MLAE algorithm, outperforming the results by other QREM methods in general.

arXiv:2201.11046•Physical Review A•Jul 18, 2022•37 citations

Statistical Signal Processing for Quantum Error Mitigation

Kausthubh Chandramouli, Kelly Mae Allen, Christopher Mori +2 more

In the noisy intermediate-scale quantum (NISQ) era, quantum error mitigation (QEM) is essential for producing reliable outputs from quantum circuits. We present a statistical signal processing approach to QEM that estimates the most likely noiseless outputs from noisy quantum measurements. Our model assumes that circuit depth is sufficient for depolarizing noise, producing corrupted observations that resemble a uniform distribution alongside classical bit-flip errors from readout. Our method consists of two steps: a filtering stage that discards uninformative depolarizing noise and an expectation-maximization (EM) algorithm that computes a maximum likelihood (ML) estimate over the remaining data. We demonstrate the effectiveness of this approach on small-qubit systems using circuit simulations in Qiskit and IBM quantum processing unit (QPU) data, and compare its performance to contemporary statistical QEM techniques. We also show that our method scales to larger qubit counts using synthetically generated data consistent with our noise model. These results suggest that principled statistical methods can offer scalable and interpretable solutions for quantum error mitigation in realistic NISQ settings.

arXiv:2506.00683•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Mitigating measurement errors in multiqubit experiments

Sergey B. Bravyi, Sarah Sheldon, Abhinav Kandala +2 more

Reducing measurement errors in multiqubit quantum devices is critical for performing any quantum algorithm. Here we show how to mitigate measurement errors by a classical postprocessing of the measured outcomes. Our techniques apply to any experiment where measurement outcomes are used for computing expected values of observables. Two error-mitigation schemes are presented based on tensor product and correlated Markovian noise models. Error rates parametrizing these noise models can be extracted from the measurement calibration data using a simple formula. Error mitigation is achieved by applying the inverse noise matrix to a probability vector that represents the outcomes of a noisy measurement. The error-mitigation overhead, including the number of measurements and the cost of the classical postprocessing, is exponential in $\ensuremath{\epsilon}n$, where $\ensuremath{\epsilon}$ is the maximum error rate and $n$ is the number of qubits. We report experimental demonstration of our error-mitigation methods on IBM Quantum devices using stabilizer measurements for graph states with $n\ensuremath{\le}12$ qubits and entangled 20-qubit states generated by low-depth random Clifford circuits.

arXiv:2006.14044•Physical Review A•Apr 9, 2021•335 citations

Quantum error mitigation via quantum-noise-effect circuit groups

Yusuke Hama, Hirofumi Nishi

Near-term quantum computers have been built as intermediate-scale quantum devices and are fragile against quantum noise effects, namely, NISQ devices. Traditional quantum-error-correcting codes are not implemented on such devices and to perform quantum computation in good accuracy with these machines we need to develop alternative approaches for mitigating quantum computational errors. In this work, we propose quantum error mitigation (QEM) scheme for quantum computational errors which occur due to couplings with environments during gate operations, i.e., decoherence. To establish our QEM scheme, first we estimate the quantum noise effects on single-qubit states and represent them as groups of quantum circuits, namely, quantum-noise-effect circuit groups. Then our QEM scheme is conducted by subtracting expectation values generated by the quantum-noise-effect circuit groups from those obtained by the quantum circuits for the quantum algorithms under consideration. As a result, the quantum noise effects are reduced, and we obtain approximately the ideal expectation values via the quantum-noise-effect circuit groups and the numbers of elementary quantum circuits composing them scale polynomial with respect to the products of the depths of quantum algorithms and the numbers of register bits. To numerically demonstrate the validity of our QEM scheme, we run noisy quantum simulations of qubits under amplitude damping effects for four types of quantum algorithms. Furthermore, we implement our QEM scheme on IBM Q Experience processors and examine its efficacy. Consequently, the validity of our scheme is verified via both the quantum simulations and the quantum computations on the real quantum devices. Our QEM scheme is solely composed of quantum-computational operations (quantum gates and measurements), and thus, it can be conducted by any type of quantum device. In addition, it can be applied to error mitigation for many other types of quantum noise effects as well as noisy quantum computing of long-depth quantum algorithms.

arXiv:2205.13907•Scientific Reports•Mar 13, 2024•9 citations

Extending Shor's Quantum Error Correction Circuits Using Quantum Adders

Shadman Shahriar, A. B. M. Alim Al Islam

One of the critical limitations quantum computers are yet to overcome is quantum errors. Efforts have been made in quantum error correction fields to overcome them. However, since we are bound by the technology of this noisy intermediate-scale quantum era, it is important that we focus on the efficiency and optimization of our error correction circuits. In this paper, we present a way of extending quantum error correction circuits using quantum adders by utilizing the notion of majority voting over all the qubits. We use adder circuits and a comparator to achieve majority voting. We demonstrate how our proposed methodology exhibits a linear trend in the required number of quantum gates. Further, we confirm the accuracy and efficacy of our proposed methodology for optimizing the number of quantum gates through extensive simulation in IBM's Qiskit and compare them with existing literature.

Globecom•Dec 4, 2023•2 citations

Exponential measurement error mitigation in quantum sampling

He-Liang Huang

Abstract Measurement errors limit the fidelity of sampling-based quantum tasks, yet extending error mitigation to sampling remains challenging. Here, we introduce a simple and scalable repetition-based scheme that mitigates measurement errors directly at the sampling level. By encoding each data qubit into multiple physical qubits prior to readout and applying majority-vote decoding, physical errors are converted into a higher-order process, enabling exponential suppression that persists despite realistic gate imperfections during encoding. Using experimental noise profiles from leading superconducting platforms, we demonstrate that a modest linear qubit overhead suppresses measurement errors by several orders of magnitude, significantly boosting fidelities for typical sampling tasks, such as measurement-based quantum computation and random circuit sampling. These results establish a practical, hardware-compatible, and scalable approach for improving the reliability of near-term quantum sampling experiments.

npj Unconventional Computing•Aug 31, 2026•0 citations
Quantum error mitigation is an important technique to reduce the impact of noise in quantum computers. With more and more qubits being supported on quantum computers, there are two emerging fundamental challenges. First, the number of shots required for quantum algorithms with large numbers of qubits needs to increase in order to obtain a meaningful distribution or expected value of an observable. Second, although steady progress has been made in improving the fidelity of each qubit, circuits with a large number of qubits are likely to produce erroneous results. This low-shot, high-noise regime calls for highly scalable error mitigation techniques. In this paper, we propose a simple and effective mitigation scheme, qubit-wise majority vote, for quantum algorithms with a single correct output. We show that our scheme produces the maximum likelihood (ML) estimate under certain assumptions and bound the number of shots required. Our experimental results on real quantum devices confirm that our proposed approach requires fewer shots than existing ones, and can sometimes recover the correct answers even when they are not observed from the measurement results.
The readout error on near-term quantum devices is one of the dominant noise factors, which can be mitigated by classical postprocessing called quantum readout error mitigation (QREM). The standard QREM applies the inverse of noise calibration matrix to the outcome probability distribution using exponential computational resources to the number of measured qubits. This becomes infeasible for the current quantum devices with tens of qubits or more. Here we propose two efficient QREM methods finishing in O(ns2)O(n{s}^{2})O(ns2) time for probability distributions of nnn qubits and sss shots, which mainly aim at mitigating sparse probability distributions such that only a few states are dominant. We compare the proposed methods with several recent QREM methods in the following three cases: expectation values of the GHZ state, its fidelities, and the estimation error of maximum likelihood amplitude estimation (MLAE) algorithm with a modified Grover iterator. The two cases of the GHZ state are on real IBM quantum devices, while the third is with numerical simulation. Using the proposed method, the mitigation of the 65-qubit GHZ state takes only a few seconds, and we witness the fidelity of the 29-qubit GHZ state exceeding 0.5. The proposed methods also succeed in reducing the estimation error in the MLAE algorithm, outperforming the results by other QREM methods in general.
In the noisy intermediate-scale quantum (NISQ) era, quantum error mitigation (QEM) is essential for producing reliable outputs from quantum circuits. We present a statistical signal processing approach to QEM that estimates the most likely noiseless outputs from noisy quantum measurements. Our model assumes that circuit depth is sufficient for depolarizing noise, producing corrupted observations that resemble a uniform distribution alongside classical bit-flip errors from readout. Our method consists of two steps: a filtering stage that discards uninformative depolarizing noise and an expectation-maximization (EM) algorithm that computes a maximum likelihood (ML) estimate over the remaining data. We demonstrate the effectiveness of this approach on small-qubit systems using circuit simulations in Qiskit and IBM quantum processing unit (QPU) data, and compare its performance to contemporary statistical QEM techniques. We also show that our method scales to larger qubit counts using synthetically generated data consistent with our noise model. These results suggest that principled statistical methods can offer scalable and interpretable solutions for quantum error mitigation in realistic NISQ settings.
Reducing measurement errors in multiqubit quantum devices is critical for performing any quantum algorithm. Here we show how to mitigate measurement errors by a classical postprocessing of the measured outcomes. Our techniques apply to any experiment where measurement outcomes are used for computing expected values of observables. Two error-mitigation schemes are presented based on tensor product and correlated Markovian noise models. Error rates parametrizing these noise models can be extracted from the measurement calibration data using a simple formula. Error mitigation is achieved by applying the inverse noise matrix to a probability vector that represents the outcomes of a noisy measurement. The error-mitigation overhead, including the number of measurements and the cost of the classical postprocessing, is exponential in $\ensuremath{\epsilon}n$, where $\ensuremath{\epsilon}$ is the maximum error rate and nnn is the number of qubits. We report experimental demonstration of our error-mitigation methods on IBM Quantum devices using stabilizer measurements for graph states with $n\ensuremath{\le}12$ qubits and entangled 20-qubit states generated by low-depth random Clifford circuits.
Near-term quantum computers have been built as intermediate-scale quantum devices and are fragile against quantum noise effects, namely, NISQ devices. Traditional quantum-error-correcting codes are not implemented on such devices and to perform quantum computation in good accuracy with these machines we need to develop alternative approaches for mitigating quantum computational errors. In this work, we propose quantum error mitigation (QEM) scheme for quantum computational errors which occur due to couplings with environments during gate operations, i.e., decoherence. To establish our QEM scheme, first we estimate the quantum noise effects on single-qubit states and represent them as groups of quantum circuits, namely, quantum-noise-effect circuit groups. Then our QEM scheme is conducted by subtracting expectation values generated by the quantum-noise-effect circuit groups from those obtained by the quantum circuits for the quantum algorithms under consideration. As a result, the quantum noise effects are reduced, and we obtain approximately the ideal expectation values via the quantum-noise-effect circuit groups and the numbers of elementary quantum circuits composing them scale polynomial with respect to the products of the depths of quantum algorithms and the numbers of register bits. To numerically demonstrate the validity of our QEM scheme, we run noisy quantum simulations of qubits under amplitude damping effects for four types of quantum algorithms. Furthermore, we implement our QEM scheme on IBM Q Experience processors and examine its efficacy. Consequently, the validity of our scheme is verified via both the quantum simulations and the quantum computations on the real quantum devices. Our QEM scheme is solely composed of quantum-computational operations (quantum gates and measurements), and thus, it can be conducted by any type of quantum device. In addition, it can be applied to error mitigation for many other types of quantum noise effects as well as noisy quantum computing of long-depth quantum algorithms.
One of the critical limitations quantum computers are yet to overcome is quantum errors. Efforts have been made in quantum error correction fields to overcome them. However, since we are bound by the technology of this noisy intermediate-scale quantum era, it is important that we focus on the efficiency and optimization of our error correction circuits. In this paper, we present a way of extending quantum error correction circuits using quantum adders by utilizing the notion of majority voting over all the qubits. We use adder circuits and a comparator to achieve majority voting. We demonstrate how our proposed methodology exhibits a linear trend in the required number of quantum gates. Further, we confirm the accuracy and efficacy of our proposed methodology for optimizing the number of quantum gates through extensive simulation in IBM's Qiskit and compare them with existing literature.
Abstract Measurement errors limit the fidelity of sampling-based quantum tasks, yet extending error mitigation to sampling remains challenging. Here, we introduce a simple and scalable repetition-based scheme that mitigates measurement errors directly at the sampling level. By encoding each data qubit into multiple physical qubits prior to readout and applying majority-vote decoding, physical errors are converted into a higher-order process, enabling exponential suppression that persists despite realistic gate imperfections during encoding. Using experimental noise profiles from leading superconducting platforms, we demonstrate that a modest linear qubit overhead suppresses measurement errors by several orders of magnitude, significantly boosting fidelities for typical sampling tasks, such as measurement-based quantum computation and random circuit sampling. These results establish a practical, hardware-compatible, and scalable approach for improving the reliability of near-term quantum sampling experiments.