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:2304.08528 · Physical Review Letters

Superposed Quantum Error Mitigation

Jorge Miguel-Ramiro, Zheng Shi, Luca Dellantonio, Albie Chan, Christine A. Muschik, Wolfgang Dür

Published Dec 5, 2023• 19 citations
arXivHTMLPDF

Abstract

Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary states. We demonstrate, numerically and on the IBM Quantum Platform, that parallel applications of the same operation lead to significant noise mitigation when arbitrary noise processes are considered. We first design probabilistic implementations of our scheme that are plug and play, independent of the noise characteristic and require no postprocessing. We then enhance the success probability (up to deterministic) using adaptive corrections. We provide an analysis of our protocol performance and demonstrate that unit fidelity can be achieved asymptotically. Our approaches are suitable to both standard gate-based and measurement-based computational models.

DOI
10.1103/physrevlett.131.230601

Related papers

Enhancing quantum computation via superposition of quantum gates

Jorge Miguel-Ramiro, Zheng Shi, Luca Dellantonio +3 more

Overcoming the influence of noise and imperfections in quantum devices is one of the main challenges for viable quantum applications. In this article, we present different protocols, which we denote as ``superposed quantum error mitigation,'' that enhance the fidelity of single gates or entire computations by performing them in coherent superposition. Our results demonstrate that via our methods, significant noise suppression can be achieved for most kinds of decoherence and standard experimental parameter regimes. Our protocols can be either deterministic, such that the outcome is never postselected, or probabilistic, in which case the resulting state must be discarded unless a well-specified condition is met. By using sufficiently many resources and working under broad assumptions, our methods can yield the desired output state with unit fidelity. Finally, we analyze our approach for gate-based, measurement-based, and interferometric-based models, demonstrating the applicability in all cases and investigating the fundamental mechanisms they rely upon.

arXiv:2304.08529•Physical Review A•Dec 5, 2023•20 citations

Demonstrating Noise-adapted Quantum Error Correction With Break-Even Performance

Vismay Joshi, Anubhab Rudra, Sourav Dutta +2 more

The promise of quantum computing is closer to reality today than ever before, thanks to rapid progress in the development of quantum hardware. Even as qubit lifetimes and gate fidelities continue to improve, realizing robust, fault-tolerant quantum computers is contingent upon the successful implementation of quantum error correction (QEC). Conventional QEC schemes have rather high resource overheads and low threshold requirements, making them challenging to implement on present day hardware. Here, we use a recently developed noise-adapted 3-qubit QEC scheme to demonstrate break-even performance against native amplitude-damping (AD) noise on IBM quantum hardware. We use variational quantum circuits to construct hardware-efficient encoding and decoding circuits. This scheme is probabilistic due to the non-unitary nature of the recovery operators, which are implemented via the block-encoding technique. We demonstrate logical qubit lifetimes exceeding those of the physical qubits by performing multiple rounds of QEC. To further protect the qubits from dephasing due to crosstalk, we incorporate dynamical decoupling into our noise-adapted QEC scheme in a seamless fashion. To account for the post-selection overhead, we define a measure of gain, that allows for faithful performance benchmarking of the protocol. Our analysis suggests that the performance of our protocol is limited primarily by the measurement readout fidelity, and is bound to improve with successive generations of quantum processors.

quant-pharXiv:2603.04564•Mar 6, 2026•3 citations

New methods in quantum error correction and fault-tolerant quantum computing

Christopher Chamberland

Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.

•Oct 22, 2018•0 citations

Advancements in Quantum Error Mitigation Strategies for Reliable Quantum Computing on IBM Simulators

L. Sherin Beevi, P. M. Joe Prathap, Sudhish Reddy D +2 more

We explore the field of quantum computing and specifically address the crucial problem of error reduction in the context of IBM simulators. Although quantum computing is a rapidly developing technology with great potential, its practical applications are severely hindered by its inherent error-proneness. We tackle this problem by introducing new developments in quantum error correction techniques designed for IBM simulators. In contrast to conventional methods that frequently depend on large matrices or pre-established error models; our technique presents a flexible and dynamic approach. By utilizing several variations of a main circuit, in which classically efficient gates are used in place of non-Clifford gates, we are able to discover the best compensation scheme from scratch for actual quantum systems. The suggested method exhibits great flexibility in handling different levels of noise and different kinds of noise, such as spatially and temporally correlated variations. It also effectively reduces errors on IBM quantum hardware as well as precisely emulated imperfect quantum computers. By offering a thorough investigation of sophisticated error mitigation techniques, this research advances the continuing quest for dependable quantum computations and opens up interesting new directions for improving both the accuracy and performance of quantum computing operations carried out on IBM simulators.

