Hardware-Efficient Randomized Compiling
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:44B5RTJGrecord.jsonopen to challenge →
read the original abstract
Randomized compiling (RC) is an efficient method for tailoring arbitrary Markovian errors into stochastic Pauli channels. However, the standard procedure for implementing the protocol in software comes with a large experimental overhead -- namely, it scales linearly in the number of desired randomizations, each of which must be generated and measured independently. In this work, we introduce a hardware-efficient algorithm for performing RC on a cycle-by-cycle basis on the lowest level of our FPGA-based control hardware during the execution of a circuit. Importantly, this algorithm performs a different randomization per shot with zero runtime overhead beyond measuring a circuit without RC. We implement our algorithm using the QubiC control hardware, where we demonstrate significant reduction in the overall runtime of circuits implemented with RC, as well as a significantly lower variance in measured observables.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation
SNT merges SV and PEC for subspace-tailored error mitigation in Trotterized FHM simulations, mapping out optimal combinations by hardware quality and shot budget while quantifying when noisy devices could surpass clas...
-
Coherent versus stochastic error injection on a repetition-code logical qubit in superconducting hardware
Experiment on transmon hardware finds no logical-fidelity difference between coherent and stochastic error injection on distance-3 and distance-5 repetition codes, contrary to free-fermion simulations; authors hypothe...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.