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:2005.04341 · Physical Review A

Generic detection-based error mitigation using quantum autoencoders

Xiao‐Ming Zhang, Weicheng Kong, Muhammad Usman Farooq, Man‐Hong Yung, Guo‐Ping Guo, Xin Wang

Published Apr 22, 2021• 25 citations
arXivHTMLPDF

Abstract

Efficient error-mitigation techniques demanding minimal resources is key to quantum information processing. We propose a generic protocol to mitigate quantum errors using detection-based quantum autoencoders. In our protocol, the quantum data are compressed into a latent subspace while leaving errors outside, the latter of which is then removed by a measurement and postselection. Compared to previously developed methods, our protocol on the one hand requires no extra qubits, and on the other hand it has a near-optimal denoising power, in which under reasonable requirements all errors detected outside of the latent subspace can be removed, while those inside the subspace cannot be removed by any means. Our detection-based quantum autoencoders are therefore particularly useful for near-term quantum devices in which controllable qubits are limited while noise reduction is important.

DOI
10.1103/physreva.103.l040403

Related papers

Quantum Error Mitigation via Autoencoder Neural Networks

Xiao-Dao Lin, Hsi-Ming Chang, Jhih-Shih You +1 more

Quantum computing has gained significant attention in recent years, with numerous algorithms and applications under active development. Limited by the current quantum technology, quantum noise and readout error have become critical issues. Various methods have been proposed to address readout error through error mitigation techniques, typically involving post-processing of measurement data. However, most of these methods increase the quantum hardware overhead, leading to higher computational costs. In this work, we present a machine-learning-based approach that minimizes hardware overhead while improving accuracy of the measurement probability distributions. We employed a convolutional neural network (CNN) autoencoder, commonly used for image denoising, as our baseline model. The datasets were derived from 4-qubit random circuits with depths ranging from 1 to 18, generated using Qiskit backends for target and noisy measurement data. The model was trained using mean squared error (MSE) as the loss function and Adam optimizer over 500 epochs, achieving an average noise reduction by 95% across the validation set, with no signs of overfitting. To validate the model's effectiveness across diverse quantum states, we conducted extensive tests on both typical quantum circuits and algorithms, including Grover's search algorithm, Quantum Fourier Transform, Haar random circuits and Trivial Paramagnet. The results demonstrated consistent and robust denoising in noisy measurement data, indicating that the autoencoder model is well-suited for efficient quantum error mitigation for current noisy quantum computers. This work contributes to the advancement of quantum error mitigation techniques using machine learning.

IEEE International Conference on Quantum Control, Computing and Learning (qCCL)•Jun 25, 2025•1 citation

Generalized Quantum Subspace Expansion

Nobuyuki Yoshioka, Hideaki Hakoshima, Yuichiro Matsuzaki +3 more

One of the major challenges for erroneous quantum computers is undoubtedly the control over the effect of noise. Considering the rapid growth of available quantum resources that are not fully fault tolerant, it is crucial to develop practical hardware-friendly quantum error mitigation (QEM) techniques to suppress unwanted errors. Here, we propose a novel generalized quantum subspace expansion method which can handle stochastic, coherent, and algorithmic errors in quantum computers. By fully exploiting the substantially extended subspace, we can efficiently mitigate the noise present in the spectra of a given Hamiltonian, without relying on any information of noise. The performance of our method is discussed under two highly practical setups: the quantum subspaces are mainly spanned by powers of the noisy state ρ^{m} and a set of error-boosted states, respectively. We numerically demonstrate in both situations that we can suppress errors by orders of magnitude, and show that our protocol inherits the advantages of previous error-agnostic QEM techniques as well as overcoming their drawbacks.

arXiv:2107.02611•Physical Review Letters•Jul 6, 2022•89 citations

Quantum readout error mitigation via deep learning

Jihye Kim, Byungdu Oh, Yonuk Chong +2 more

Abstract Quantum computing devices are inevitably subject to errors. To leverage quantum technologies for computational benefits in practical applications, quantum algorithms and protocols must be implemented reliably under noise and imperfections. Since noise and imperfections limit the size of quantum circuits that can be realized on a quantum device, developing quantum error mitigation techniques that do not require extra qubits and gates is of critical importance. In this work, we present a deep learning-based protocol for reducing readout errors on quantum hardware. Our technique is based on training an artificial neural network (NN) with the measurement results obtained from experiments with simple quantum circuits consisting of singe-qubit gates only. With the NN and deep learning, non-linear noise can be corrected, which is not possible with the existing linear inversion methods. The advantage of our method against the existing methods is demonstrated through quantum readout error mitigation experiments performed on IBM five-qubit quantum devices.

arXiv:2112.03585•New Journal of Physics•Jul 1, 2022•40 citations

Mitigating errors by quantum verification and postselection

