Randomized Benchmarking with Synthetic Quantum Circuits

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Fan, Yale, Murray, Riley, Ladd, Thaddeus D., Young, Kevin, Blume-Kohout, Robin
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913027657302016
author Fan, Yale
Murray, Riley
Ladd, Thaddeus D.
Young, Kevin
Blume-Kohout, Robin
author_facet Fan, Yale
Murray, Riley
Ladd, Thaddeus D.
Young, Kevin
Blume-Kohout, Robin
contents Noise characterization methods such as randomized benchmarking (RB) are critical for the development of scalable quantum computers. Modern RB protocols for multiqubit systems extract physically relevant error rates by exploiting the structure of the group representation generated by the set of benchmarked operations. However, existing techniques become prohibitively inefficient for representations that are highly reducible yet decompose into irreducible subspaces of high dimension. These situations prevail when benchmarking high-dimensional systems such as qudits or bosonic modes, where experimental control is limited to implementing a small subset of all possible unitary operations. We introduce a broad framework for enhancing the sample efficiency of RB that is sufficiently powerful to extend the practical reach of RB beyond the multiqubit setting. Our strategy, which applies to any benchmarking group, uses "synthetic" quantum circuits with classical post-processing of both input and output data to leverage the full structure of reducible superoperator representations. To demonstrate the efficacy of our approach, we develop a detailed theory of RB for systems with rotational symmetry. Such systems carry a natural action of the group $\text{SU}(2)$, and they form the basis for several novel quantum error-correcting codes. We show that, for measuring rotationally invariant error rates of experimentally accessible high-spin systems, our synthetic RB protocols offer a sample complexity advantage of more than two orders of magnitude relative to standard approaches such as character RB.
format Preprint
id arxiv_https___arxiv_org_abs_2412_18578
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Randomized Benchmarking with Synthetic Quantum Circuits
Fan, Yale
Murray, Riley
Ladd, Thaddeus D.
Young, Kevin
Blume-Kohout, Robin
Quantum Physics
Noise characterization methods such as randomized benchmarking (RB) are critical for the development of scalable quantum computers. Modern RB protocols for multiqubit systems extract physically relevant error rates by exploiting the structure of the group representation generated by the set of benchmarked operations. However, existing techniques become prohibitively inefficient for representations that are highly reducible yet decompose into irreducible subspaces of high dimension. These situations prevail when benchmarking high-dimensional systems such as qudits or bosonic modes, where experimental control is limited to implementing a small subset of all possible unitary operations. We introduce a broad framework for enhancing the sample efficiency of RB that is sufficiently powerful to extend the practical reach of RB beyond the multiqubit setting. Our strategy, which applies to any benchmarking group, uses "synthetic" quantum circuits with classical post-processing of both input and output data to leverage the full structure of reducible superoperator representations. To demonstrate the efficacy of our approach, we develop a detailed theory of RB for systems with rotational symmetry. Such systems carry a natural action of the group $\text{SU}(2)$, and they form the basis for several novel quantum error-correcting codes. We show that, for measuring rotationally invariant error rates of experimentally accessible high-spin systems, our synthetic RB protocols offer a sample complexity advantage of more than two orders of magnitude relative to standard approaches such as character RB.
title Randomized Benchmarking with Synthetic Quantum Circuits
topic Quantum Physics
url https://arxiv.org/abs/2412.18578