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

Pre-processing μ-law Algorithm for Quantum Annealing Noise Mitigation

Valentin Gilbert, Ioannis Krikidis

Published Jul 6, 2026• 0 citations
Publisher

Abstract

Quantum annealers (QAs), such as those developed by D-Wave systems, operate in inherently noisy environments. Consequently, the actual quantum evolution frequently deviates from the idealized, programmed dynamics, potentially degrading solution quality. This challenge highlights the need for effective noise mitigation strategies to fully exploit the potential of these devices. One promising approach involves applying a non-linear transformation to the input problem prior to QA process, thereby enhancing its robustness to noise. This pre-processing technique guides the annealer toward higher-quality solutions despite underlying imperfections. We experimentally validate this method on large-scale problem instances and demonstrate that substantial error mitigation can be achieved.

DOI
10.5281/zenodo.21219324

Related papers

Enhancing quantum annealing accuracy through replication-based error mitigation*

Hristo N. Djidjev

Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.

Quantum Science and Technology•Aug 13, 2024•5 citations

Noise tolerance via reinforcement: learning a reinforced quantum dynamics

Abolfazl Ramezanpour

Abstract The performance of quantum simulations heavily depends on the efficiency of noise mitigation techniques and error correction algorithms. Reinforcement has emerged as a powerful strategy to enhance the efficiency of learning and optimization algorithms. In this study, we demonstrate that a reinforced quantum dynamics can exhibit significant robustness against interactions with a noisy environment. We study a quantum annealing process in which reinforcement encourages the system to maintain its current state or follow a noise-free evolution. A learning algorithm is used to derive a concise approximation of these reinforced dynamics, thereby reducing the total evolution time and, consequently, the system’s exposure to noisy interactions. This also avoids the complexities associated with implementing quantum feedback in such reinforcement algorithms. The efficacy of our method is demonstrated through numerical simulations of reinforced quantum annealing with one-qubit and two-qubit systems under Pauli noise.

arXiv:2506.12418•Journal of Statistical Mechanics Theory and Experiment•Dec 1, 2025•1 citation

EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations

Ramin Ayanzadeh, Poulami Das, Swamit Tannu +1 more

Quantum computing is an information processing paradigm that uses quantum-mechanical properties to speedup computationally hard problems. Gate-based quantum computers and Quantum Annealers (QAs) are two commercially available hardware platforms that are accessible to users today. Although promising, existing gate-based quantum computers consist of only a few dozen qubits and are not large enough for most applications. On the other hand, existing QAs with few thousand qubits have the potential to solve some domain-specific optimization problems. QAs are single instruction machines and to execute a program, the problem is cast to a Hamiltonian, embedded in the hardware, and a single quantum machine instruction (QMI) is run. Unfortunately, noise and imperfections in hardware result in sub-optimal solutions on QAs even if the QMI is run for thousands of trials.Due to the limited programmability of QAs users execute the same QMI for all trials. This subjects all trials to a similar noise profile throughout the execution, resulting in a systematic bias. We observe that systematic bias leads to sub-optimal solutions and cannot be alleviated by executing more trials or using existing error-mitigation schemes. To address this challenge, we propose EQUAL (Ensemble QUantum AnneaLing). EQUAL generates an ensemble of QMIs by adding controlled perturbations to the program QMI. When executed on the QA, the ensemble of QMIs steers the program away from encountering the same bias during all trials and thus, improves the quality of solutions. Our evaluations using the 2041-qubit D-Wave QA show that EQUAL bridges the difference between the baseline and the ideal by an average of 14% (and up to 26%) without requiring any additional trials. EQUAL can be combined with existing error mitigation schemes to further bridge the difference between the baseline and ideal by an average of 55% (and up to 68%).

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•8 citations

Quantum annealing with error mitigation

Yuta Shingu, Tetsuro Nikuni, Shiro Kawabata +1 more

Quantum annealing (QA) is one of the methods to prepare a ground state of a problem Hamiltonian. In the absence of noise, QA can accurately estimate the ground-state energy if the adiabatic condition is satisfied. However, in practice, systems are known to suffer from decoherence. Meanwhile, considerable research effort has been devoted to noisy intermediate-scale quantum (NISQ) computation. For practical NISQ computation, many error-mitigation (EM) methods have been proposed to mitigate the effects of noise. This paper proposes a QA strategy combined with an EM method, namely, dual-state purification, to suppress the effects of decoherence. Our protocol consists of four parts: the conventional dynamics, single-qubit projective measurements, the Hamiltonian dynamics corresponding to an inverse map of the first dynamics, and postprocessing of the measurement results. Importantly, our protocol works without two-qubit gates that require pulse operations; hence, it is suitable for devices designed for practical QA. In addition, we present numerical calculations to show that our protocol is more accurate than the conventional QA in estimating the ground-state energy under decoherence.

