Current quantum computers present significant noise, especially as circuit depth and qubit count increase. Prior work has demonstrated that erroneous outcomes exhibit some behavior in Hamming space, enabling improvements in the output distributions of NISQ-era computers. We present HAMMR-L: a principled post-processing technique for improving the fidelity of output distributions by applying Richardson-Lucy image deconvolution on a state graph of measurement results connected by Hamming distance. We show that this preliminary implementation of HAMMR-L outperforms existing cutting-edge Hamming-based post-processors such as QBEEP while being circuit and hardware agnostic, which QBEEP is not. HAMMR-L also demonstrates clear potential for future improvements and we discuss how such improvements might be realized while highlighting the strengths, limitations, and generality of the underlying concept.
Current quantum computers present significant noise, especially as circuit depth and qubit count increase. Prior work has demonstrated that erroneous outcomes exhibit some behavior in Hamming space, enabling improvements in the output distributions of NISQ-era computers. We present HAMMR-L: a principled post-processing technique for improving the fidelity of output distributions by applying Richardson-Lucy image deconvolution on a state graph of measurement results connected by Hamming distance. We show that this preliminary implementation of HAMMR-L outperforms existing cutting-edge Hamming-based post-processors such as QBEEP while being circuit and hardware agnostic, which QBEEP is not. HAMMR-L also demonstrates clear potential for future improvements and we discuss how such improvements might be realized while highlighting the strengths, limitations, and generality of the underlying concept.
The field of quantum computing has experienced a rapid expansion in recent years, with ongoing exploration of new technologies, a decrease in error rates, and a growth in the number of qubits available in quantum processors. However, near-term quantum algorithms are still unable to be induced without compounding consequential levels of noise, leading to non-trivial erroneous results. Quantum Error Correction and Mitigation are rapidly advancing areas of research in the quantum computing landscape, with a goal of reducing errors. IBM has recently emphasized that Quantum Error Mitigation is the key to unlocking the full potential of quantum computing. A recent work, namely HAMMER, demonstrated the existence of a latent structure regarding post-circuit induction errors when mapping to the Hamming spectrum. However, they assumed that errors occur solely in local clusters, whereas we observe that at higher average Hamming distances this structure falls away. Our study demonstrates that the correlated structure is not just limited to local patterns, but it also encompasses certain non-local clustering patterns that can be accurately characterized through a Poisson distribution model. This model takes into account the input circuit, the current state of the device, including calibration statistics, and the qubit topology. Using this quantum error characterizing model, we developed an iterative algorithm over the generated Bayesian network state-graph for post-induction error mitigation. Our Q-Beep approach delivers state-of-the-art results, thanks to its problem-aware modeling of the error distribution's underlying structure and the implementation of an Bayesian network state-graph. This has resulted in an increase of up to 234.6% in circuit execution accuracy on BV circuits and an average improvement of 71.0% in the quality of QAOA solutions when tested on 16 IBMQ quantum processors.
Quantum computers with hundreds of qubits will be available soon. Unfortunately, high device error-rates pose a significant challenge in using these near-term quantum systems to power real-world applications. Executing a program on existing quantum systems generates both correct and incorrect outcomes, but often, the output distribution is too noisy to distinguish between them. In this paper, we show that erroneous outcomes are not arbitrary but exhibit a well-defined structure when represented in the Hamming space. Our experiments on IBM and Google quantum computers show that the most frequent erroneous outcomes are more likely to be close in the Hamming space to the correct outcome. We exploit this behavior to improve the ability to infer the correct outcome.
Quantum computing is advancing rapidly, driven by the increasing capabilities of quantum hardware. However, as devices scale to hundreds of qubits, the presence of high error rates during execution poses a substantial challenge to obtaining reliable and high-fidelity results. Recent approaches have utilized the Hamming spectrum to reconstruct noisy output distributions, improving the proximity of measurement results to the correct solution. In this work, we propose AbS-Q: an effective post-processing model for signal recovery from noisy quantum outputs. AbS-Q integrates structural information from the Hamming spectrum with convolutional deep learning to enhance the ranking and recovery of correct results. In our evaluations, we demonstrate that AbS-Q outperforms existing Hammingbased post-processing techniques in recovering accurate outputs, highlighting its potential as a scalable error mitigation strategy.
We present a classical post-processing method for quantum error mitigation that achieves 87.6-100% recovery of lost quantum information on real NISQ hardware with zero calibration overhead. The method exploits the mathematical equivalence between quantum decoherence and classical diffusion to apply Richardson-Lucy deconvolution to quantum measurement probability distributions. Tested on IBM Quantum Torino hardware across six circuit types, the method achieves 97.8% average fidelity recovery while requiring no ancilla qubits, no additional circuit executions, and no prior hardware characterization.
Quantum computing technology has grown rapidly in recent years, with new technologies being explored, error rates being reduced, and quantum processors' qubit capacity growing. However, near-term quantum algorithms are still unable to be induced without compounding consequential levels of noise, leading to non-trivial erroneous results. Quantum Error Correction (in-situ error mitigation) and Quantum Error Mitigation (post-induction error mitigation) are promising fields of research within the quantum algorithm scene, aiming to alleviate quantum errors. IBM recently published an article stating that Quantum Error Mitigation is the path to quantum computing usefulness. A recent work, namely HAMMER, demonstrated the existence of a latent structure regarding post-circuit induction errors when mapping to the Hamming spectrum. However, they assumed that errors occur solely in local clusters, whereas we observe that at higher average Hamming distances this structure falls away. In this work, we show that such a correlated structure is not only local but extends certain non-local clustering patterns which can be precisely described by a Poisson distribution model taking the input circuit, the device run time status (i.e., calibration statistics) and qubit topology into consideration. Using this quantum error characterizing model, we developed an iterative algorithm over the generated Bayesian network state-graph for post-induction error mitigation. Thanks to more precise modeling of the error distribution latent structure and the proposed iterative method, our Q-Beep approach provides state of the art performance and can boost circuit execution fidelity by up to 234.6% on Bernstein-Vazirani circuits and on average 71.0% on QAOA solution quality, using 16 practical IBMQ quantum processors. For other benchmarks such as those in QASMBench, a fidelity improvement of up to 17.8% is attained. Q-Beep is a light-weight post-processing technique that can be performed offline and remotely, making it a useful tool for quantum vendors to adopt and provide more reliable circuit induction results. Q-Beep is maintained at github.com/pnnl/qbeep
Quantum walks provide a versatile framework for probing the structural and dynamical properties of complex systems ranging from biological networks to synthetic materials. However, their realization on current noisy pre-fault-tolerant quantum computers is fundamentally limited by decoherence. Conventional dense encodings of graph structures require prohibitively deep circuits, making them incompatible with existing hardware. Here we introduce an algorithm that leverages symmetry-sector encoding and trades circuit depth for the number of qubits, while integrating symmetry-respecting postselection as an effective noise-mitigation strategy. This combination enables us to execute practical quantum-walk circuits for biological network motifs on actual quantum hardware. We benchmark the proposed methodology against known state-of-the-art circuit architectures, highlighting significant reduction of circuit depth in our approach at the cost of moderate qubit overhead. Utilizing 40 qubits, we implement quantum walks on complex graphs containing up to 17 nodes and 20 edges -- the largest experiment on superconducting hardware to date, with the Hellinger fidelity exceeding 87% throughout 7 steps. We present a proof-of-principle case study that illustrates how experimentally obtained quantum-walk dynamics on a protein-protein-interaction network can be applied to prioritizing disease-associated genes. We discuss the framework scalability in the pre-fault-tolerant era and its potential for studying larger biological networks.