Editing Interleaved Randomised Benchmarking
Jump to navigation
Jump to search
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 71: | Line 71: | ||
==Properties== | ==Properties== | ||
* '''Figure of merit''': average gate error | * '''Figure of merit''': average gate error | ||
* The errors which are considered here are State preparation and measurement errors, error on the final gate, which are gate and time-independent errors. Gate and time-dependent errors can also be taken into consideration. This method is insensitive to SPAM error. | * The errors which are considered here are State preparation and measurement errors, error on the final gate, which are gate and time-independent errors. Gate and time-dependent errors can also be taken into consideration. This method is insensitive to SPAM error. | ||
* The random gates | * The random gates are picked from the Clifford group. | ||
* For noise estimation, the uniform probability distribution over Clifford group comprises a [[unitary 2-design]]. | * For noise estimation, the uniform probability distribution over Clifford group comprises a [[unitary 2-design]]. | ||
* This protocol provides a scalable method for benchmarking the set of Clifford gates. | |||
* To obtain a more accurate value for <math>p</math> one should always use the first order fitting model unless prior knowledge of the noise indicates that it is effectively gate-independent. | |||
==Procedure Description== | ==Procedure Description== |