Theory of mirror benchmarking and demonstration on a quantum computer

• URL: http://arxiv.org/abs/2108.10431v2
• Date: Thu, 1 Jun 2023 20:53:24 GMT
• Title: Theory of mirror benchmarking and demonstration on a quantum computer
• Authors: Karl Mayer, Alex Hall, Thomas Gatterman, Si Khadir Halit, Kenny Lee, Justin Bohnet, Dan Gresh, Aaron Hankin, Kevin Gilmore, Justin Gerber and John Gaebler
• Abstract summary: A new class of protocols called mirror benchmarking was recently proposed to measure the system-level performance of quantum computers. We give a simple proof that mirror benchmarking leads to an exponential decay of the survival probability with sequence length. We present data from mirror benchmarking experiments run on the Honeywell System Model H1.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A new class of protocols called mirror benchmarking was recently proposed to measure the system-level performance of quantum computers. These protocols involve circuits with random sequences of gates followed by mirroring, that is, inverting each gate in the sequence. We give a simple proof that mirror benchmarking leads to an exponential decay of the survival probability with sequence length, under the uniform noise assumption, provided the twirling group forms a 2-design. The decay rate is determined by a quantity that is a quadratic function of the error channel, and for certain types of errors is equal to the unitarity. This result yields a new method for estimating the coherence of noise. We present data from mirror benchmarking experiments run on the Honeywell System Model H1. This data constitutes a set of performance curves, indicating the success probability for random circuits as a function of qubit number and circuit depth.

Related papers

• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements. We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate. In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Learning to rank quantum circuits for hardware-optimized performance enhancement [0.0]
  We introduce and experimentally test a machine-learning-based method for ranking logically equivalent quantum circuits. We compare our method to two common approaches: random layout selection and a publicly available baseline called Mapomatic. Our best model leads to a $1.8times$ reduction in selection error when compared to the baseline approach and a $3.2times$ reduction when compared to random selection.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• Randomized semi-quantum matrix processing [0.0]
  We present a hybrid quantum-classical framework for simulating generic matrix functions. The method is based on randomization over the Chebyshev approximation of the target function. We prove advantages on average depths, including quadratic speed-ups on costly parameters.
  arXiv  Detail & Related papers  (2023-07-21T18:00:28Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Non-Exponential Behaviour in Logical Randomized Benchmarking [0.0]
  We construct a gate and time-independent noise model that results in the output of a logical randomized benchmarking protocol. We show that the presence of machinery associated with the implementation of quantum error correction can facilitate non-exponential decay.
  arXiv  Detail & Related papers  (2022-12-11T12:30:27Z)
• 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)
• Faster Born probability estimation via gate merging and frame optimisation [3.9198548406564604]
  Outcome probabilities of any quantum circuit can be estimated using Monte Carlo sampling. We propose two classical sub-routines: circuit gate optimisation and frame optimisation. We numerically demonstrate that our methods provide improved scaling in the negativity overhead for all tested cases of random circuits.
  arXiv  Detail & Related papers  (2022-02-24T14:18:34Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• On the robustness of the hybrid qubit computational gates through simulated randomized benchmarking protocols [0.0]
  Noise characterization can be achieved by exploiting different techniques, such as randomization. A scalable and robust algorithm able to benchmark the full set of Clifford gates is called randomized benchmarking. In this study, we simulated randomized benchmarking protocols in a semiconducting all-electrical three-electron double-quantum dot qubit.
  arXiv  Detail & Related papers  (2020-11-03T09:35:39Z)

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.