A framework for randomized benchmarking over compact groups

• URL: http://arxiv.org/abs/2111.10357v1
• Date: Fri, 19 Nov 2021 18:43:47 GMT
• Title: A framework for randomized benchmarking over compact groups
• Authors: Linghang Kong
• Abstract summary: characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to measure error rates in quantum systems. A general framework for RB was proposed, which encompassed most of the known RB protocols and overcame the limitation on error models in previous works. In this work we generalize the RB framework to continuous groups of gates and show that as long as the noise level is reasonably small, the output can be approximated as a linear combination of matrix exponential decays.
• Score: 0.6091702876917279
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to measure error rates in quantum systems. In a recent paper (arxiv:2010.07974), a general framework for RB was proposed, which encompassed most of the known RB protocols and overcame the limitation on error models in previous works. However, even this general framework has a restriction: it can only be applied to a finite group of gates. This does not meet the need posed by experiments, in particular the demand for benchmarking non-Clifford gates and continuous gate sets on quantum devices. In this work we generalize the RB framework to continuous groups of gates and show that as long as the noise level is reasonably small, the output can be approximated as a linear combination of matrix exponential decays. As an application, we numerically study the fully randomized benchmarking protocol (i.e. RB with the entire unitary group as the gate set) enabled by our proof. This provides a unified way to estimate the gate fidelity for any quantum gate in an experiment.

Related papers

• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Randomized benchmarking with random quantum circuits [1.3406858660972554]
  We derive guarantees for gates from arbitrary compact groups under experimentally plausible assumptions. We show that many relevant filtered RB schemes can be realized with random quantum circuits in linear depth. We show filtered RB to be sample-efficient for several relevant groups, including protocols addressing higher-order cross-talk.
  arXiv  Detail & Related papers  (2022-12-12T19:00:19Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• Demonstrating scalable randomized benchmarking of universal gate sets [0.0]
  We introduce and demonstrate a technique for scalable Randomized (RB) of many universal and continuously parameterized gate sets. We use our technique to benchmark universal gate sets on four qubits of the Advanced Quantum Testbed. We demonstrate that our technique scales to many qubits with experiments on a 27-qubit IBM Q processor.
  arXiv  Detail & Related papers  (2022-07-15T03:41:21Z)
• Randomized Benchmarking Beyond Groups [7.223374810607328]
  We formulate the emphuniversal benchmarking benchmarking (URB) framework. This framework does away with the group structure and replaces the recovery gate plus measurement component with a general post-processing'' POVM. We study the twirling map corresponding to the gate ensemble specified by the scheme.
  arXiv  Detail & Related papers  (2022-03-23T19:54:45Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking [14.315027895958304]
  We extend the original character RB derivation to explicitly treat non-multiplicity-free groups. We develop a new leakage RB protocol that applies to more general groups of gates. This example provides one of the few examples of a scalable non-Clifford RB protocol.
  arXiv  Detail & Related papers  (2020-10-30T18:00:01Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• A general framework for randomized benchmarking [1.1969556745575978]
  Randomized benchmarking (RB) refers to a collection of protocols that in the past decade have become central methods for characterizing quantum gates. We develop a rigorous framework of RB general enough to encompass virtually all known protocols as well as novel, more flexible extensions.
  arXiv  Detail & Related papers  (2020-10-15T18:38:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.