Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms

Abstract

Excitement about the promise of quantum computers is tempered by the reality that the hardware remains exceptionally fragile and error-prone, forming a bottleneck in the development of novel applications. In this manuscript, we describe and experimentally test a fully autonomous workflow designed to deterministically suppress errors in quantum algorithms from the gate level through to circuit execution and measurement. We introduce the key elements of this workflow, delivered as a software package called Fire Opal, and survey the underlying physical concepts: error-aware compilation, automated system-wide gate optimization, automated dynamical decoupling embedding for circuit-level error cancellation, and calibration-efficient measurement-error mitigation. We then present a comprehensive suite of performance benchmarks executed on IBM hardware, demonstrating up to > 1000X improvement over the best alternative expert-configured techniques available in the open literature. Benchmarking includes experiments using up to 16 qubit systems executing: Bernstein Vazirani, Quantum Fourier Transform, Grover's Search, QAOA, VQE, Syndrome extraction on a five-qubit Quantum Error Correction code, and Quantum Volume. Experiments reveal a strong contribution of Non-Markovian errors to baseline algorithmic performance; in all cases the deterministic error-suppression workflow delivers the highest performance and approaches incoherent error bounds without the need for any additional sampling or randomization overhead, while maintaining compatibility with all additional probabilistic error suppression techniques.

20 pages, 16 figures

References in corpus (13)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Randomized Benchmarking of Quantum Gates
• Fault-tolerant quantum computation with high threshold in two dimensions
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• Robust randomized benchmarking of quantum processes
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Process verification of two-qubit quantum gates by randomized benchmarking
• Experimental noise filtering by quantum control
• Deep Reinforcement Learning for Quantum Gate Control
• Foliated Quantum Codes
• Suppressing quantum circuit errors due to system variability
• Rolling quantum dice with a superconducting qubit

Cited by in corpus (17)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Combining quantum processors with real-time classical communication
• Quantum algorithms for scientific computing
• A Toffoli Gate Decomposition via Echoed Cross-Resonance Gates
• Mitigating controller noise in quantum gates using optimal control theory
• Tensor-based quantum phase difference estimation for large-scale demonstration
• Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
• Learning to rank quantum circuits for hardware-optimized performance enhancement
• Resource-efficient context-aware dynamical decoupling embedding for arbitrary large-scale quantum algorithms
• Empirical learning of dynamical decoupling on quantum processors
• Robust Finite-Temperature Many-Body Scarring on a Quantum Computer
• Q-gen: A Parameterized Quantum Circuit Generator
• Counting collisions in random circuit sampling for benchmarking quantum computers
• Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
• Bayesian mitigation of measurement errors in multiqubit experiments
• A Time Optimization Framework for the Implementation of Robust and Low-latency Quantum Circuits
• Tensor-based phase difference estimation on time series analysis