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

Measuring Correlated Qubit Errors on Quantum Computers

Peyton Schales

Published Nov 3, 2021• 1 citation
Publisher

Abstract

Abstract Quantum computing is an emerging technology that, with its exponential computational speedup, will allow us to solve a new level of hard problems. From rapid vaccine development, efficient discovery of exotic materials, and complex AI models, to quickly cracking RSA encryption, quantum computers have the potential to revolutionize science. However, for quantum computing to solve these problems, quantum error correction methods are needed to eliminate qubit errors. An underlying assumption of current quantum error correction is that qubit errors are not correlated. If correlated qubit errors are prevalent, quantum error correction will be difficult, if not impossible. In this work, I developed a method to identify correlated errors between pairs of qubits and used this method to determine if correlations exist on current small-scale quantum computers. My method uses independence of error probabilities P(qa) ⨉ P(qb) = P(qaqb) to determine correlation. After running 40 million experiments to collect error probabilities by varying the quantum gates, number of gates, and pairs of qubits on multiple quantum computers, I found that these computers have a high occurrence of correlated qubit errors when qubits are topological neighbors. For example, I found that Hadamard gate operations can cause correlated errors, supported by a p-value of 0.0160. My work shows that the assumption that qubit errors are not correlated is incorrect for current quantum computers. In the future, scientists can use these methods to test for correlated errors as they develop new quantum computers, enabling quantum computing to achieve its full potential.

DOI
10.21203/rs.3.rs-1035320/v1

Related papers

Measuring and Suppressing Error Correlations in Quantum Circuits

Claire Edmunds, Cornelius Hempel, R. Harris +4 more

Quantum error correction provides a path to large-scale quantum computers, but is built on challenging assumptions about the characteristics of the underlying errors. In particular, the mathematical assumption of independent errors in quantum logic operations is at odds with realistic environments where error-sources may exhibit strong temporal correlations. We present experiments enabling the identification of error correlations between operations in quantum circuits, using only projective measurements at the end of the circuit. Using a single trapped ion qubit and engineered noise with tunable temporal correlations, we identify a clear signature of error correlations between sequential gates in randomly composed quantum circuits, and extract quantitative measures linked to the underlying noise correlation length. By replacing all gates in these circuits with "virtual" dynamically corrected gates (DCGs), we demonstrate that even in the presence of strongly correlated noise the signatures of error correlations between sequential gates appear similar to standard gates exposed to uncorrelated noise. A theoretical model applied to our experiments reveals that common DCGs suppress the correlated error component by over $270\times$ with $95\%$ confidence. Using block-correlated noise, we explore the scaling of the effective error correlation length at the virtual level, and show that DCGs exhibit error correlations indistinguishable from those arising from uncorrelated noise.

arXiv:1712.04954•Dec 13, 2017•8 citations

Performance of topological quantum error correction in the presence of correlated noise

Muhammad Ahsan, Syed Abbas Zilqurnain Naqvi

We investigate the efficacy of topological quantum error-correction in correlated noise model which permits collective coupling of all the codeword qubits to the same non-Markovian environment. In this noise model, the probability distribution over set of phase-flipped qubits, decays sub-exponentially in the size of the set and carries non-trivial likelihood of the occurring large numbers of qubits errors. We find that in the presence of noise correlation, one cannot guarantee arbitrary high computational accuracy simply by incrementing the codeword size while retaining constant noise level per qubit operation. However, if instead, per-operation qubit error probability in an n-qubits long codeword is reduced O(\sqrt{n}) times below the accuracy threshold, arbitrarily accurate quantum computation becomes feasible with acceptable scaling of the codeword size. Our results suggest that progressively reducing noise level in qubits and gates is as important as continuously integrating more qubits to realize scalable and reliable quantum computer.

Quantum Information and Computation•Aug 1, 2018•3 citations

Quantum Error Correction

Phillip Kaye, Raymond Laflamme, Michele Mosca

