Estimating the bias of CX gates via character randomized benchmarking
- URL: http://arxiv.org/abs/2206.00009v1
- Date: Tue, 31 May 2022 18:00:00 GMT
- Title: Estimating the bias of CX gates via character randomized benchmarking
- Authors: Jahan Claes and Shruti Puri
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recent work has demonstrated that high-threshold quantum error correction is
possible for biased-noise qubits, provided one can implement a controlled-not
(CX) gate that preserves the bias. Bias-preserving CX gates have been proposed
for several biased-noise qubit platforms, most notably Kerr cats. However,
experimentally measuring the noise bias is challenging as it requires
accurately estimating certain low-probability Pauli errors in the presence of
much larger state preparation and measurement (SPAM) errors. In this paper, we
introduce bias randomized benchmarking (BRB) as a technique for measuring bias
in quantum gates. BRB, like all RB protocols, is highly accurate and immune to
SPAM errors. Our first protocol, CX-dihedral BRB, is a straightforward method
to measure the bias of the entire CX-dihedral group. Our second protocol,
interleaved bias randomized benchmarking (IBRB), is a generalization of
interleaved RB tailored to the experimental constraints biased-noise qubits;
this is a more involved procedure that directly targets the bias of the CX gate
alone. Our BRB procedures occupy a middle ground between classic RB protocols
that only estimate the average fidelity, and tomographic RB protocols that
provide more detailed characterization of noise but require more measurements
as well as experimental capabilities that are not necessarily available in
biased-noise qubits.
Related papers
- Bias-Aware Minimisation: Understanding and Mitigating Estimator Bias in
Private SGD [56.01810892677744]
We show a connection between per-sample gradient norms and the estimation bias of the private gradient oracle used in DP-SGD.
We propose Bias-Aware Minimisation (BAM) that allows for the provable reduction of private gradient estimator bias.
arXiv Detail & Related papers (2023-08-23T09:20:41Z) - Estimating Coherent Contributions to the Error Profile Using Cycle Error Reconstruction [0.0]
We present a scalable and cycle-centric methodology for obtaining a detailed estimate of the coherent contribution to the error profile of a hard computing cycle.
We perform proof-of-concept experiments on three IBM chips, namely ibmq_guadalupe, ibmq_manila, and ibmq_montreal.
arXiv Detail & Related papers (2023-03-17T13:04:19Z) - High threshold codes for neutral atom qubits with biased erasure errors [0.0]
We identify a new type of structured noise motivated by neutral atom qubits, biased erasure errors.
We study the performance of this model using gate-level simulations of the XZZX surface code.
We discuss a potential physical implementation using a single plane of atoms and moveable tweezers.
arXiv Detail & Related papers (2023-02-06T19:01:32Z) - Benchmarking quantum logic operations relative to thresholds for fault
tolerance [0.02171671840172762]
We use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor.
We show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set.
arXiv Detail & Related papers (2022-07-18T17:41:58Z) - 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) - Partial Identification with Noisy Covariates: A Robust Optimization
Approach [94.10051154390237]
Causal inference from observational datasets often relies on measuring and adjusting for covariates.
We show that this robust optimization approach can extend a wide range of causal adjustment methods to perform partial identification.
Across synthetic and real datasets, we find that this approach provides ATE bounds with a higher coverage probability than existing methods.
arXiv Detail & Related papers (2022-02-22T04:24:26Z) - Information-Theoretic Bias Reduction via Causal View of Spurious
Correlation [71.9123886505321]
We propose an information-theoretic bias measurement technique through a causal interpretation of spurious correlation.
We present a novel debiasing framework against the algorithmic bias, which incorporates a bias regularization loss.
The proposed bias measurement and debiasing approaches are validated in diverse realistic scenarios.
arXiv Detail & Related papers (2022-01-10T01:19:31Z) - A framework for randomized benchmarking over compact groups [0.6091702876917279]
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.
arXiv Detail & Related papers (2021-11-19T18:43:47Z) - Learning to Estimate Without Bias [57.82628598276623]
Gauss theorem states that the weighted least squares estimator is a linear minimum variance unbiased estimation (MVUE) in linear models.
In this paper, we take a first step towards extending this result to non linear settings via deep learning with bias constraints.
A second motivation to BCE is in applications where multiple estimates of the same unknown are averaged for improved performance.
arXiv Detail & Related papers (2021-10-24T10:23:51Z) - Randomized benchmarking for non-Markovian noise [11.164202369517058]
We combine the randomized benchmarking protocol with a framework describing non-Markovian quantum phenomena.
We show that one can identify non-Markovian features of the noise directly from the ASF through its deviations from the Markovian case.
Our methods are directly implementable and pave the pathway to better understanding correlated noise in quantum processors.
arXiv Detail & Related papers (2021-07-12T13:10:05Z) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z)
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.