Export citation

Export citation

Choose format for download:

Download Citation

    Solovay-Kitaev algorithm and randomized compilation

    Oliver Maupin1, Ashlyn D. Burch2,*, Christopher G. Yale2, Matthew N. H. Chow3,2,†, Terra Colvin, Jr.4, Brandon Ruzic2, Melissa C. Revelle2, Brian K. McFarland2, Eduardo Ibarra-García-Padilla2 et al.

    Alejandro Rascon2,3, Andrew J. Landahl2,3, Susan M. Clark2, and Peter J. Love4,5

    • *Present address: Oak Ridge National Laboratory, Oak Ridge, TN 37830, USA.
    • †Present address: HRL Laboratories, Malibu, CA 90265-4797, USA.

    Phys. Rev. A 113, 062418 – Published 4 June, 2026

    DOI: https://doi.org/10.1103/ll6m-dbl7

    Abstract

    We analyze the use of the Solovay-Kitaev (SK) algorithm to generate an ensemble of one-qubit rotations over which to perform randomized compilation. We perform simulations to compare the trace distance between the quantum state resulting from an ideal one-qubit RZ rotation and discrete SK decompositions. We find that this simple randomized gate synthesis algorithm can reduce the approximation error of these rotations in the absence of gate errors in simulation by at least a factor of 2 compared to a naive gate synthesis algorithm. We test the technique under the effects of a simple coherent noise model and find that it can mitigate coherent noise. We also run our algorithm on Sandia National Laboratories' QSCOUT trapped-ion device and find that randomization is able to help in the presence of realistic noise sources.

    Physics Subject Headings (PhySH)

    Authorization Required

    We need you to provide your credentials before accessing this content.

    References (Subscription Required)

    Outline

    Information

    Sign In to Your Journals Account

    Filter

    Filter

    Article Lookup

    Enter a citation