arXiv:2210.08862•Physical Review A•Apr 2, 2024•13 citations

MIMO With 1-b Pre/Postcoding Resolution: A Quantum Annealing Approach

Ioannis Krikidis

In this article, we study the problem of digital pre/postcoding design in multiple-input multiple-output (MIMO) systems with 1-b resolution per complex dimension. The optimal solution that maximizes the received signal-to-noise ratio relies on an NP-hard combinatorial problem that requires exhaustive searching with exponential complexity. By using the principles of alternating optimization and quantum annealing (QA), an iterative QA-based algorithm is proposed that achieves near-optimal performance with polynomial complexity. The algorithm is associated with a rigorous mathematical framework that casts the pre/postcoding vector design to appropriate real-valued quadratic unconstrained binary optimization (QUBO) problems. Experimental results in a state-of-the-art D-WAVE QA device validate the efficiency of the proposed algorithm. To further improve the efficiency of the D-WAVE quantum device, a new preprocessing technique, which preserves the quadratic QUBO matrix from the detrimental effects of the Hamiltonian noise through nonlinear companding, is proposed. The proposed preprocessing technique significantly improves the quality of the D-WAVE solutions as well as the occurrence probability of the optimal solution.

arXiv:2406.04708•IEEE Transactions on Quantum Engineering•Jan 1, 2024•9 citations

Self-Correcting Digital Circuits via Quantum Annealing

Jincheng Zhang

Digital circuits, the backbone of modern computation, are increasingly vulnerable to errors arising from environmental noise, including electromagnetic interference, thermal fluctuations, and process variations. These errors can propagate through circuits, leading to unreliable operation and potentially catastrophic failures, particularly in critical applications like aerospace, defense, and high-performance computing. This paper proposes a novel approach to mitigating these errors by leveraging the principles of Quantum Annealing (QA) to create self-correcting digital circuits. The core concept involves dynamically optimizing the circuit's design and operational parameters in real-time, responding to detected noise and implementing corrective actions. We formulate the circuit self-correction problem as an optimization problem amenable to QA. The objective function incorporates error detection metrics and the desired circuit performance. The QA algorithm iteratively explores the design space, identifying configurations that minimize the impact of noise and achieve the target functionality. Mathematical formulations detail the error modeling, the optimization problem, and the QA algorithm's core steps. The proposed method offers a fundamentally new approach to circuit design and operation, potentially leading to significantly more robust and reliable digital systems.

