HAMMER: boosting fidelity of noisy Quantum circuits by exploiting Hamming behavior of erroneous outcomes

Abstract

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. We propose Hamming Reconstruction (HAMMER), a post-processing technique that leverages the observation of Hamming behavior to reconstruct the noisy output distribution, such that the resulting distribution has higher fidelity. We evaluate HAMMER using experimental data from Google and IBM quantum computers with more than 500 unique quantum circuits and obtain an average improvement of 1.37x in the quality of solution. On Google's publicly available QAOA datasets, we show that HAMMER sharpens the gradients on the cost function landscape.

References in corpus (20)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Validating quantum computers using randomized model circuits
• Quantum computing for finance: overview and prospects
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Mitigating measurement errors in multi-qubit experiments
• Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
• Extracting Success from IBM's 20-Qubit Machines Using Error-Aware Compilation
• Dynamical phase transitions, temporal orthogonality and the dynamics of observables in one dimensional ultra-cold quantum gases: from the continuum to the lattice
• Measurement Error Mitigation in Quantum Computers Through Classical Bit-Flip Correction
• ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
• Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
• A hybrid quantum-classical approach to mitigating measurement errors
• Measurement Error Mitigation for Variational Quantum Algorithms
• Resource-Efficient Quantum Computing by Breaking Abstractions
• JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting

Cited by in corpus (4)

• Red-QAOA: Efficient Variational Optimization through Circuit Reduction
• Maximum Likelihood Quantum Error Mitigation for Algorithms with a Single Correct Output
• QRCC: Evaluating Large Quantum Circuits on Small Quantum Computers through Integrated Qubit Reuse and Circuit Cutting
• Q-Cluster: Quantum Error Mitigation Through Noise-Aware Unsupervised Learning