Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor

Abstract

The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error which has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors, and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally-measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing.

References in corpus (37)

• Circuit Quantum Electrodynamics: Coherent Coupling of a Single Photon to a Cooper Pair Box
• Charge insensitive qubit design derived from the Cooper pair box
• Quantum computational advantage using photons
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Efficient Z-Gates for Quantum Computing
• Noise tailoring for scalable quantum computation via randomized compiling
• Scalable Noise Estimation with Random Unitary Operators
• Procedure for systematically tuning up crosstalk in the cross resonance gate
• A simple all-microwave entangling gate for fixed-frequency superconducting qubits
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• A random compiler for fast Hamiltonian simulation
• Random Quantum Circuits are Approximate 2-designs
• Self-Consistent Quantum Process Tomography
• Quantum Information Scrambling in a Superconducting Qutrit Processor
• Characterizing large-scale quantum computers via cycle benchmarking
• Subsystem fault tolerance with the Bacon-Shor code
• Estimating the Coherence of Noise
• Microwave-induced coupling of superconducting qubits
• Randomized Benchmarking with Confidence
• Comparing Experiments to the Fault-Tolerance Threshold
• Quantum computation with universal error mitigation on superconducting quantum processor
• Improving wafer-scale Josephson junction resistance variation in superconducting quantum coherent circuits
• Efficient estimation of Pauli channels
• Bounding quantum gate error rate based on reported average fidelity
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Benchmarking Coherent Errors in Controlled-Phase Gates due to Spectator Qubits
• Modeling coherent errors in quantum error correction
• Quantum error correction of coherent errors by randomization
• Mitigating Coherent Noise Using Pauli Conjugation
• Self-consistent tomography of the state-measurement Gram matrix
• Shorter gate sequences for quantum computing by mixing unitaries
• Hard decoding algorithm for optimizing thresholds under general Markovian noise
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates

Cited by in corpus (21)

• Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
• QubiC: An open source FPGA-based control and measurement system for superconducting quantum information processors
• Machine Learning for Practical Quantum Error Mitigation
• QDiff: Differential Testing of Quantum Software Stacks
• The learnability of Pauli noise
• Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
• Visualizing Dynamics of Charges and Strings in (2+1)D Lattice Gauge Theories
• Experimental accreditation of outputs of noisy quantum computers
• Adaptive quantum error mitigation using pulse-based inverse evolutions
• Benchmarking universal quantum gates via channel spectrum
• Benchmarking quantum logic operations relative to thresholds for fault tolerance
• Correcting Coherent Errors by Random Operation on Actual Quantum Hardware
• Efficient diagnostics for quantum error correction
• Gate-set evaluation metrics for closed-loop optimal control on nitrogen-vacancy center ensembles in diamond
• Charge-parity switching effects and optimisation of transmon-qubit design parameters
• Probabilistic state synthesis based on optimal convex approximation
• Noisy Probabilistic Error Cancellation and Generalized Physical Implementability
• Circuit-Noise-Resilient Virtual Distillation
• Dynamic thermalization on noisy quantum hardware
• Bridging Pulse and Circuit Levels: A Geometric Framework for Deterministic Error Suppression
• Error mitigation via stabilizer measurement emulation