A Theory of Direct Randomized Benchmarking

• URL: http://arxiv.org/abs/2302.13853v1
• Date: Mon, 27 Feb 2023 14:53:15 GMT
• Title: A Theory of Direct Randomized Benchmarking
• Authors: Anthony M. Polloreno and Arnaud Carignan-Dugas and Jordan Hines and Robin Blume-Kohout and Kevin Young and Timothy Proctor
• Abstract summary: We show how to design direct RB experiments, and we present two theories for direct RB. We prove that the direct RB decay is a single exponential, and that the decay rate is equal to the average of the benchmarked gates. Our second theory proves that direct RB is reliable for gates that experience general gate-dependent Markovian errors.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Randomized benchmarking (RB) protocols are widely used to measure an average error rate for a set of quantum logic gates. However, the standard version of RB is limited because it only benchmarks a processor's native gates indirectly, by using them in composite $n$-qubit Clifford gates. Standard RB's reliance on $n$-qubit Clifford gates restricts it to the few-qubit regime, because the fidelity of a typical composite $n$-qubit Clifford gate decreases rapidly with increasing $n$. Furthermore, although standard RB is often used to infer the error rate of native gates, by rescaling standard RB's error per Clifford to an error per native gate, this is an unreliable extrapolation. Direct RB is a method that addresses these limitations of standard RB, by directly benchmarking a customizable gate set, such as a processor's native gates. Here we provide a detailed introduction to direct RB, we discuss how to design direct RB experiments, and we present two complementary theories for direct RB. The first of these theories uses the concept of error propagation or scrambling in random circuits to show that direct RB is reliable for gates that experience stochastic Pauli errors. We prove that the direct RB decay is a single exponential, and that the decay rate is equal to the average infidelity of the benchmarked gates, under broad circumstances. This theory shows that group twirling is not required for reliable RB. Our second theory proves that direct RB is reliable for gates that experience general gate-dependent Markovian errors, using similar techniques to contemporary theories for standard RB. Our two theories for direct RB have complementary regimes of applicability, and they provide complementary perspectives on why direct RB works. Together these theories provide comprehensive guarantees on the reliability of direct RB.

Related papers

• ARB-LLM: Alternating Refined Binarizations for Large Language Models [82.24826360906341]
  ARB-LLM is a novel 1-bit post-training quantization (PTQ) technique tailored for Large Language Models (LLMs) As a binary PTQ method, our ARB-LLM$_textRC$ is the first to surpass FP16 models of the same size.
  arXiv  Detail & Related papers  (2024-10-04T03:50:10Z)
• Fully scalable randomized benchmarking without motion reversal [0.0]
  BiRB reliably and efficiently extracts the average error rate of a Clifford gate set. Unlike existing RB methods, BiRB does not use motion reversal circuits.
  arXiv  Detail & Related papers  (2023-09-10T21:45:00Z)
• 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)
• Estimating the bias of CX gates via character randomized benchmarking [0.0]
  We introduce bias randomized benchmarking (BRB) as a technique for measuring bias in quantum gates. BRB is highly accurate and immune to SPAM errors. Our second protocol, interleaved bias randomized benchmarking (IBRB), is a generalization of interleaved RB tailored to the experimental constraints biased-noise qubits.
  arXiv  Detail & Related papers  (2022-05-31T18:00:00Z)
• Distributionally Robust Models with Parametric Likelihood Ratios [123.05074253513935]
  Three simple ideas allow us to train models with DRO using a broader class of parametric likelihood ratios. We find that models trained with the resulting parametric adversaries are consistently more robust to subpopulation shifts when compared to other DRO approaches.
  arXiv  Detail & Related papers  (2022-04-13T12:43:12Z)
• 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)
• Experimental Characterization of Fault-Tolerant Circuits in Small-Scale Quantum Processors [67.47400131519277]
  A code's logical gate set may be deemed fault-tolerant for gate sequences larger than 10 gates. Some circuits did not satisfy the fault tolerance criterion. It is most accurate to assess the fault tolerance criterion when the circuits tested are restricted to those that give rise to an output state with a low dimension.
  arXiv  Detail & Related papers  (2021-12-08T01:52:36Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• KL Guided Domain Adaptation [88.19298405363452]
  Domain adaptation is an important problem and often needed for real-world applications. A common approach in the domain adaptation literature is to learn a representation of the input that has the same distributions over the source and the target domain. We show that with a probabilistic representation network, the KL term can be estimated efficiently via minibatch samples.
  arXiv  Detail & Related papers  (2021-06-14T22:24:23Z)
• 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)

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.