A mathematical model of computation is an idealized abstraction. We design algorithms and perform analysis on the assumption that the mathematical operations we specify will be carried out exactly, and without error. Physical devices that implement an abstract model of computation are imperfect and of limited precision. For example, when a digital circuit is implemented on a physical circuit board, unwanted electrical noise in the environment may cause components to behave differently than expected, and may cause voltage levels (bit-values) to change. These sources of error must be controlled or compensated for, or else the resulting loss of efficiency may reduce the power of the information-processing device. If individual steps in a computation succeed with probability p, then a computation involving t sequential steps will have a success probability that decreases exponentially as pt. Although it may be impossible to eliminate the sources of errors, we can devise schemes to allow us to recover from errors using a reasonable amount of additional resources. Many classical digital computing devices use error-correcting codes to perform detection of and recovery from errors. The theory of error-correcting codes is itself a mathematical abstraction, but it is one that explicitly accounts for errors introduced by the imperfection and imprecision of realistic devices. This theory has proven extremely effective in allowing engineers to build computing devices that are resilient against errors. Quantum computers are more susceptible to errors than classical digital computers, because quantum mechanical systems are more delicate and more difficult to control. If large-scale quantum computers are to be possible, a theory of quantum error correction is needed. The discovery of quantum error correction has given researchers confidence that realistic large-scale quantum computing devices can be built despite the presence of errors. We begin by considering fundamental concepts for error correction in a classical setting. We will focus on three of these concepts: (a) the characterization of the error model, (b) the introduction of redundancy through encoding, and (c) an error recovery procedure. We will later see that these concepts generalize quite naturally for quantum error correction.

Oxford University Press eBooks•Nov 16, 2006•0 citations

Quantum Machine Learning, Error Correction, and Topological Phases of Matter

Cong, Iris

Quantum computation is an exciting and rapidly developing paradigm of computing, which has the potential to improve or accelerate numerous important applications ranging from cryptography to drug discovery. Inspired by these prospects, researchers and engineers across the world have, in recent years, made tremendous advances in building programmable quantum devices. Nevertheless, the size and error rates in state-of-the-art quantum computers are still several orders of magnitude away from those required to achieve computational speedups using existing quantum algorithms. These developments, along with their limitations, motivate us to consider two important questions: First, are there any useful applications in which current or near-term quantum devices can outperform classical computers? Second, can we develop efficient error-correction schemes to suppress the error rates in near-term quantum devices? In this dissertation, we present novel solutions to both of these questions. To address the first question, we identify an important class of problems in condensed-matter physics, namely the identification and characterization of quantum phases of matter, as one promising application of current and near-term quantum information processors. We develop new algorithms for using such quantum devices to solve these problems, and we demonstrate how our methods substantially outperform existing approaches. In addition, we respond to the second question by developing hardware-efficient quantum error correction protocols. By leveraging the distinctive properties and advantages of a given experimental setup to overcome its particular limitations, our proposals significantly reduce the number of quantum bits and operations required for performing quantum error correction and fault-tolerant quantum computation. Together, the works in this dissertation thus pave the way for the near-term realization of quantum computational advantages.

•Jan 1, 2023•0 citations

Toward efficient correction of multiqubit measurement errors: pair correlation method

Michael R Geller, Mingyu Sun

Abstract Measurement errors limit the performance of near-term quantum computers and their potential for practical application. However they are partly correctable after a calibration step that requires, for a complete implementation on a register of n qubits, 2 n additional measurements. Here we introduce an approximate but efficient method for multiqubit measurement error characterization and mitigation requiring the classical processing of 2 n × 2 n matrices, but only O (4 k n 2 ) measurements, where k = O (1) is the number of qubits in a correlation volume. We demonstrate and validate the method on an IBM Q processor with registers of 4 and 8 superconducting qubits.

arXiv:2001.09980•Quantum Science and Technology•Dec 22, 2020•77 citations

SPOOKY CHIPS: THE STRANGE, ENTANGLED HEART OF THE NEXT COMPUTING REVOLUTION

Sayed Mahbub Hasan Amiri, PRASUN GOSWAMI, Chandan Kumar Barmmon +5 more

The limitations of classical computing in solving complex problems in cryptography, materials science, and optimization necessitate the development of a new computational paradigm based on the principles of quantum mechanics. This article aimed to analyze the current state of quantum computing hardware, evaluate the primary challenges to achieving fault tolerance, and project a realistic timeline for its practical application. The methodology involved a systematic review and comparative analysis of publicly available empirical data from peer-reviewed literature and corporate technical roadmaps, employing a framework of key performance indicators such as coherence times, gate fidelities, and qubit counts to assess leading qubit modalities, including superconducting circuits, trapped ions, and photonic systems. The analysis confirmed that while superconducting qubits currently lead in scalability, with demonstrations of quantum supremacy using 53-qubit processors, trapped ion platforms maintain a significant advantage in gate fidelity and coherence times. The central finding identifies decoherence and high error rates as the fundamental barriers, necessitating that current Noisy Intermediate-Scale Quantum (NISQ) devices rely on error mitigation techniques rather than robust quantum error correction. The comparative assessment concludes that no single qubit modality yet fulfills all DiVincenzo criteria for fault tolerance simultaneously. The path to scalable quantum computing is shown to depend on the successful implementation of topological error-correcting codes like the surface code, which currently requires thousands of physical qubits to create a single stable logical qubit. Projections based on current progress suggest that while demonstrations of quantum utility on specific problems are imminent, fully fault-tolerant quantum computers capable of breaking RSA encryption or revolutionizing drug discovery remain a long-term endeavor, likely requiring several more decades of intensive research and development. The practical value of this research lies in its synthesized technical overview, which provides a clear, evidence-based roadmap for researchers, engineers, and policymakers to navigate the technological hurdles and strategic investments required to realize the transformative potential of quantum computing.