Rawad Mezher, James K. Mills, Elham Kashefi

Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many cases it has been shown that noise renders quantum circuits efficiently classically simulable, thereby destroying any quantum advantage potentially offered by an ideal (noiseless) implementation of these circuits. Although the technique of quantum error correction (QEC) allows correcting these errors very accurately, QEC usually requires a large overhead of physical qubits which is not reachable with currently available quantum hardware. This has been the motivation behind the field of quantum error mitigation, which aims at developing techniques to correct an important part of the errors in quantum circuits, while also being compatible with current and near-term quantum hardware. In this work, we present a technique for quantum error mitigation which is based on a technique from quantum verification, the so-called accreditation protocol, together with postselection. Our technique allows for correcting the expectation value of an observable $O$, which is the output of multiple runs of noisy quantum circuits, where the noise in these circuits is at the level of preparations, gates, and measurements. We discuss the sample complexity of our procedure and provide rigorous guarantees of errors being mitigated under some realistic assumptions on the noise. Our technique is tailored to time-dependent behaviors, as we allow for the output states to be different between different runs of the accreditation protocol. We validate our findings by running our technique on currently available quantum hardware.

arXiv:2109.14329•Physical Review A•May 27, 2022•14 citations

Selective Qubit Utilization for Optimizing Quantum Data Compression based on Quantum State Error

Agi Prasetiadi, Masahiro Mambo

Designing a quantum data compression circuit with reasonable error using autoencoders can be time-consuming. Previous studies have explored qubit compression using specially designed circuits or autoencoders, with some attempts to apply it to small 16-bit black-and-white images using four qubits. However, analysis regarding the errors using general data is not discussed enough. This paper proposes a practical technique to optimize quantum compression for general data comprising hundreds of thousands of classical data points. We introduce Quantum State Error to investigate the potential for improving accuracy through qubit selection using degree reduction in quantum compression. By doing so, imperfect quantum autoencoder circuits may exhibit enhanced performance, offering improved lossy compression capabilities. Our experiments show promising results, where certain kind of circuits responds well to degree reduction by a factor of 3/4, reducing the number of faulty qubits up to 11.44%.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Jul 1, 2024•1 citation

Error Mitigation of Fault-Tolerant Quantum Circuits with Soft Information

Zeyuan Zhou, Shaun Pexton, Aleksander Kubica +1 more

Quantum error mitigation (QEM) is typically viewed as a suite of practical techniques for today's noisy intermediate-scale quantum devices, with limited relevance once fault-tolerant quantum computers become available. In this work, we challenge this conventional wisdom by showing that QEM can continue to provide substantial benefits in the era of quantum error correction (QEC), and in an even more efficient manner than it does on current devices. We introduce a framework for logical-level QEM that leverages soft information naturally produced by QEC decoders, requiring no additional data, hardware modifications, or runtime overhead beyond what QEC protocols already provide. Within this framework, we develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation. Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots; they also provide in situ characterization of logical channels for QEM protocols. As a proof of principle, we benchmark our approach using a surface-code architecture and two state-of-the-art decoders based on tensor-network contraction and minimum-weight perfect matching. We evaluate logical-level QEM on random Clifford circuits and molecular simulation algorithms and find that, compared to previous approaches relying on QEC only or QEC combined with QEM, we can achieve up to 87.4% spacetime overhead savings. Our results demonstrate that logical-level QEM with QEC decoder soft information can reliably improve logical performance, underscoring the efficiency and usefulness of QEM techniques for fault-tolerant quantum computers.

