Write
153
edits
Interleaved Randomised Benchmarking: Difference between revisions
→Properties
No edit summary |
|||
| Line 71: | Line 71: | ||
==Properties== | ==Properties== | ||
* '''Figure of merit''': average gate error | * '''Figure of merit''': average gate error | ||
* This protocol is used to estimate the average error of individual quantum computational gate | |||
* In the limits of either perfect random gates or that the average error of all gates is depolarizing, this protocol estimates the gate error perfectly | |||
* In the completely general case where the random gates have arbitrary errors with small average variation, this protocol provides explicit bounds for the error of the gate. These bounds give direct information regarding the quality of computational gates and thus useful information about reaching thresholds for fault-tolerant quantum computation. | |||
* This is a scalable protocol with the time complexity <math>O(n^4)</math> | |||
* 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 are picked from the Clifford group. | * The random gates used to benchmark the specific Clifford gate 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]]. | ||
==Procedure Description== | ==Procedure Description== | ||