Randomized Benchmarking with Restricted Gate Sets

Abstract

Standard randomized benchmarking protocols entail sampling from a unitary 2 design, which is not always practical. In this article we examine randomized benchmarking protocols based on subgroups of the Clifford group that are not unitary 2 designs. We introduce a general method for analyzing such protocols and subsequently apply it to two subgroups, the group generated by controlled-NOT, Hadamard, and Pauli gates and that generated by only controlled-NOT and Pauli gates. In both cases the error probability can be estimated to within a factor of two or less where the factor can be arranged to be conservative and to decay exponentially in the number of qubits. For randomized benchmarking of logical qubits even better accuracy will typically be obtained. Thus, we show that sampling a distribution which is close to a unitary 2 design, although sufficient, is not necessary for randomized benchmarking to high accuracy.

6 pages, no figures

References in corpus (7)

• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Randomized benchmarking and process tomography for gate errors in a solid-state qubit
• Quantifying the quantum gate fidelity of single-atom spin qubits in silicon by randomized benchmarking
• Randomized Benchmarking of Multi-Qubit Gates
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
• Randomized benchmarking of atomic qubits in an optical lattice

Cited by in corpus (30)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Theory of quantum system certification: a tutorial
• Fault-Tolerant Logical Gates in the IBM Quantum Experience
• A general framework for randomized benchmarking
• Efficient estimation of Pauli channels
• Direct randomized benchmarking for multi-qubit devices
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Probing context-dependent errors in quantum processors
• Recovering quantum gates from few average gate fidelities
• Real Randomized Benchmarking
• Randomized benchmarking for individual quantum gates
• Subspace benchmarking high-fidelity entangling operations with trapped ions
• Approximate Randomized Benchmarking for Finite Groups
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Demonstrating scalable randomized benchmarking of universal gate sets
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
• A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)
• Benchmarking quantum gates and circuits
• Operational, gauge-free quantum tomography
• Fully scalable randomized benchmarking without motion reversal
• Towards a general framework of Randomized Benchmarking incorporating non-Markovian Noise
• Randomized benchmarking in the presence of time-correlated dephasing noise
• Coherent randomized benchmarking
• Estimating the bias of CX gates via character randomized benchmarking
• Measurement-based interleaved randomised benchmarking using IBM processors
• A Theory of Direct Randomized Benchmarking
• Leakage Benchmarking for Universal Gate Sets
• Partial randomized benchmarking
• Error Mitigation of BQP Computations using Measurement-Based Verification