International Conference on Emerging Smart Computing and Informatics (ESCI)•Mar 5, 2024•6 citations

Application of zero-noise-extrapolation-based quantum error mitigation to a silicon spin qubit

Hanseo Sohn, Jaewon Jung, Jaemin Park +5 more

As quantum computing advances towards practical applications, reducing errors remains a crucial frontier for developing near-term devices. Errors in the quantum gates and quantum state readout could result in noisy circuits, which would prevent the acquisition of the exact expectation values of the observables. Although ultimate robustness to errors is known to be achievable by quantum error correction-based fault-tolerant quantum computing, its successful implementation demands large-scale quantum processors with low average error rates that are not yet widely available. In contrast, quantum error mitigation (QEM) offers more immediate and practical techniques, which do not require extensive resources and can be readily applied to existing quantum devices to improve the accuracy of the expectation values. Here, we report the implementation of a zero-noise extrapolation-based error mitigation technique on a silicon spin qubit platform. This technique has recently been successfully demonstrated for other platforms such as superconducting qubits, trapped-ion qubits, and photonic processors. We first explore three methods for amplifying noise on a silicon spin qubit: global folding, local folding, and pulse stretching, using a standard randomized benchmarking protocol. We then apply global folding-based zero-noise extrapolation to the state tomography and achieve a state fidelity of 99.96% (98.52%), compared to the unmitigated fidelity of 75.82% (82.16%) for different preparation states. The results show that the zero-noise extrapolation technique is a versatile approach that is generally adaptable to quantum computing platforms with different noise characteristics through appropriate noise amplification methods.

arXiv:2410.10339•Physical Review A•May 13, 2025•6 citations

Optimal and robust error filtration for quantum information processing

Aaqib Ali, Giovanni Scala, Cosmo Lupo

Error filtration is a hardware scheme that mitigates noise by exploiting auxiliary qubits and entangling gates. Although both the signal and ancillae are subject to local noise, constructive interference and postselection allow us to reduce the noise level in the signal qubit. Here we highlight the relation between error filtration and error detection codes and determine the optimal codes that make the qubits interfere most effectively. We examine our optimized scheme under imperfect implementation, where ancillary qubits may be noisy or subject to crosstalk. Even with these imperfections, we find that adding more ancillary qubits helps to protect quantum information. We benchmark our approach against figures of merit that correspond to different applications, including entanglement fidelity, quantum Fisher information (for applications in quantum sensing), and the Clauser-Horne-Shimony-Holt value (for cryptographic applications), with one, two, and three ancillary qubits. By using the entanglement fidelity as a figure of merit, we suggest a general condition for error filtration, and for one and two ancillae, we obtain some explicit expressions for the optimal codes. We also compare our method with the recently introduced superposed quantum error mitigation (SQEM) scheme based on superposition of causal orders and show that, for a wide range of noise strengths, our approach may outperform SQEM in terms of effectiveness and robustness.