quant-pharXiv:2512.09863•Dec 11, 2025•26 citations
Efficient error-mitigation techniques demanding minimal resources is key to quantum information processing. We propose a generic protocol to mitigate quantum errors using detection-based quantum autoencoders. In our protocol, the quantum data are compressed into a latent subspace while leaving errors outside, the latter of which is then removed by a measurement and postselection. Compared to previously developed methods, our protocol on the one hand requires no extra qubits, and on the other hand it has a near-optimal denoising power, in which under reasonable requirements all errors detected outside of the latent subspace can be removed, while those inside the subspace cannot be removed by any means. Our detection-based quantum autoencoders are therefore particularly useful for near-term quantum devices in which controllable qubits are limited while noise reduction is important.
Quantum computing has gained significant attention in recent years, with numerous algorithms and applications under active development. Limited by the current quantum technology, quantum noise and readout error have become critical issues. Various methods have been proposed to address readout error through error mitigation techniques, typically involving post-processing of measurement data. However, most of these methods increase the quantum hardware overhead, leading to higher computational costs. In this work, we present a machine-learning-based approach that minimizes hardware overhead while improving accuracy of the measurement probability distributions. We employed a convolutional neural network (CNN) autoencoder, commonly used for image denoising, as our baseline model. The datasets were derived from 4-qubit random circuits with depths ranging from 1 to 18, generated using Qiskit backends for target and noisy measurement data. The model was trained using mean squared error (MSE) as the loss function and Adam optimizer over 500 epochs, achieving an average noise reduction by 95% across the validation set, with no signs of overfitting. To validate the model's effectiveness across diverse quantum states, we conducted extensive tests on both typical quantum circuits and algorithms, including Grover's search algorithm, Quantum Fourier Transform, Haar random circuits and Trivial Paramagnet. The results demonstrated consistent and robust denoising in noisy measurement data, indicating that the autoencoder model is well-suited for efficient quantum error mitigation for current noisy quantum computers. This work contributes to the advancement of quantum error mitigation techniques using machine learning.
One of the major challenges for erroneous quantum computers is undoubtedly the control over the effect of noise. Considering the rapid growth of available quantum resources that are not fully fault tolerant, it is crucial to develop practical hardware-friendly quantum error mitigation (QEM) techniques to suppress unwanted errors. Here, we propose a novel generalized quantum subspace expansion method which can handle stochastic, coherent, and algorithmic errors in quantum computers. By fully exploiting the substantially extended subspace, we can efficiently mitigate the noise present in the spectra of a given Hamiltonian, without relying on any information of noise. The performance of our method is discussed under two highly practical setups: the quantum subspaces are mainly spanned by powers of the noisy state ρ^{m} and a set of error-boosted states, respectively. We numerically demonstrate in both situations that we can suppress errors by orders of magnitude, and show that our protocol inherits the advantages of previous error-agnostic QEM techniques as well as overcoming their drawbacks.
Abstract Quantum computing devices are inevitably subject to errors. To leverage quantum technologies for computational benefits in practical applications, quantum algorithms and protocols must be implemented reliably under noise and imperfections. Since noise and imperfections limit the size of quantum circuits that can be realized on a quantum device, developing quantum error mitigation techniques that do not require extra qubits and gates is of critical importance. In this work, we present a deep learning-based protocol for reducing readout errors on quantum hardware. Our technique is based on training an artificial neural network (NN) with the measurement results obtained from experiments with simple quantum circuits consisting of singe-qubit gates only. With the NN and deep learning, non-linear noise can be corrected, which is not possible with the existing linear inversion methods. The advantage of our method against the existing methods is demonstrated through quantum readout error mitigation experiments performed on IBM five-qubit quantum devices.
Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many cases it has been shown that noise renders quantum circuits efficiently classically simulable, thereby destroying any quantum advantage potentially offered by an ideal (noiseless) implementation of these circuits. Although the technique of quantum error correction (QEC) allows correcting these errors very accurately, QEC usually requires a large overhead of physical qubits which is not reachable with currently available quantum hardware. This has been the motivation behind the field of quantum error mitigation, which aims at developing techniques to correct an important part of the errors in quantum circuits, while also being compatible with current and near-term quantum hardware. In this work, we present a technique for quantum error mitigation which is based on a technique from quantum verification, the so-called accreditation protocol, together with postselection. Our technique allows for correcting the expectation value of an observable OOO, which is the output of multiple runs of noisy quantum circuits, where the noise in these circuits is at the level of preparations, gates, and measurements. We discuss the sample complexity of our procedure and provide rigorous guarantees of errors being mitigated under some realistic assumptions on the noise. Our technique is tailored to time-dependent behaviors, as we allow for the output states to be different between different runs of the accreditation protocol. We validate our findings by running our technique on currently available quantum hardware.
Designing a quantum data compression circuit with reasonable error using autoencoders can be time-consuming. Previous studies have explored qubit compression using specially designed circuits or autoencoders, with some attempts to apply it to small 16-bit black-and-white images using four qubits. However, analysis regarding the errors using general data is not discussed enough. This paper proposes a practical technique to optimize quantum compression for general data comprising hundreds of thousands of classical data points. We introduce Quantum State Error to investigate the potential for improving accuracy through qubit selection using degree reduction in quantum compression. By doing so, imperfect quantum autoencoder circuits may exhibit enhanced performance, offering improved lossy compression capabilities. Our experiments show promising results, where certain kind of circuits responds well to degree reduction by a factor of 3/4, reducing the number of faulty qubits up to 11.44%.
Quantum error mitigation (QEM) is typically viewed as a suite of practical techniques for today's noisy intermediate-scale quantum devices, with limited relevance once fault-tolerant quantum computers become available. In this work, we challenge this conventional wisdom by showing that QEM can continue to provide substantial benefits in the era of quantum error correction (QEC), and in an even more efficient manner than it does on current devices. We introduce a framework for logical-level QEM that leverages soft information naturally produced by QEC decoders, requiring no additional data, hardware modifications, or runtime overhead beyond what QEC protocols already provide. Within this framework, we develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation. Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots; they also provide in situ characterization of logical channels for QEM protocols. As a proof of principle, we benchmark our approach using a surface-code architecture and two state-of-the-art decoders based on tensor-network contraction and minimum-weight perfect matching. We evaluate logical-level QEM on random Clifford circuits and molecular simulation algorithms and find that, compared to previous approaches relying on QEC only or QEC combined with QEM, we can achieve up to 87.4% spacetime overhead savings. Our results demonstrate that logical-level QEM with QEC decoder soft information can reliably improve logical performance, underscoring the efficiency and usefulness of QEM techniques for fault-tolerant quantum computers.