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:2205.13454 · Quantum

The battle of clean and dirty qubits in the era of partial error correction

Daniel Bultrini, Samson Wang, Piotr Czarnik, Max Hunter Gordon, Marco Cerezo, Patrick J. Coles, Łukasz Cincio

Published Jul 13, 2023• 19 citations
arXivHTMLPDF

Abstract

When error correction becomes possible it will be necessary to dedicate a large number of physical qubits to each logical qubit. Error correction allows for deeper circuits to be run, but each additional physical qubit can potentially contribute an exponential increase in computational space, so there is a trade-off between using qubits for error correction or using them as noisy qubits. In this work we look at the effects of using noisy qubits in conjunction with noiseless qubits (an idealized model for error-corrected qubits), which we call the "clean and dirty" setup. We employ analytical models and numerical simulations to characterize this setup. Numerically we show the appearance of Noise-Induced Barren Plateaus (NIBPs), i.e., an exponential concentration of observables caused by noise, in an Ising model Hamiltonian variational ansatz circuit. We observe this even if only a single qubit is noisy and given a deep enough circuit, suggesting that NIBPs cannot be fully overcome simply by error-correcting a subset of the qubits. On the positive side, we find that for every noiseless qubit in the circuit, there is an exponential suppression in concentration of gradient observables, showing the benefit of partial error correction. Finally, our analytical models corroborate these findings by showing that observables concentrate with a scaling in the exponent related to the ratio of dirty-to-total qubits.

DOI
10.22331/q-2023-07-13-1060

Related papers

A framework of partial error correction for intermediate-scale quantum computers

Nikolaos Koukoulekidis, Samson Wang, Tom O’Leary +3 more

Abstract As quantum computing hardware steadily increases in qubit count and quality, one important question is how to allocate these resources to mitigate the effects of hardware noise. In a transitional era between noisy small-scale and fully fault-tolerant systems, we envisage a scenario in which we are only able to error-correct a fraction of the qubits required to perform an interesting computation. In this work, we develop concrete constructions of logical operations on a joint system of a collection of noisy and a collection of error-corrected logical qubits. Within this setting and under Pauli noise assumptions, we provide analytic evidence that brick-layered circuits display on average slower concentration to the “useless” uniform distribution with increasing circuit depth compared to fully noisy circuits. We corroborate these findings by numerical demonstration of slower decoherence with an increasing fraction of error-corrected qubits under depolarizing noise acting at the circuit level. We find that this advantage only manifests when the number of error-corrected qubits passes a specified threshold which depends on the number of couplings between error-corrected and noisy registers.

arXiv:2306.15531•npj Quantum Information•Jul 1, 2026•12 citations

Noise-induced barren plateaus in variational quantum algorithms

Samson Wang, Enrico Fontana, Marco Cerezo +4 more

Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.

arXiv:2007.14384•Nature Communications•Nov 29, 2021•1,006 citations

Exponential Error Suppression for Near-Term Quantum Devices

Bálint Koczor

Suppressing noise in physical systems is of fundamental importance.As quantum computers mature, quantum error correcting codes (QECs) will be adopted in order to suppress errors to any desired level.However in the noisy, intermediate-scale quantum (NISQ) era, the complexity and scale required to adopt even the smallest QEC is prohibitive: a single logical qubit needs to be encoded into many thousands of physical qubits.Here we show that, for the crucial case of estimating expectation values of observables (key to almost all NISQ algorithms) one can indeed achieve an effective exponential suppression.We take n independently prepared circuit outputs to create a state whose symmetries prevent errors from contributing bias to the expected value.The approach is very well suited for current and near-term quantum devices as it is modular in the main computation and requires only a shallow circuit that bridges the n copies immediately prior to measurement.Using no more than four circuit copies, we confirm error suppression below 10 -6 for circuits consisting of several hundred noisy gates (2-qubit gate error 0.5%) in numerical simulations validating our approach.

arXiv:2011.05942•Physical Review X•Sep 15, 2021•183 citations

Mitigating Noise-Induced Barren Plateaus Using a Non-Unitary Ansatz: Application to Molecular Electronic Transport

Sasanka Dowarah, Abeda Sultana Shamma, Yazdan Maghsoud +2 more

