Experimental demonstration of Pauli-frame randomization on a superconducting qubit

Abstract

The promise of quantum computing with imperfect qubits relies on the ability of a quantum computing system to scale cheaply through error correction and fault-tolerance. While fault-tolerance requires relatively mild assumptions about the nature of qubit errors, the overhead associated with coherent and non-Markovian errors can be orders of magnitude larger than the overhead associated with purely stochastic Markovian errors. One proposal to address this challenge is to randomize the circuits of interest, shaping the errors to be stochastic Pauli errors but leaving the aggregate computation unaffected. The randomization technique can also suppress couplings to slow degrees of freedom associated with non-Markovian evolution. Here we demonstrate the implementation of Pauli-frame randomization in a superconducting circuit system, exploiting a flexible programming and control infrastructure to achieve this with low effort. We use high-accuracy gate-set tomography to characterize in detail the properties of the circuit error, with and without the randomization procedure, which allows us to make rigorous statements about Markovianity as well as the nature of the observed errors. We demonstrate that randomization suppresses signatures of non-Markovian evolution to statistically insignificant levels, from a Markovian model violation ranging from $43\sigma$ to $1987\sigma$, down to violations between $0.3\sigma$ and $2.7\sigma$ under randomization. Moreover, we demonstrate that, under randomization, the experimental errors are well described by a Pauli error model, with model violations that are similarly insignificant (between $0.8\sigma$ and $2.7\sigma$). Importantly, all these improvements in the model accuracy were obtained without degradation to fidelity, and with some improvements to error rates as quantified by the diamond norm.

arXiv commentv4: 11 pages, 5 figures

References in corpus (43)

• Mixed State Entanglement and Quantum Error Correction
• Quantum Teleportation is a Universal Computational Primitive
• Improved Simulation of Stabilizer Circuits
• Quantum Computing with Very Noisy Devices
• Randomized Benchmarking of Quantum Gates
• Prescription for experimental determination of the dynamics of a quantum black box
• Robust randomized benchmarking of quantum processes
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate
• 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
• Characterizing Quantum Gates via Randomized Benchmarking
• Fast Scalable State Measurement with Superconducting Qubits
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
• Quantum Data Hiding
• Self-Consistent Quantum Process Tomography
• Implementing a strand of a scalable fault-tolerant quantum computing fabric
• Symmetrised Characterisation of Noisy Quantum Processes
• Experimental demonstration of fault-tolerant state preparation with superconducting qubits
• Implementing optimal control pulse shaping for improved single-qubit gates
• Feedback control of a solid-state qubit using high-fidelity projective measurement
• Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
• Random decoupling schemes for quantum dynamical control and error suppression
• Comparing Experiments to the Fault-Tolerance Threshold
• What randomized benchmarking actually measures
• Robust Extraction of Tomographic Information via Randomized Benchmarking
• Randomized benchmarking with gate-dependent noise
• Hardware for Dynamic Quantum Computing
• Restless Tuneup of High-Fidelity Qubit Gates
• Fault-tolerant quantum computation versus Gaussian noise
• Experimentally scalable protocol for identification of correctable codes
• Exact Performance of Concatenated Quantum Codes
• Tomography via Correlation of Noisy Measurement Records
• Quantum error correction of coherent errors by randomization
• Self-consistent tomography of the state-measurement Gram matrix
• Practical experimental certification of computational quantum gates via twirling
• Scalable in-situ qubit calibration during repetitive error detection
• Demonstration of Robust Quantum Gate Tomography via Randomized Benchmarking
• Generalized Performance of Concatenated Quantum Codes -- A Dynamical Systems Approach

Cited by in corpus (1)

• Operational, gauge-free quantum tomography