Randomized benchmarking in measurement-based quantum computing

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.

10 pages, 4 figures, comments welcome; v2 published version

References in corpus (16)

• Randomized Benchmarking of Quantum Gates
• Resource-efficient linear optical quantum computation
• Robust randomized benchmarking of quantum processes
• Noise tailoring for scalable quantum computation via randomized compiling
• Evenly distributed unitaries: on the structure of unitary designs
• A photonic cluster state machine gun
• From three-photon GHZ states to ballistic universal quantum computation
• Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
• Quantum computation on the edge of a symmetry-protected topological order
• Quantum accuracy threshold for concatenated distance-3 codes
• Optical one-way quantum computing with a simulated valence-bond solid
• Simple proof of fault tolerance in the graph-state model
• Symmetry protection of measurement-based quantum computation in ground states
• Accelerated Randomized Benchmarking
• Near-deterministic creation of universal cluster states with probabilistic Bell measurements and 3-qubit resource states
• Derandomizing quantum circuits with measurement based unitary designs

Cited by in corpus (10)

• A general framework for randomized benchmarking
• What randomized benchmarking actually measures
• One-hundred step measurement-based quantum computation multiplexed in the time domain with 25 MHz clock frequency
• Driven quantum dynamics: will it blend?
• Generating Haar-uniform Randomness using Stochastic Quantum Walks on a Photonic Chip
• Randomized benchmarking for qudit Clifford gates
• Coherent randomized benchmarking
• Quantifying Entanglement in Cluster States Built with Error-Prone Interactions
• Measurement-based interleaved randomised benchmarking using IBM processors
• Investigating the effect of noise channels on the quality of unitary t-designs