Variational quantum algorithms (VQAs) offer a promising route toward simulating many-body quantum systems on noisy intermediate-scale quantum (NISQ) hardware. However, their scalability is severely limited by noise-induced barren plateaus (NIBPs), where hardware noise causes the gradients of the cost function to vanish exponentially with circuit depth, rendering optimization impossible. In this work, we demonstrate that introducing nonunitary elements into the variational ansatz can mitigate NIBPs in open-quantum systems. Using an analytically tractable infinite-range dissipative Ising model, we show that a nonunitary ansatz restores finite gradients in the presence of depolarizing noise, enabling convergence to the correct symmetry-broken steady state. We also develop a Floquet-type variational ansatz in which each layer repeats the same parameters, reducing the deep variational circuit to an effective quantum channel whose fixed points can be analyzed directly. We then extend these ideas to a realistic quantum-chemistry system by simulating electron transport through Oligophenylethynylene-sulfurmethyl (OPE-SMe) using Hamiltonians and jump operators of the model derived from first-principles polarizable QM/MM calculations. Our results show that nonunitary variational ansätze provide a scalable and physically grounded route for simulating open-system steady states on NISQ hardware, offering a pathway to overcoming one of the limitations of current quantum hardware.

quant-pharXiv:2605.30572•Jun 1, 2026•0 citations

Noise-induced shallow circuits and the absence of barren plateaus

Antonio Anna Mele, Armando Angrisani, Soumik Ghosh +4 more

Without a successful implementation of fault-tolerant quantum error correction, calculations on quantum computers are subject to noise that limits their capabilities. Here, motivated by realistic near-term hardware considerations, we study the impact of uncorrected local noise on logical quantum circuits. We first show that, in the task of estimating observable expectation values, any noise effectively truncates most quantum circuits to logarithmic depth. We then prove that quantum circuits under any non-unital noise do not exhibit barren plateaus for cost functions composed of local observables. However, by using the effective shallowness, we also design an efficient classical algorithm to estimate observable expectation values within any constant additive accuracy, with high probability over the choice of the circuit, in any circuit architecture. Taken together, our results establish that, unless we carefully engineer quantum circuits to take advantage of the noise, noisy quantum circuits are unlikely to offer an advantage over shallow ones for algorithms that output observable expectation value estimates, such as many variational quantum machine learning proposals.

arXiv:2403.13927•Nature Physics•Apr 2, 2026•77 citations

Qubit-efficient exponential suppression of errors

Piotr Czarnik, Andrew Arrasmith, Łukasz Cincio +1 more

Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of exponentially suppressing errors by preparing multiple noisy copies of a state and virtually distilling a more purified version. Here we present an alternative method, the Resource-Efficient Quantum Error Suppression Technique (REQUEST), that adapts this breakthrough to much fewer qubits by making use of active qubit resets, a feature now available on commercial platforms. Our approach exploits a space/time trade-off to achieve a similar error reduction using only $2N+1$ qubits as opposed to $MN+1$ qubits, for $M$ copies of an $N$ qubit state. Additionally, we propose a method using near-Clifford circuits to find the optimal number of these copies in the presence of realistic noise, which limits this error suppression. We perform a numerical comparison between the original method and our qubit-efficient version with a realistic trapped-ion noise model. We find that REQUEST can reproduce the exponential suppression of errors of the virtual distillation approach, while out-performing virtual distillation when fewer than $3N+1$ qubits are available. Finally, we examine the scaling of the number of shots $N_S$ required for REQUEST to achieve useful corrections. We find that $N_S$ remains reasonable well into the quantum advantage regime where $N$ is hundreds of qubits.

