Characterizing useful quantum computers


Wallman, J. (2018). Characterizing useful quantum computers. Perimeter Institute. https://pirsa.org/18020110


Wallman, Joel. Characterizing useful quantum computers. Perimeter Institute, Feb. 28, 2018, https://pirsa.org/18020110


          @misc{ pirsa_PIRSA:18020110,
            doi = {10.48660/18020110},
            url = {https://pirsa.org/18020110},
            author = {Wallman, Joel},
            keywords = {Quantum Information},
            language = {en},
            title = {Characterizing useful quantum computers},
            publisher = {Perimeter Institute},
            year = {2018},
            month = {feb},
            note = {PIRSA:18020110 see, \url{https://pirsa.org}}

Joel Wallman Institute for Quantum Computing (IQC)


Quantum computers can only offer a computational advantage when they have sufficiently many qubits operating with sufficiently small error rates. In this talk, I will show how both these requirements can be practically characterized by variants of randomized benchmarking protocols. I will first show that a simple modification to protocols based on randomized benchmarking allows multiplicative-precision estimates of error rates.  I will then outline a new protocol for estimating the fidelity of arbitrarily large quantum systems using only single-qubit randomizing gates.