Randomized benchmarking in measurement-based quantum computing

Rafael Alexander, Peter Turner, Stephen Bartlett

Research output: Contribution to journalArticle (Academic Journal)peer-review

4 Citations (Scopus)
268 Downloads (Pure)

Abstract

Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are implemented via single-site measurements on a fixed universal resource state. Here we adapt the randomized benchmarking protocol for a single qubit to a linear cluster state computation, which provides partial, yet efficient characterization of the noise associated with the target gate set. Applying randomized benchmarking to measurement-based quantum computation exhibits an interesting interplay between the inherent randomness associated with logic gates in the measurement-based model and the random gate sequences used in benchmarking. We consider two different approaches: the first makes use of the standard single-qubit Clifford group, while the second uses recently introduced (non-Clifford) measurement-based 2-designs, which harness inherent randomness to implement gate sequences.
Original languageEnglish
Article number032303
Number of pages9
JournalPhysical Review A
Volume94
Issue number9
Early online date1 Sep 2016
DOIs
Publication statusPublished - 1 Sep 2016

Fingerprint Dive into the research topics of 'Randomized benchmarking in measurement-based quantum computing'. Together they form a unique fingerprint.

Cite this