Fair Sampling Error Analysis on NISQ Devices

Abstract

We study the status of fair sampling on Noisy Intermediate Scale Quantum (NISQ) devices, in particular the IBM Q family of backends. Using the recently introduced Grover Mixer-QAOA algorithm for discrete optimization, we generate fair sampling circuits to solve six problems of varying difficulty, each with several optimal solutions, which we then run on twenty backends across the IBM Q system. For a given circuit evaluated on a specific set of qubits, we evaluate: how frequently the qubits return an optimal solution to the problem, the fairness with which the qubits sample from all optimal solutions, and the reported hardware error rate of the qubits. To quantify fairness, we define a novel metric based on Pearson's ${\chi }^2$ test. We find that fairness is relatively high for circuits with small and large error rates, but drops for circuits with medium error rates. This indicates that structured errors dominate in this regime, while unstructured errors, which are random and thus inherently fair, dominate in noisier qubits and longer circuits. Our results show that fairness can be a powerful tool for understanding the intricate web of errors affecting current NISQ hardware.

References in corpus (11)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A Quantum Approximate Optimization Algorithm
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Scalable mitigation of measurement errors on quantum computers
• Fixed-point quantum search with an optimal number of queries
• Measuring the Capabilities of Quantum Computers
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• MAXCUT QAOA performance guarantees for p >1
• Fair Sampling by Simulated Annealing on Quantum Annealer
• Achieving fair sampling in quantum annealing
• Ground-state statistics from annealing algorithms: Quantum vs classical approaches

Cited by in corpus (8)

• Quantum Volume in Practice: What Users Can Expect from NISQ Devices
• Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems
• Correcting non-independent and non-identically distributed errors with surface codes
• Quantum Approximate Multi-Objective Optimization
• Sampling Rare Conformational Transitions with a Quantum Computer
• Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering
• Biased Degenerate Ground-State Sampling of Small Ising Models with Converged QAOA
• Counting with the quantum alternating operator ansatz