arrow
Return

Coherent randomized benchmarking

delete2021-07-09
delete3
delete
OA
AI
J
Jorge Miguel-Ramiro *
A
Alexander Pirker
D
Duer, W.
DOI:10.1103/PhysRevResearch.3.033038delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits, and devices. Here, we propose to perform randomized benchmarking in a coherent way, where superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol having significant advantages with respect to gates that can be benchmarked, and in terms of efficiency and scalability. We show that, e.g., universal gate sets, the set of n-qudit Pauli operators or more general sets including arbitrary unitaries, as well as a particular n-qudit Clifford gate using only the Pauli set, can be efficiently benchmarked. The price to pay is an additional complexity to add control to the involved quantum operations. However, we demonstrate that this can be done by using auxiliary degrees of freedom that are naturally available in basically any physical realization, and are independent of the gates to be tested.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Physical Review Research cover
Physical Review Research
IF:
4.2
Papers:
7.6K
Citations:
2.7W

Organization

U
University of Innsbruck
Scholars:
9.8K
Papers: 8.6K
Citations: 8
Cited Papers

Cited Papers

Experimental quantum communication enhancement by superposing trajectories
err2021-01-29
err78
errOAAI
errRubino, Giulia; Rozema, Lee A.; Ebler, Daniel; Kristjansson, Hler; Salek, Sina; Guerin, Philippe Allard; Abbott, Alastair A.; Branciard, Cyril; Brukner, Caslav; Chiribella, Giulio; Walther, Philip
errShare
errSave
errShare
errSave
errShare
errSave
Scalable randomised benchmarking of non-Clifford gates
err2016-04-26
err82
errOAAI
errCross, Andrew W.; Magesan, Easwar; Bishop, Lev S.; Smolin, John A.; Gambetta, Jay M.
errShare
errSave
researcher View more