Journal of Smart Computing and Quantum Technologies•Jul 8, 2026•0 citations
Abstract Quantum computing is an emerging technology that, with its exponential computational speedup, will allow us to solve a new level of hard problems. From rapid vaccine development, efficient discovery of exotic materials, and complex AI models, to quickly cracking RSA encryption, quantum computers have the potential to revolutionize science. However, for quantum computing to solve these problems, quantum error correction methods are needed to eliminate qubit errors. An underlying assumption of current quantum error correction is that qubit errors are not correlated. If correlated qubit errors are prevalent, quantum error correction will be difficult, if not impossible. In this work, I developed a method to identify correlated errors between pairs of qubits and used this method to determine if correlations exist on current small-scale quantum computers. My method uses independence of error probabilities P(qa) ⨉ P(qb) = P(qaqb) to determine correlation. After running 40 million experiments to collect error probabilities by varying the quantum gates, number of gates, and pairs of qubits on multiple quantum computers, I found that these computers have a high occurrence of correlated qubit errors when qubits are topological neighbors. For example, I found that Hadamard gate operations can cause correlated errors, supported by a p-value of 0.0160. My work shows that the assumption that qubit errors are not correlated is incorrect for current quantum computers. In the future, scientists can use these methods to test for correlated errors as they develop new quantum computers, enabling quantum computing to achieve its full potential.
Quantum error correction provides a path to large-scale quantum computers, but is built on challenging assumptions about the characteristics of the underlying errors. In particular, the mathematical assumption of independent errors in quantum logic operations is at odds with realistic environments where error-sources may exhibit strong temporal correlations. We present experiments enabling the identification of error correlations between operations in quantum circuits, using only projective measurements at the end of the circuit. Using a single trapped ion qubit and engineered noise with tunable temporal correlations, we identify a clear signature of error correlations between sequential gates in randomly composed quantum circuits, and extract quantitative measures linked to the underlying noise correlation length. By replacing all gates in these circuits with "virtual" dynamically corrected gates (DCGs), we demonstrate that even in the presence of strongly correlated noise the signatures of error correlations between sequential gates appear similar to standard gates exposed to uncorrelated noise. A theoretical model applied to our experiments reveals that common DCGs suppress the correlated error component by over 270×270\times270× with 95%95\%95% confidence. Using block-correlated noise, we explore the scaling of the effective error correlation length at the virtual level, and show that DCGs exhibit error correlations indistinguishable from those arising from uncorrelated noise.
We investigate the efficacy of topological quantum error-correction in correlated noise model which permits collective coupling of all the codeword qubits to the same non-Markovian environment. In this noise model, the probability distribution over set of phase-flipped qubits, decays sub-exponentially in the size of the set and carries non-trivial likelihood of the occurring large numbers of qubits errors. We find that in the presence of noise correlation, one cannot guarantee arbitrary high computational accuracy simply by incrementing the codeword size while retaining constant noise level per qubit operation. However, if instead, per-operation qubit error probability in an n-qubits long codeword is reduced O(\sqrt{n}) times below the accuracy threshold, arbitrarily accurate quantum computation becomes feasible with acceptable scaling of the codeword size. Our results suggest that progressively reducing noise level in qubits and gates is as important as continuously integrating more qubits to realize scalable and reliable quantum computer.
A mathematical model of computation is an idealized abstraction. We design algorithms and perform analysis on the assumption that the mathematical operations we specify will be carried out exactly, and without error. Physical devices that implement an abstract model of computation are imperfect and of limited precision. For example, when a digital circuit is implemented on a physical circuit board, unwanted electrical noise in the environment may cause components to behave differently than expected, and may cause voltage levels (bit-values) to change. These sources of error must be controlled or compensated for, or else the resulting loss of efficiency may reduce the power of the information-processing device. If individual steps in a computation succeed with probability p, then a computation involving t sequential steps will have a success probability that decreases exponentially as pt. Although it may be impossible to eliminate the sources of errors, we can devise schemes to allow us to recover from errors using a reasonable amount of additional resources. Many classical digital computing devices use error-correcting codes to perform detection of and recovery from errors. The theory of error-correcting codes is itself a mathematical abstraction, but it is one that explicitly accounts for errors introduced by the imperfection and imprecision of realistic devices. This theory has proven extremely effective in allowing engineers to build computing devices that are resilient against errors. Quantum computers are more susceptible to errors than classical digital computers, because quantum mechanical systems are more delicate and more difficult to control. If large-scale quantum computers are to be possible, a theory of quantum error correction is needed. The discovery of quantum error correction has given researchers confidence that realistic large-scale quantum computing devices can be built despite the presence of errors. We begin by considering fundamental concepts for error correction in a classical setting. We will focus on three of these concepts: (a) the characterization of the error model, (b) the introduction of redundancy through encoding, and (c) an error recovery procedure. We will later see that these concepts generalize quite naturally for quantum error correction.
Quantum computation is an exciting and rapidly developing paradigm of computing, which has the potential to improve or accelerate numerous important applications ranging from cryptography to drug discovery. Inspired by these prospects, researchers and engineers across the world have, in recent years, made tremendous advances in building programmable quantum devices. Nevertheless, the size and error rates in state-of-the-art quantum computers are still several orders of magnitude away from those required to achieve computational speedups using existing quantum algorithms. These developments, along with their limitations, motivate us to consider two important questions: First, are there any useful applications in which current or near-term quantum devices can outperform classical computers? Second, can we develop efficient error-correction schemes to suppress the error rates in near-term quantum devices? In this dissertation, we present novel solutions to both of these questions. To address the first question, we identify an important class of problems in condensed-matter physics, namely the identification and characterization of quantum phases of matter, as one promising application of current and near-term quantum information processors. We develop new algorithms for using such quantum devices to solve these problems, and we demonstrate how our methods substantially outperform existing approaches. In addition, we respond to the second question by developing hardware-efficient quantum error correction protocols. By leveraging the distinctive properties and advantages of a given experimental setup to overcome its particular limitations, our proposals significantly reduce the number of quantum bits and operations required for performing quantum error correction and fault-tolerant quantum computation. Together, the works in this dissertation thus pave the way for the near-term realization of quantum computational advantages.
Abstract Measurement errors limit the performance of near-term quantum computers and their potential for practical application. However they are partly correctable after a calibration step that requires, for a complete implementation on a register of n qubits, 2 n additional measurements. Here we introduce an approximate but efficient method for multiqubit measurement error characterization and mitigation requiring the classical processing of 2 n × 2 n matrices, but only O (4 k n 2 ) measurements, where k = O (1) is the number of qubits in a correlation volume. We demonstrate and validate the method on an IBM Q processor with registers of 4 and 8 superconducting qubits.
The limitations of classical computing in solving complex problems in cryptography, materials science, and optimization necessitate the development of a new computational paradigm based on the principles of quantum mechanics. This article aimed to analyze the current state of quantum computing hardware, evaluate the primary challenges to achieving fault tolerance, and project a realistic timeline for its practical application. The methodology involved a systematic review and comparative analysis of publicly available empirical data from peer-reviewed literature and corporate technical roadmaps, employing a framework of key performance indicators such as coherence times, gate fidelities, and qubit counts to assess leading qubit modalities, including superconducting circuits, trapped ions, and photonic systems. The analysis confirmed that while superconducting qubits currently lead in scalability, with demonstrations of quantum supremacy using 53-qubit processors, trapped ion platforms maintain a significant advantage in gate fidelity and coherence times. The central finding identifies decoherence and high error rates as the fundamental barriers, necessitating that current Noisy Intermediate-Scale Quantum (NISQ) devices rely on error mitigation techniques rather than robust quantum error correction. The comparative assessment concludes that no single qubit modality yet fulfills all DiVincenzo criteria for fault tolerance simultaneously. The path to scalable quantum computing is shown to depend on the successful implementation of topological error-correcting codes like the surface code, which currently requires thousands of physical qubits to create a single stable logical qubit. Projections based on current progress suggest that while demonstrations of quantum utility on specific problems are imminent, fully fault-tolerant quantum computers capable of breaking RSA encryption or revolutionizing drug discovery remain a long-term endeavor, likely requiring several more decades of intensive research and development. The practical value of this research lies in its synthesized technical overview, which provides a clear, evidence-based roadmap for researchers, engineers, and policymakers to navigate the technological hurdles and strategic investments required to realize the transformative potential of quantum computing.