Suppressing quantum circuit errors due to system variability

Abstract

We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present day noisy quantum computing platforms. This method can be run post qubit routing or post-compilation, and consists of computing isomorphic subgraphs to input circuits and scoring each using heuristic cost functions derived from system calibration data. Using an independent standard algorithmic test suite we show that it is possible to recover on average nearly 40% of missing fidelity using better qubit selection via efficient to compute cost functions. We demonstrate additional performance gains by considering qubit placement over multiple quantum processors. The overhead from these tools is minimal with respect to other compilation steps, such as qubit routing, as the number of qubits increases. As such, our method can be used to find qubit mappings for problems at the scale of quantum advantage and beyond.

arXiv comment9 pages, 6 figures, 1 table

References in corpus (16)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Error mitigation for short-depth quantum circuits
• Validating quantum computers using randomized model circuits
• Optimal Quantum Circuits for General Two-Qubit Gates
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Trading classical and quantum computational resources
• Scalable mitigation of measurement errors on quantum computers
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Demonstration of fidelity improvement using dynamical decoupling with superconducting qubits
• Topological and subsystem codes on low-degree graphs with flag qubits
• Measuring the Capabilities of Quantum Computers
• Machine learning of noise-resilient quantum circuits
• A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
• A volumetric framework for quantum computer benchmarks
• rustworkx: A High-Performance Graph Library for Python

Cited by in corpus (26)

• Efficient Long-Range Entanglement using Dynamic Circuits
• Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
• Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
• Characterizing crosstalk of superconducting transmon processors
• Uncovering Local Integrability in Quantum Many-Body Dynamics
• Experimental simulation of daemonic work extraction in open quantum batteries on a digital quantum computer
• Algorithm-Oriented Qubit Mapping for Variational Quantum Algorithms
• SCIM MILQ: An HPC Quantum Scheduler
• Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
• Improving the Performance of Digitized Counterdiabatic Quantum Optimization via Algorithm-Oriented Qubit Mapping
• Learning to rank quantum circuits for hardware-optimized performance enhancement
• Teleporting two-qubit entanglement across 19 qubits on a superconducting quantum computer
• QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits
• Tensor Network enhanced Dynamic Multiproduct Formulas
• Symmetry-Based Quantum Circuit Mapping
• Improving Figures of Merit for Quantum Circuit Compilation
• Hardware-Efficient Preparation of Graph States on Near-Term Quantum Computers
• Quantum-Enhanced Simulation-Based Optimization for Newsvendor Problems
• Certified Random Number Generation using Quantum Computers
• Q-gen: A Parameterized Quantum Circuit Generator
• Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
• Qonductor: A Cloud Orchestrator for Quantum Computing
• Simulating Electron Transfer on Noisy Quantum Computers
• Zero-Noise Extrapolation via Cyclic Permutations of Quantum Circuit Layouts
• Diagnosing crosstalk in large-scale QPUs using zero-entropy classical shadows
• Noise-Aware Circuit Compilations for a Continuously Parameterized Two-Qubit Gateset