•Sep 6, 2026•0 citations
Quantum annealers (QAs), such as those developed by D-Wave systems, operate in inherently noisy environments. Consequently, the actual quantum evolution frequently deviates from the idealized, programmed dynamics, potentially degrading solution quality. This challenge highlights the need for effective noise mitigation strategies to fully exploit the potential of these devices. One promising approach involves applying a non-linear transformation to the input problem prior to QA process, thereby enhancing its robustness to noise. This pre-processing technique guides the annealer toward higher-quality solutions despite underlying imperfections. We experimentally validate this method on large-scale problem instances and demonstrate that substantial error mitigation can be achieved.
Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.
Abstract The performance of quantum simulations heavily depends on the efficiency of noise mitigation techniques and error correction algorithms. Reinforcement has emerged as a powerful strategy to enhance the efficiency of learning and optimization algorithms. In this study, we demonstrate that a reinforced quantum dynamics can exhibit significant robustness against interactions with a noisy environment. We study a quantum annealing process in which reinforcement encourages the system to maintain its current state or follow a noise-free evolution. A learning algorithm is used to derive a concise approximation of these reinforced dynamics, thereby reducing the total evolution time and, consequently, the system’s exposure to noisy interactions. This also avoids the complexities associated with implementing quantum feedback in such reinforcement algorithms. The efficacy of our method is demonstrated through numerical simulations of reinforced quantum annealing with one-qubit and two-qubit systems under Pauli noise.
Quantum computing is an information processing paradigm that uses quantum-mechanical properties to speedup computationally hard problems. Gate-based quantum computers and Quantum Annealers (QAs) are two commercially available hardware platforms that are accessible to users today. Although promising, existing gate-based quantum computers consist of only a few dozen qubits and are not large enough for most applications. On the other hand, existing QAs with few thousand qubits have the potential to solve some domain-specific optimization problems. QAs are single instruction machines and to execute a program, the problem is cast to a Hamiltonian, embedded in the hardware, and a single quantum machine instruction (QMI) is run. Unfortunately, noise and imperfections in hardware result in sub-optimal solutions on QAs even if the QMI is run for thousands of trials.Due to the limited programmability of QAs users execute the same QMI for all trials. This subjects all trials to a similar noise profile throughout the execution, resulting in a systematic bias. We observe that systematic bias leads to sub-optimal solutions and cannot be alleviated by executing more trials or using existing error-mitigation schemes. To address this challenge, we propose EQUAL (Ensemble QUantum AnneaLing). EQUAL generates an ensemble of QMIs by adding controlled perturbations to the program QMI. When executed on the QA, the ensemble of QMIs steers the program away from encountering the same bias during all trials and thus, improves the quality of solutions. Our evaluations using the 2041-qubit D-Wave QA show that EQUAL bridges the difference between the baseline and the ideal by an average of 14% (and up to 26%) without requiring any additional trials. EQUAL can be combined with existing error mitigation schemes to further bridge the difference between the baseline and ideal by an average of 55% (and up to 68%).
Quantum annealing (QA) is one of the methods to prepare a ground state of a problem Hamiltonian. In the absence of noise, QA can accurately estimate the ground-state energy if the adiabatic condition is satisfied. However, in practice, systems are known to suffer from decoherence. Meanwhile, considerable research effort has been devoted to noisy intermediate-scale quantum (NISQ) computation. For practical NISQ computation, many error-mitigation (EM) methods have been proposed to mitigate the effects of noise. This paper proposes a QA strategy combined with an EM method, namely, dual-state purification, to suppress the effects of decoherence. Our protocol consists of four parts: the conventional dynamics, single-qubit projective measurements, the Hamiltonian dynamics corresponding to an inverse map of the first dynamics, and postprocessing of the measurement results. Importantly, our protocol works without two-qubit gates that require pulse operations; hence, it is suitable for devices designed for practical QA. In addition, we present numerical calculations to show that our protocol is more accurate than the conventional QA in estimating the ground-state energy under decoherence.
In this article, we study the problem of digital pre/postcoding design in multiple-input multiple-output (MIMO) systems with 1-b resolution per complex dimension. The optimal solution that maximizes the received signal-to-noise ratio relies on an NP-hard combinatorial problem that requires exhaustive searching with exponential complexity. By using the principles of alternating optimization and quantum annealing (QA), an iterative QA-based algorithm is proposed that achieves near-optimal performance with polynomial complexity. The algorithm is associated with a rigorous mathematical framework that casts the pre/postcoding vector design to appropriate real-valued quadratic unconstrained binary optimization (QUBO) problems. Experimental results in a state-of-the-art D-WAVE QA device validate the efficiency of the proposed algorithm. To further improve the efficiency of the D-WAVE quantum device, a new preprocessing technique, which preserves the quadratic QUBO matrix from the detrimental effects of the Hamiltonian noise through nonlinear companding, is proposed. The proposed preprocessing technique significantly improves the quality of the D-WAVE solutions as well as the occurrence probability of the optimal solution.
Digital circuits, the backbone of modern computation, are increasingly vulnerable to errors arising from environmental noise, including electromagnetic interference, thermal fluctuations, and process variations. These errors can propagate through circuits, leading to unreliable operation and potentially catastrophic failures, particularly in critical applications like aerospace, defense, and high-performance computing. This paper proposes a novel approach to mitigating these errors by leveraging the principles of Quantum Annealing (QA) to create self-correcting digital circuits. The core concept involves dynamically optimizing the circuit's design and operational parameters in real-time, responding to detected noise and implementing corrective actions. We formulate the circuit self-correction problem as an optimization problem amenable to QA. The objective function incorporates error detection metrics and the desired circuit performance. The QA algorithm iteratively explores the design space, identifying configurations that minimize the impact of noise and achieve the target functionality. Mathematical formulations detail the error modeling, the optimization problem, and the QA algorithm's core steps. The proposed method offers a fundamentally new approach to circuit design and operation, potentially leading to significantly more robust and reliable digital systems.