arXiv:2409.01398•Physical Review A•Sep 9, 2025•1 citation
Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary states. We demonstrate, numerically and on the IBM Quantum Platform, that parallel applications of the same operation lead to significant noise mitigation when arbitrary noise processes are considered. We first design probabilistic implementations of our scheme that are plug and play, independent of the noise characteristic and require no postprocessing. We then enhance the success probability (up to deterministic) using adaptive corrections. We provide an analysis of our protocol performance and demonstrate that unit fidelity can be achieved asymptotically. Our approaches are suitable to both standard gate-based and measurement-based computational models.
Overcoming the influence of noise and imperfections in quantum devices is one of the main challenges for viable quantum applications. In this article, we present different protocols, which we denote as ``superposed quantum error mitigation,'' that enhance the fidelity of single gates or entire computations by performing them in coherent superposition. Our results demonstrate that via our methods, significant noise suppression can be achieved for most kinds of decoherence and standard experimental parameter regimes. Our protocols can be either deterministic, such that the outcome is never postselected, or probabilistic, in which case the resulting state must be discarded unless a well-specified condition is met. By using sufficiently many resources and working under broad assumptions, our methods can yield the desired output state with unit fidelity. Finally, we analyze our approach for gate-based, measurement-based, and interferometric-based models, demonstrating the applicability in all cases and investigating the fundamental mechanisms they rely upon.
The promise of quantum computing is closer to reality today than ever before, thanks to rapid progress in the development of quantum hardware. Even as qubit lifetimes and gate fidelities continue to improve, realizing robust, fault-tolerant quantum computers is contingent upon the successful implementation of quantum error correction (QEC). Conventional QEC schemes have rather high resource overheads and low threshold requirements, making them challenging to implement on present day hardware. Here, we use a recently developed noise-adapted 3-qubit QEC scheme to demonstrate break-even performance against native amplitude-damping (AD) noise on IBM quantum hardware. We use variational quantum circuits to construct hardware-efficient encoding and decoding circuits. This scheme is probabilistic due to the non-unitary nature of the recovery operators, which are implemented via the block-encoding technique. We demonstrate logical qubit lifetimes exceeding those of the physical qubits by performing multiple rounds of QEC. To further protect the qubits from dephasing due to crosstalk, we incorporate dynamical decoupling into our noise-adapted QEC scheme in a seamless fashion. To account for the post-selection overhead, we define a measure of gain, that allows for faithful performance benchmarking of the protocol. Our analysis suggests that the performance of our protocol is limited primarily by the measurement readout fidelity, and is bound to improve with successive generations of quantum processors.
Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.
We explore the field of quantum computing and specifically address the crucial problem of error reduction in the context of IBM simulators. Although quantum computing is a rapidly developing technology with great potential, its practical applications are severely hindered by its inherent error-proneness. We tackle this problem by introducing new developments in quantum error correction techniques designed for IBM simulators. In contrast to conventional methods that frequently depend on large matrices or pre-established error models; our technique presents a flexible and dynamic approach. By utilizing several variations of a main circuit, in which classically efficient gates are used in place of non-Clifford gates, we are able to discover the best compensation scheme from scratch for actual quantum systems. The suggested method exhibits great flexibility in handling different levels of noise and different kinds of noise, such as spatially and temporally correlated variations. It also effectively reduces errors on IBM quantum hardware as well as precisely emulated imperfect quantum computers. By offering a thorough investigation of sophisticated error mitigation techniques, this research advances the continuing quest for dependable quantum computations and opens up interesting new directions for improving both the accuracy and performance of quantum computing operations carried out on IBM simulators.
As quantum computing advances towards practical applications, reducing errors remains a crucial frontier for developing near-term devices. Errors in the quantum gates and quantum state readout could result in noisy circuits, which would prevent the acquisition of the exact expectation values of the observables. Although ultimate robustness to errors is known to be achievable by quantum error correction-based fault-tolerant quantum computing, its successful implementation demands large-scale quantum processors with low average error rates that are not yet widely available. In contrast, quantum error mitigation (QEM) offers more immediate and practical techniques, which do not require extensive resources and can be readily applied to existing quantum devices to improve the accuracy of the expectation values. Here, we report the implementation of a zero-noise extrapolation-based error mitigation technique on a silicon spin qubit platform. This technique has recently been successfully demonstrated for other platforms such as superconducting qubits, trapped-ion qubits, and photonic processors. We first explore three methods for amplifying noise on a silicon spin qubit: global folding, local folding, and pulse stretching, using a standard randomized benchmarking protocol. We then apply global folding-based zero-noise extrapolation to the state tomography and achieve a state fidelity of 99.96% (98.52%), compared to the unmitigated fidelity of 75.82% (82.16%) for different preparation states. The results show that the zero-noise extrapolation technique is a versatile approach that is generally adaptable to quantum computing platforms with different noise characteristics through appropriate noise amplification methods.
Error filtration is a hardware scheme that mitigates noise by exploiting auxiliary qubits and entangling gates. Although both the signal and ancillae are subject to local noise, constructive interference and postselection allow us to reduce the noise level in the signal qubit. Here we highlight the relation between error filtration and error detection codes and determine the optimal codes that make the qubits interfere most effectively. We examine our optimized scheme under imperfect implementation, where ancillary qubits may be noisy or subject to crosstalk. Even with these imperfections, we find that adding more ancillary qubits helps to protect quantum information. We benchmark our approach against figures of merit that correspond to different applications, including entanglement fidelity, quantum Fisher information (for applications in quantum sensing), and the Clauser-Horne-Shimony-Holt value (for cryptographic applications), with one, two, and three ancillary qubits. By using the entanglement fidelity as a figure of merit, we suggest a general condition for error filtration, and for one and two ancillae, we obtain some explicit expressions for the optimal codes. We also compare our method with the recently introduced superposed quantum error mitigation (SQEM) scheme based on superposition of causal orders and show that, for a wide range of noise strengths, our approach may outperform SQEM in terms of effectiveness and robustness.