arXiv:2102.06056•Feb 11, 2021•41 citations
When error correction becomes possible it will be necessary to dedicate a large number of physical qubits to each logical qubit. Error correction allows for deeper circuits to be run, but each additional physical qubit can potentially contribute an exponential increase in computational space, so there is a trade-off between using qubits for error correction or using them as noisy qubits. In this work we look at the effects of using noisy qubits in conjunction with noiseless qubits (an idealized model for error-corrected qubits), which we call the "clean and dirty" setup. We employ analytical models and numerical simulations to characterize this setup. Numerically we show the appearance of Noise-Induced Barren Plateaus (NIBPs), i.e., an exponential concentration of observables caused by noise, in an Ising model Hamiltonian variational ansatz circuit. We observe this even if only a single qubit is noisy and given a deep enough circuit, suggesting that NIBPs cannot be fully overcome simply by error-correcting a subset of the qubits. On the positive side, we find that for every noiseless qubit in the circuit, there is an exponential suppression in concentration of gradient observables, showing the benefit of partial error correction. Finally, our analytical models corroborate these findings by showing that observables concentrate with a scaling in the exponent related to the ratio of dirty-to-total qubits.
Abstract As quantum computing hardware steadily increases in qubit count and quality, one important question is how to allocate these resources to mitigate the effects of hardware noise. In a transitional era between noisy small-scale and fully fault-tolerant systems, we envisage a scenario in which we are only able to error-correct a fraction of the qubits required to perform an interesting computation. In this work, we develop concrete constructions of logical operations on a joint system of a collection of noisy and a collection of error-corrected logical qubits. Within this setting and under Pauli noise assumptions, we provide analytic evidence that brick-layered circuits display on average slower concentration to the “useless” uniform distribution with increasing circuit depth compared to fully noisy circuits. We corroborate these findings by numerical demonstration of slower decoherence with an increasing fraction of error-corrected qubits under depolarizing noise acting at the circuit level. We find that this advantage only manifests when the number of error-corrected qubits passes a specified threshold which depends on the number of couplings between error-corrected and noisy registers.
Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.
Suppressing noise in physical systems is of fundamental importance.As quantum computers mature, quantum error correcting codes (QECs) will be adopted in order to suppress errors to any desired level.However in the noisy, intermediate-scale quantum (NISQ) era, the complexity and scale required to adopt even the smallest QEC is prohibitive: a single logical qubit needs to be encoded into many thousands of physical qubits.Here we show that, for the crucial case of estimating expectation values of observables (key to almost all NISQ algorithms) one can indeed achieve an effective exponential suppression.We take n independently prepared circuit outputs to create a state whose symmetries prevent errors from contributing bias to the expected value.The approach is very well suited for current and near-term quantum devices as it is modular in the main computation and requires only a shallow circuit that bridges the n copies immediately prior to measurement.Using no more than four circuit copies, we confirm error suppression below 10 -6 for circuits consisting of several hundred noisy gates (2-qubit gate error 0.5%) in numerical simulations validating our approach.
Variational quantum algorithms (VQAs) offer a promising route toward simulating many-body quantum systems on noisy intermediate-scale quantum (NISQ) hardware. However, their scalability is severely limited by noise-induced barren plateaus (NIBPs), where hardware noise causes the gradients of the cost function to vanish exponentially with circuit depth, rendering optimization impossible. In this work, we demonstrate that introducing nonunitary elements into the variational ansatz can mitigate NIBPs in open-quantum systems. Using an analytically tractable infinite-range dissipative Ising model, we show that a nonunitary ansatz restores finite gradients in the presence of depolarizing noise, enabling convergence to the correct symmetry-broken steady state. We also develop a Floquet-type variational ansatz in which each layer repeats the same parameters, reducing the deep variational circuit to an effective quantum channel whose fixed points can be analyzed directly. We then extend these ideas to a realistic quantum-chemistry system by simulating electron transport through Oligophenylethynylene-sulfurmethyl (OPE-SMe) using Hamiltonians and jump operators of the model derived from first-principles polarizable QM/MM calculations. Our results show that nonunitary variational ansätze provide a scalable and physically grounded route for simulating open-system steady states on NISQ hardware, offering a pathway to overcoming one of the limitations of current quantum hardware.
Without a successful implementation of fault-tolerant quantum error correction, calculations on quantum computers are subject to noise that limits their capabilities. Here, motivated by realistic near-term hardware considerations, we study the impact of uncorrected local noise on logical quantum circuits. We first show that, in the task of estimating observable expectation values, any noise effectively truncates most quantum circuits to logarithmic depth. We then prove that quantum circuits under any non-unital noise do not exhibit barren plateaus for cost functions composed of local observables. However, by using the effective shallowness, we also design an efficient classical algorithm to estimate observable expectation values within any constant additive accuracy, with high probability over the choice of the circuit, in any circuit architecture. Taken together, our results establish that, unless we carefully engineer quantum circuits to take advantage of the noise, noisy quantum circuits are unlikely to offer an advantage over shallow ones for algorithms that output observable expectation value estimates, such as many variational quantum machine learning proposals.
Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of exponentially suppressing errors by preparing multiple noisy copies of a state and virtually distilling a more purified version. Here we present an alternative method, the Resource-Efficient Quantum Error Suppression Technique (REQUEST), that adapts this breakthrough to much fewer qubits by making use of active qubit resets, a feature now available on commercial platforms. Our approach exploits a space/time trade-off to achieve a similar error reduction using only 2N+12N+12N+1 qubits as opposed to MN+1MN+1MN+1 qubits, for MMM copies of an NNN qubit state. Additionally, we propose a method using near-Clifford circuits to find the optimal number of these copies in the presence of realistic noise, which limits this error suppression. We perform a numerical comparison between the original method and our qubit-efficient version with a realistic trapped-ion noise model. We find that REQUEST can reproduce the exponential suppression of errors of the virtual distillation approach, while out-performing virtual distillation when fewer than 3N+13N+13N+1 qubits are available. Finally, we examine the scaling of the number of shots NSN_SNS​ required for REQUEST to achieve useful corrections. We find that NSN_SNS​ remains reasonable well into the quantum advantage regime where NNN is hundreds of qubits.