Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors

Abstract

We show that the Randomized Benchmarking (RB) protocol is a convolution amenable to Fourier space analysis. By adopting the mathematical framework of Fourier transforms of matrix-valued functions on groups established in recent work from Gowers and Hatami [Sbornik: Mathematics 208, 1784 (2017)], we provide an alternative proof of Wallman's [Quantum 2, 47 (2018)] and Proctor's [Phys. Rev. Lett. 119, 130502 (2017)] bounds on the effect of gate-dependent noise on randomized benchmarking. We show explicitly that as long as our faulty gate-set is close to the targeted representation of the Clifford group, an RB sequence is described by the exponential decay of a process that has exactly two eigenvalues close to one and the rest close to zero. This framework also allows us to construct a gauge in which the average gate-set error is a depolarizing channel parameterized by the RB decay rates, as well as a gauge which maximizes the fidelity with respect to the ideal gate-set.

References in corpus (13)

• Randomized Benchmarking of Quantum Gates
• An addressable quantum dot qubit with fault-tolerant control fidelity
• Robust randomized benchmarking of quantum processes
• Characterization of addressability by simultaneous randomized benchmarking
• Randomized benchmarking and process tomography for gate errors in a solid-state qubit
• Process verification of two-qubit quantum gates 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
• From randomized benchmarking experiments to gateset circuit fidelity: how to interpret randomized benchmarking decay parameters
• Hyperfine-Induced Decay in Triple Quantum Dots
• Comparing randomized benchmarking figure with average infidelity of quantum gate-set
• Randomized Benchmarking, Correlated Noise, and Ising Models

Cited by in corpus (6)

• Measuring the Capabilities of Quantum Computers
• A general framework for randomized benchmarking
• Real Randomized Benchmarking
• Accrediting outputs of noisy intermediate-scale quantum computing devices
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Estimation of correlations and non-separability in quantum channels via unitarity benchmarking