Characterizing useful quantum computers

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.

Event Type: 
Scientific Area(s): 
Event Date: 
Mercredi, Février 28, 2018 - 16:00 to 17:30
Bob Room
Room #: