Write
153
edits
(Created page with "[https://arxiv.org/abs/1109.6887v2 Randomized benchmarking] is a fidelity estimation protocol that yields estimates of the computationally relevant errors without relying on a...") |
|||
Line 49: | Line 49: | ||
==Properties== | ==Properties== | ||
* '''Figure of merit''': average error rate, average gate fidelity | * '''Figure of merit''': average error rate, average gate fidelity | ||
* 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. | * 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. However in the case of [[interleaved randomized benchmarking]] | * The random gates are picked from the Clifford group. However in the case of [[interleaved randomized benchmarking]] | ||
* 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]]. |