Approximate randomized benchmarking for finite groups

DOI10.1088/1751-8121/AAD6FAMaRDI QIDQ3119969zbMATH OpenOpenAlexWikidataFDO

Authors D. S. França, A. K. Hashagen

Publication date 28 February 2019

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.03621

zbMATH Keywords

random walks on groupsquantum gatesClifford gatesfidelity estimationmonomial unitaryrandomized benchmarking

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Random fields (60G60) Quantum computation (81P68) Clifford algebras, spinors (15A66) (p)-adic representations of finite groups (20C11)

Abstract: We investigate randomized benchmarking in a general setting with quantum gates that form a representation, not necessarily an irreducible one, of a finite group. We derive an estimate for the average fidelity, to which experimental data may then be calibrated. Furthermore, we establish that randomized benchmarking can be achieved by the sole implementation of quantum gates that generate the group as well as one additional arbitrary group element. In this case, we need to assume that the noise is close to being covariant. This yields a more practical approach to randomized benchmarking. Moreover, we show that randomized benchmarking is stable with respect to approximate Haar sampling for the sequences of gates. This opens up the possibility of using Markov chain Monte Carlo methods to obtain the random sequences of gates more efficiently. We demonstrate these results numerically using the well-studied example of the Clifford group as well as the group of monomial unitary matrices. For the latter, we focus on the subgroup with nonzero entries consisting of n-th roots of unity, which contains T gates.

Recommendations

• Comparing the randomized benchmarking figure with the average infidelity of a quantum gate-set
• Randomized benchmarking with confidence
• Accelerated randomized benchmarking
• Representations of the multi-qubit Clifford group
• Random quantum circuits are approximate 2-designs

Cites work

• scientific article; zbMATH DE number 2042290 (Why is no real title available?)
• scientific article; zbMATH DE number 835752 (Why is no real title available?)
• A monomial matrix formalism to describe quantum many-body states
• A review of the parameter estimation problem of fitting positive exponential sums to empirical data
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Classical and Quantum Information Theory
• Contractivity of positive and trace-preserving maps under Lp norms
• Ergodic and mixing quantum channels in finite dimensions
• How to efficiently select an arbitrary Clifford group element
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Probability Inequalities for Sums of Bounded Random Variables
• Random quantum circuits are approximate 2-designs
• Randomized benchmarking with confidence
• Structure of irreducibly covariant quantum channels for finite groups
• The mathematical language of quantum theory. From uncertainty to entanglement
• Unital quantum channels - convex structure and revivals of Birkhoff's theorem

Cited in

(4)

• Positive maps from irreducibly covariant operators
• Comparing the randomized benchmarking figure with the average infidelity of a quantum gate-set
• Group representations that resist random sampling
• Accelerated randomized benchmarking

This page was built for publication: Approximate randomized benchmarking for finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3119969)