Editing Randomised Benchmarking
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 1: | Line 1: | ||
==Functionality Description== | ==Functionality Description== | ||
Randomized benchmarking refers to a collection of methods that aim to reliably estimating the magnitude of an average error of a quantum gate set in a robust fashion against state preparation and measurement error. It achieves this goal by applying sequences of feasible quantum gates of varying length, so that small errors are amplified | Randomized benchmarking refers to a collection of methods that aim to reliably estimating the magnitude of an average error of a quantum gate set in a robust fashion against state preparation and measurement error. One key [[figure of merit]] here is average gate fidelity. It achieves this goal by applying sequences of feasible quantum gates of varying length, so that small errors are amplified leading to reliable estimation. | ||
==Protocols== | ==Protocols== | ||
* [[ | * [[Standard Randomised Benchmarking]] | ||
* [[Interleaved Randomised Benchmarking]] | * [[Interleaved Randomised Benchmarking]] | ||
* [[Purity Benchmarking]] | * [[Purity Benchmarking]] | ||
==Properties== | ==Properties== | ||
* The figure of | * The noise model is assumed to be IID. | ||
* This method is insensitive to the SPAM errors | |||
* The figure of merit is average error rate, average fidelity of a noise quantum circuit. | |||
==Related Papers== | ==Related Papers== | ||