Optimized Noise Suppression for Quantum Circuits

Abstract

Quantum computation promises to advance a wide range of computational tasks. However, current quantum hardware suffers from noise and is too small for error correction. Thus, accurately utilizing noisy quantum computers strongly relies on noise characterization, mitigation, and suppression. Crucially, these methods must also be efficient in terms of their classical and quantum overhead. Here, we efficiently characterize and mitigate crosstalk noise, which is a severe error source in, e.g., cross-resonance based superconducting quantum processors. For crosstalk characterization, we develop a simplified measurement experiment. Furthermore, we analyze the problem of optimal experiment scheduling and solve it for common hardware architectures. After characterization, we mitigate noise in quantum circuits by a noise-aware qubit routing algorithm. Our integer programming algorithm extends previous work on optimized qubit routing by swap insertion. We incorporate the measured crosstalk errors in addition to other, more easily accessible noise data in the objective function. Furthermore, we strengthen the underlying integer linear model by proving a convex hull result about an associated class of polytopes, which has applications beyond this work. We evaluate the proposed method by characterizing crosstalk noise for two chips with up to 127 qubits and leverage the resulting data to improve the approximation ratio of the Quantum Approximate Optimization Algorithm by up to 10 % compared to other established noise-aware routing methods. Our work clearly demonstrates the gains of including noise data when mapping abstract quantum circuits to hardware native ones.

major revision

References in corpus (39)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• A Quantum Engineer's Guide to Superconducting Qubits
• Error mitigation for short-depth quantum circuits
• Suppressing quantum errors by scaling a surface code logical qubit
• Quantum algorithms for quantum chemistry and quantum materials science
• Robust randomized benchmarking of quantum processes
• Challenges and Opportunities in Quantum Machine Learning
• Quantum optimization using variational algorithms on near-term quantum devices
• Noise tailoring for scalable quantum computation via randomized compiling
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Characterization of addressability by simultaneous randomized benchmarking
• Warm-starting quantum optimization
• Characterizing large-scale quantum computers via cycle benchmarking
• Detecting crosstalk errors in quantum information processors
• Model-free readout-error mitigation for quantum expectation values
• Three Qubit Randomized Benchmarking
• Suppression of crosstalk in superconducting qubits using dynamical decoupling
• Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
• Quantum crosstalk cancellation for fast entangling gates and improved multi-qubit performance
• Extracting Success from IBM's 20-Qubit Machines Using Error-Aware Compilation
• Quantum Crosstalk Robust Quantum Control
• Methods for Measuring Magnetic Flux Crosstalk Between Tunable Transmons
• Quantum error correction of coherent errors by randomization
• Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
• Crosstalk Suppression in Individually Addressed Two-Qubit Gates in a Trapped-Ion Quantum Computer
• Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
• Simulating and mitigating crosstalk
• Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
• Characterizing crosstalk of superconducting transmon processors
• On Optimal Subarchitectures for Quantum Circuit Mapping
• Improving Quantum Computation by Optimized Qubit Routing
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer
• Extended formulations for convex hulls of graphs of bilinear functions