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.08529 · Physical Review A

Enhancing quantum computation via superposition of quantum gates

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

Published Dec 5, 2023• 20 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.108.062604

Related papers

Superposed Quantum Error Mitigation

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

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.

arXiv:2304.08528•Physical Review Letters•Dec 5, 2023•19 citations

Efficiently improving the performance of noisy quantum computers

Samuele Ferracin, Akel Hashim, Jean-Loup Ville +7 more

Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named ``Noiseless Output Extrapolation" and ``Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 86% improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.

arXiv:2201.10672•Quantum•Jul 15, 2024•72 citations

Detecting and eliminating quantum noise of quantum measurements

Shuanghong Tang, Congcong Zheng, Kun Wang

Abstract Quantum measurements are crucial for extracting information from quantum systems, but they are error-prone due to hardware imperfections in near-term devices. Measurement errors can be mitigated through classical post-processing, based on the assumption of a classical noise model. However, the coherence of quantum measurements leads to unavoidable quantum noise that defies this assumption. In this work, we introduce a two-stage procedure to systematically tackle such quantum noise in measurements. The idea is intuitive: we first detect and then eliminate quantum noise. In the first stage, inspired by coherence witness in the resource theory of quantum coherence, we design an efficient method to detect quantum noise. It works by fitting the difference between two measurement statistics to the Fourier series, where the statistics are obtained using maximally coherent states with relative phase and maximally mixed states as inputs. The fitting coefficients quantitatively benchmark quantum noise. In the second stage, we design various methods to eliminate quantum noise, inspired by the Pauli twirling technique. They work by executing randomly sampled Pauli gates before the measurement device and conditionally flipping the measurement outcomes in such a way that the effective measurement device contains only classical noise. We numerically demonstrate the two-stage procedure’s feasibility on the Baidu Quantum Platform. Notably, the results reveal significant suppression of quantum noise in measurement devices and substantial enhancement in quantum computation accuracy. We highlight that the two-stage procedure complements existing measurement error mitigation techniques, and they together form a standard toolbox for manipulating measurement errors in near-term quantum devices.

arXiv:2206.13743•Physica Scripta•Sep 12, 2024•6 citations

Error-Mitigated Quantum Routing on Noisy Devices

Wenbo Shi, Robert Malaney

With sub-threshold quantum error correction on quantum hardware still out of reach, quantum error mitigation methods are currently deemed an attractive option for implementing certain applications on near-term noisy quantum devices. One such application is quantum routing - the ability to map an incoming quantum signal into a superposition of paths. In this work, we use a 7-qubit IBM quantum device to experimentally deploy two promising quantum error mitigation methods, Zero-Noise Extrapolation (ZNE) and Probabilistic Error Cancellation (PEC), in the context of quantum routing. Importantly, beyond investigating the improved performance of quantum routing via ZNE and PEC separately, we also investigate the routing performance provided by the concatenation of these two error-mitigation methods. Our experimental results demonstrate that such concatenation leads a very significant performance improvement relative to implementation with no error mitigation. Indeed, an almost perfect performance in terms of fidelity of the output entangled paths is found. These new results reveal that with concatenated quantum error-mitigation embedded, useful quantum routing becomes feasible on current devices without the need for quantum error correction - opening up a potential implementation pathway to other applications that utilize a superposition of communication links.

arXiv:2305.13574•Globecom•Dec 4, 2023•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

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 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.
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.
Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named ``Noiseless Output Extrapolation" and ``Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 86% improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.
Abstract Quantum measurements are crucial for extracting information from quantum systems, but they are error-prone due to hardware imperfections in near-term devices. Measurement errors can be mitigated through classical post-processing, based on the assumption of a classical noise model. However, the coherence of quantum measurements leads to unavoidable quantum noise that defies this assumption. In this work, we introduce a two-stage procedure to systematically tackle such quantum noise in measurements. The idea is intuitive: we first detect and then eliminate quantum noise. In the first stage, inspired by coherence witness in the resource theory of quantum coherence, we design an efficient method to detect quantum noise. It works by fitting the difference between two measurement statistics to the Fourier series, where the statistics are obtained using maximally coherent states with relative phase and maximally mixed states as inputs. The fitting coefficients quantitatively benchmark quantum noise. In the second stage, we design various methods to eliminate quantum noise, inspired by the Pauli twirling technique. They work by executing randomly sampled Pauli gates before the measurement device and conditionally flipping the measurement outcomes in such a way that the effective measurement device contains only classical noise. We numerically demonstrate the two-stage procedure’s feasibility on the Baidu Quantum Platform. Notably, the results reveal significant suppression of quantum noise in measurement devices and substantial enhancement in quantum computation accuracy. We highlight that the two-stage procedure complements existing measurement error mitigation techniques, and they together form a standard toolbox for manipulating measurement errors in near-term quantum devices.
With sub-threshold quantum error correction on quantum hardware still out of reach, quantum error mitigation methods are currently deemed an attractive option for implementing certain applications on near-term noisy quantum devices. One such application is quantum routing - the ability to map an incoming quantum signal into a superposition of paths. In this work, we use a 7-qubit IBM quantum device to experimentally deploy two promising quantum error mitigation methods, Zero-Noise Extrapolation (ZNE) and Probabilistic Error Cancellation (PEC), in the context of quantum routing. Importantly, beyond investigating the improved performance of quantum routing via ZNE and PEC separately, we also investigate the routing performance provided by the concatenation of these two error-mitigation methods. Our experimental results demonstrate that such concatenation leads a very significant performance improvement relative to implementation with no error mitigation. Indeed, an almost perfect performance in terms of fidelity of the output entangled paths is found. These new results reveal that with concatenated quantum error-mitigation embedded, useful quantum routing becomes feasible on current devices without the need for quantum error correction - opening up a potential implementation pathway to other applications that utilize a superposition of communication links.
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.
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.